IP Library Granted Patent US 12,215,981
Granted Patent B2
US 12,215,981 · App. 16/836,141 · Granted Feb 4, 2025

Multi-modal route generation system

Inventors: Keyan Pishdadian (Seattle, WA); Mikhail Skobov (Seattle, WA); Ian Todd Williams (Seattle, WA)
Assignee: Lyft, Inc.
G01C21/3423G01C21/3492G01C21/362G01C21/3626G01C21/3697G06Q10/02G06Q50/40
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,215,981
App. No.
16/836,141
Granted
Feb 4, 2025
Kind
B2
Abstract

Methods and systems for improved generation of multi-modal transportation routes are provided. In one embodiment, a method is provided that includes generating a network of route segments. At least a portion of the route segments may be associated with a rideable modality. At least one route segment of the network may be updated based on a changed condition of the rideable modality. Routes may be generated, based on the network, that utilize the rideable modality and at least one of the routes may be sent to a computing device for display.

Claims (67)

1. A system comprising:

a processor; and

a memory storing instructions which, when executed by the processor, cause the processor to:

generate a network of route segments for a plurality of modalities by:

generating a first subnetwork of segments corresponding to a docked rideable modality comprising a first set of indicators to add or remove one or more of the first subnetwork of segments based on availability;

generating a second subnetwork of segments corresponding to a dockless rideable modality comprising a second set of indicators to add or remove one or more of the second subnetwork of segments based on distance thresholds;

generating a third subnetwork of segments corresponding to at least one additional modality comprising at least one of an automobile modality, a bus modality, or a train modality comprising a third set of indicators to add or remove one or more of the third subnetwork of segments; and

generating connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork;

communicate with a computing device of a transportation matching system to determine a changed condition by:

receiving status updates of at least one docked rideable vehicle availability by communicating with a dock or at least one docked rideable vehicle corresponding to the first subnetwork of segments; or

receiving additional status updates of at least one dockless rideable vehicle range by communicating with at least one dockless rideable vehicle corresponding to the second subnetwork of segments;

update one or more of the first set of indicators for one or more segments of the first subnetwork of segments based on the changed condition from status updates of the at least one docked rideable vehicle to indicate segment availability of the one or more segments of the first subnetwork of segments;

update one or more of the second set of indicators for the second subnetwork of segments based on the changed condition from the additional status updates of the at least one dockless rideable vehicle to indicate segment availability of the one or more segments of the second subnetwork of segments;

update the network of route segments by adding or removing the one or more segments from the first subnetwork of segments utilizing the one or more of the first set of indicators or the one or more segments from the second subnetwork of segments utilizing the one or more of the second set of indicators;

in response to receiving a transportation request from a requestor computing device, generate, based on the network of route segments for the plurality of modalities and the connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork, one or more routes comprising the at least one additional modality and at least one of the docked rideable modality from the updated network of route segments based on the first set of indicators or the dockless rideable modality from the updated network of route segments based on the second set of indicators; and

transmit, for display via a user interface of the requestor computing device, the one or more routes corresponding to the transportation request.

2. The system of claim 1 , wherein the instructions further cause the processor to update the network of route segments by:

determine an additional changed condition based on additional status updates of the at least one docked rideable vehicle availability or additional status updates of the at least one dockless rideable vehicle range;

modify the one or more indicators of the first set of indicators based on the additional changed condition;

modify the one or more indicators of the second set of indicators based on the additional changed condition; and

update the network of route segments by adding or removing an additional one or more segments from the first subnetwork of segments utilizing the one or more modified indicators of first set of indicators or an additional one or more segments from the second subnetwork of segments utilizing the one or more modified indicators of the second set of indicators.

3. The system of claim 1 , wherein the instructions further cause the processor to generate the one or more routes by:

generating the first subnetwork of segments utilizing at least one docked rideable vehicle battery charge level of at least one docked rideable vehicle; or

generating the second subnetwork of segments utilizing at least one dockless rideable vehicle battery charge level of at least one dockless rideable vehicle.

4. The system of claim 3 , wherein the at least one docked rideable vehicle comprises an electric motor bicycle and wherein the at least one dockless rideable vehicle comprises an electric motor scooter.

5. The system of claim 1 , wherein the instructions further cause the processor to, based on a user interaction with the transportation request on the requestor computing device, updating the network of route segments based on the availability of the at least one additional modality and the at least one of the docked rideable modality from the updated network of route segments based on the first set of indicators or the dockless rideable modality from the updated network of route segments based on the second set of indicators.

6. The system of claim 1 , wherein the instructions further cause the processor to generate the one or more routes by generating walking segments between at least one of (i) a first location corresponding to a transportation request and the network or (ii) a second location corresponding to the transportation request and the network.

7. The system of claim 1 , wherein the instructions further cause the processor to generate the first subnetwork of segments and the third subnetwork of segments utilizing bi-directional segments.

8. The system of claim 1 , wherein the instructions further cause the processor to determine the changed condition by determining that at least one dockless rideable vehicle is no longer available or that at least one dockless rideable vehicle is available.

9. The system of claim 1 , wherein the instructions further cause the processor to generateing the network by removing at least one route segment that does not meet at least one of (i) a time requirement, (ii) a cost requirement, (iii) a distance requirement, or (iv) a vertical gain requirement.

10. The system of claim 1 , wherein the instructions further cause the processor to select the one or more routes based on a preference regarding at least one of cost, travel time, travel distance, wait times, number of transfers, traffic, or modalities utilized during transportation.

11. The system of claim 1 , wherein the instructions further cause the processor to generate, for the transportation request, multiple routes from the network of route segments based on optimality constraints including two or more of a travel time, a travel distance, a wait time, a number of transfers, an amount of traffic congestion, or an amount of vertical gain.

12. The system of claim 11 , wherein the instructions further cause the processor to transmit, for display via the user interface of the requestor computing device, the multiple routes based on the optimality constraints.

13. A method comprising:

generating a network of route segments for a plurality of modalities by:

generating a first subnetwork of segments corresponding to a docked rideable modality comprising a first set of indicators to add or remove one or more of the first subnetwork of segments based on availability;

generating a second subnetwork of segments corresponding to a dockless rideable modality comprising a second set of indicators to add or remove one or more of the second subnetwork of segments based on distance thresholds;

generating a third subnetwork of segments corresponding to at least one additional modality comprising at least one of an automobile modality, a bus modality, or a train modality comprising a third set of indicators to add or remove one or more of the third subnetwork of segments; and

generating connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork;

communicating with a computing device of a transportation matching system to determine a changed condition by:

receiving status updates of at least one docked rideable vehicle availability by communicating with a dock or at least one docked rideable vehicle corresponding to the first subnetwork of segments; or

receiving additional status updates of at least one dockless rideable vehicle range by communicating with at least one dockless rideable vehicle corresponding to the second subnetwork of segments;

updating one or more of the first set of indicators for one or more segments of the first subnetwork of segments based on the changed condition from status updates of the at least one docked rideable vehicle to indicate segment availability of the one or more segments of the first subnetwork of segments;

updating one or more of the second set of indicators for the second subnetwork of segments based on the changed condition from the additional status updates of the at least one dockless rideable vehicle to indicate segment availability of the one or more segments of the second subnetwork of segments;

updating the network of route segments by adding or removing the one or more segments from the first subnetwork of segments utilizing the one or more of the first set of indicators or the one or more segments from the second subnetwork of segments utilizing the one or more of the second set of indicators;

in response to receiving a transportation request from a requestor computing device, generating, based on the network of route segments for the plurality of modalities and the connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork, one or more routes comprising the at least one additional modality and at least one of the docked rideable modality from the updated network of route segments based on the first set of indicators or the dockless rideable modality from the updated network of route segments based on the second set of indicators; and

transmitting, for display via a user interface of the requestor computing device, the one or more routes corresponding to the transportation request.

14. The method of claim 13 , further comprising updating the network of route segments by updating the third subnetwork of segments based on the changed condition.

15. The method of claim 13 , further comprising transmitting, for display via the user interface of the requestor computing device, multiple routes based on multiple optimality constraints for the network of route segments in relation to the transportation request.

16. The method of claim 13 , further comprising generating, based on the network of route segments for the plurality of modalities and the connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork, the one or more routes based on a modality preference corresponding to a user of the requestor computing device.

17. The method of claim 16 , further comprising generating the one or more routes by generating walking segments between at least one of (i) a first location and the network or (ii) a second location and the network.

18. The method of claim 13 , further comprising determining the changed condition by determining that a dock is full or empty, determining that at least one dockless rideable vehicle is no longer available, or determining that at least one dockless rideable vehicle is available.

19. The method of claim 13 , further comprising generating at least one of the one or more routes based on an external route segment not included within the network.

20. A non-transitory, computer-readable medium storing instructions which, when executed by a processor, cause the processor to:

generate a network of route segments for a plurality of modalities by:

generating a first subnetwork of segments corresponding to a docked rideable modality comprising a first set of indicators to add or remove one or more of the first subnetwork of segments based on availability;

generating a second subnetwork of segments corresponding to a dockless rideable modality comprising a second set of indicators to add or remove one or more of the second subnetwork of segments based on distance thresholds;

generating a third subnetwork of segments corresponding to at least one additional modality comprising at least one of an automobile modality, a bus modality, or a train modality comprising a third set of indicators to add or remove one or more of the third subnetwork of segments; and

generating connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork;

communicate with a computing device of a transportation matching system to determine a changed condition by:

receiving status updates of at least one docked rideable vehicle availability by communicating with a dock or at least one docked rideable vehicle corresponding to the first subnetwork of segments; or

receiving additional status updates of at least one dockless rideable vehicle range by communicating with at least one dockless rideable vehicle corresponding to the second subnetwork of segments;

update one or more of the first set of indicators for one or more segments of the first subnetwork of segments based on the changed condition from status updates of the at least one docked rideable vehicle to indicate segment availability of the one or more segments of the first subnetwork of segments;

update one or more of the second set of indicators for the second subnetwork of segments based on the changed condition from the additional status updates of the at least one dockless rideable vehicle to indicate segment availability of the one or more segments of the second subnetwork of segments;

update the network of route segments by adding or removing the one or more segments from the first subnetwork of segments utilizing the one or more of the first set of indicators or the one or more segments from the second subnetwork of segments utilizing the one or more of the second set of indicators;

in response to receiving a transportation request from a requestor computing device, generate, based on the network of route segments for the plurality of modalities and the connecting segments between the first subnetwork, the second subnetwork, and the third subnetwork, one or more routes comprising the at least one additional modality and at least one of the docked rideable modality from the updated network of route segments based on the first set of indicators or the dockless rideable modality from the updated network of route segments based on the second set of indicators; and

transmit, for display via a user interface of the requestor computing device, the one or more routes corresponding to the transportation request.

Assignments (2)
SECURITY INTEREST Recorded Nov 3, 2022
From: LYFT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 061880/0237 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 16, 2020
From: PISHDADIAN, KEYAN; SKOBOV, MIKHAIL; WILLIAMS, IAN
To: LYFT, INC.
Reel/Frame 052417/0593 →
Continuity (1)
Related Publication 20210302175A1 · Sep 30, 2021
References Cited (178)
US 6208934B1 · Bechtolsheim et al. · 2001 [cited by applicant]
US 8489641B1 · Seefeld et al. · 2013 [cited by applicant]
US 9057612B1 · Savvopoulos · 2015 [cited by applicant]
US 9679487B1 · Hayward · 2017 [cited by applicant]
US 9689693B2 · Newlin · 2017 [cited by examiner]
US 9713963B2 · Liu et al. · 2017 [cited by applicant]
US 9752890B2 · Meisels et al. · 2017 [cited by applicant]
US 10248120B1 · Siegel et al. · 2019 [cited by applicant]
US 10248913B1 · Gururajan · 2019 [cited by applicant]
US 10249120B2 · Ahearn et al. · 2019 [cited by applicant]
US 10331727B2 · Naghdy et al. · 2019 [cited by applicant]
US 10371539B2 · Broyles et al. · 2019 [cited by applicant]
US 10408624B2 · Salowitz et al. · 2019 [cited by applicant]
US 10419878B1 · Sanchez et al. · 2019 [cited by applicant]
US 10545026B1 · Schaefer · 2020 [cited by applicant]
US 10594806B2 · Ishikawa · 2020 [cited by examiner]
US 10636109B2 · Bonanni, III et al. · 2020 [cited by applicant]
US 10648822B2 · Newlin · 2020 [cited by examiner]
US 10746555B1 · Spielman et al. · 2020 [cited by applicant]
US 10914600B1 · Spielman · 2021 [cited by examiner]
US 11100346B2 · Beaurepaire · 2021 [cited by examiner]
US 11226208B2 · Spielman · 2022 [cited by examiner]
US 11473924B2 · Spielman et al. · 2022 [cited by applicant]
US 11703336B2 · Spielman et al. · 2023 [cited by applicant]
US 11733049B2 · Spielman et al. · 2023 [cited by applicant]
US 20020161520A1 · Dutta et al. · 2002 [cited by applicant]
US 20050187707A1 · Yokota et al. · 2005 [cited by applicant]
US 20050251331A1 · Kreft · 2005 [cited by applicant]
US 20070073562A1 · Brice et al. · 2007 [cited by applicant]
US 20080208443A1 · Massie et al. · 2008 [cited by applicant]
US 20080248815A1 · Busch · 2008 [cited by applicant]
US 20090177387A1 · Liu · 2009 [cited by applicant]
US 20090271109A1 · Lee et al. · 2009 [cited by applicant]
US 20090319163A1 · Sutter et al. · 2009 [cited by applicant]
US 20110040479A1 · Uyama et al. · 2011 [cited by applicant]
US 20120010816A1 · Uyama et al. · 2012 [cited by applicant]
US 20120173134A1 · Gutman · 2012 [cited by applicant]
US 20120173135A1 · Gutman · 2012 [cited by applicant]
US 20130016012A1 · Beauregard · 2013 [cited by applicant]
US 20130073323A1 · Zacharia · 2013 [cited by applicant]
US 20130253833A1 · Tuukkanen · 2013 [cited by applicant]
US 20140005941A1 · Paek et al. · 2014 [cited by applicant]
US 20140006215A1 · Hornthal et al. · 2014 [cited by applicant]
US 20140052714A1 · Brodziak et al. · 2014 [cited by applicant]
US 20140351037A1 · Shaam et al. · 2014 [cited by applicant]
US 20140365113A1 · McGavran et al. · 2014 [cited by applicant]
US 20150032366A1 · Man et al. · 2015 [cited by applicant]
US 20150081418A1 · Sahai · 2015 [cited by applicant]
US 20150160028A1 · Burrows et al. · 2015 [cited by applicant]
US 20150187107A1 · Vander Mey et al. · 2015 [cited by applicant]
US 20150253143A1 · Bailiang et al. · 2015 [cited by applicant]
US 20160031506A1 · Lloyd et al. · 2016 [cited by applicant]
US 20160076905A1 · Broadbent et al. · 2016 [cited by applicant]
US 20160138925A1 · Takahashi · 2016 [cited by applicant]
US 20160203422A1 · Demarchi et al. · 2016 [cited by applicant]
US 20160298977A1 · Newlin et al. · 2016 [cited by applicant]
US 20160320194A1 · Liu et al. · 2016 [cited by applicant]
US 20160356603A1 · Hajj et al. · 2016 [cited by applicant]
US 20160358471A1 · Hajj et al. · 2016 [cited by applicant]
US 20160371800A1 · Kirshenboim · 2016 [cited by applicant]
US 20170074669A1 · Newlin et al. · 2017 [cited by applicant]
US 20170123618A1 · Porcella · 2017 [cited by applicant]
US 20170153113A1 · Gotoh et al. · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by examiner]
US 20170178268A1 · Ishikawa · 2017 [cited by examiner]
US 20170185271A1 · Manoharan et al. · 2017 [cited by applicant]
US 20170191841A1 · Marueli et al. · 2017 [cited by applicant]
US 20170213273A1 · Dietrich · 2017 [cited by examiner]
US 20170268891A1 · Dyrnaes et al. · 2017 [cited by applicant]
US 20170330111A1 · Vogel et al. · 2017 [cited by applicant]
US 20170357914A1 · Tulabandhula et al. · 2017 [cited by applicant]
US 20170358113A1 · Bray et al. · 2017 [cited by applicant]
US 20170359695A1 · Aerts · 2017 [cited by applicant]
US 20170370735A1 · Salowitz · 2017 [cited by applicant]
US 20180051995A1 · Delling et al. · 2018 [cited by applicant]
US 20180052002A1 · Delling et al. · 2018 [cited by applicant]
US 20180060778A1 · Guo · 2018 [cited by examiner]
US 20180091604A1 · Yamashita et al. · 2018 [cited by applicant]
US 20180113914A1 · Mehedy et al. · 2018 [cited by applicant]
US 20180135989A1 · Schreier et al. · 2018 [cited by applicant]
US 20180156623A1 · West et al. · 2018 [cited by applicant]
US 20180204252A1 · Boulard et al. · 2018 [cited by applicant]
US 20180211337A1 · Ghaddar et al. · 2018 [cited by applicant]
US 20180244288A1 · Glaser et al. · 2018 [cited by applicant]
US 20180341880A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180341881A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180341887A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180341888A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180341895A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180342033A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180342034A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180342113A1 · Kislovskiy et al. · 2018 [cited by applicant]
US 20180374032A1 · Pan et al. · 2018 [cited by applicant]
US 20190017839A1 · Eyler et al. · 2019 [cited by applicant]
US 20190046112A1 · Blanchard et al. · 2019 [cited by applicant]
US 20190056233A1 · Liu et al. · 2019 [cited by applicant]
US 20190101401A1 · Balva · 2019 [cited by applicant]
US 20190122315A1 · Valverde, Jr. et al. · 2019 [cited by applicant]
US 20190146500A1 · Yalla · 2019 [cited by applicant]
US 20190182626A1 · Miller et al. · 2019 [cited by applicant]
US 20190219411A1 · Christen et al. · 2019 [cited by applicant]
US 20190236743A1 · Bonanni, III et al. · 2019 [cited by applicant]
US 20190251503A1 · Simpson · 2019 [cited by applicant]
US 20190251509A1 · Simpson · 2019 [cited by applicant]
US 20190272589A1 · Simpson · 2019 [cited by applicant]
US 20190277642A1 · Schmelzer et al. · 2019 [cited by applicant]
US 20190301891A1 · Rowitch · 2019 [cited by applicant]
US 20190318309A1 · Vaideeswaran et al. · 2019 [cited by applicant]
US 20190318443A1 · Goldman-Shenhar · 2019 [cited by applicant]
US 20190318818A1 · Chaudhuri et al. · 2019 [cited by applicant]
US 20190327579A1 · Rankin et al. · 2019 [cited by applicant]
US 20190339087A1 · Jindal et al. · 2019 [cited by applicant]
US 20190340928A1 · Goldman et al. · 2019 [cited by applicant]
US 20190370924A1 · Kassner et al. · 2019 [cited by applicant]
US 20190371472A1 · Blanchard et al. · 2019 [cited by applicant]
US 20190375301A1 · Whitt et al. · 2019 [cited by applicant]
US 20190383623A1 · Aich et al. · 2019 [cited by applicant]
US 20200041291A1 · Dunnette · 2020 [cited by examiner]
US 20200051192A1 · Didier et al. · 2020 [cited by applicant]
US 20200104761A1 · Aich et al. · 2020 [cited by applicant]
US 20200104962A1 · Aich et al. · 2020 [cited by applicant]
US 20200109956A1 · Nakamura et al. · 2020 [cited by applicant]
US 20200117204A1 · Lindemann et al. · 2020 [cited by applicant]
US 20200134765A1 · Majima et al. · 2020 [cited by applicant]
US 20200191587A1 · Fuchs · 2020 [cited by applicant]
US 20200300645A1 · Schirano · 2020 [cited by applicant]
US 20200378771A1 · Beaurepaire · 2020 [cited by examiner]
US 20200410375A1 · Seagraves · 2020 [cited by examiner]
US 20210065114A1 · Thompson et al. · 2021 [cited by applicant]
CN 107240168A · 2017 [cited by examiner]
CN 107289958A · 2017 [cited by examiner]
CN 108898241A · 2018 [cited by examiner]
CN 110648267A · 2020 [cited by examiner]
WO WO2015140954A1 · 2015 [cited by examiner]
WO 2018219337A1 · 2018 [cited by applicant]
U.S. Appl. No. 18/355,844, filed Feb. 15, 2024, Office Action. [cited by applicant]
U.S. Appl. No. 18/355,844, filed Apr. 8, 2024, Notice of Allowance. [cited by applicant]
Search Report and Rule 62 EPC as received in European application 20875579.3 dated Oct. 10, 2023. [cited by applicant]
Wagner et al.; Public Transit Routing with Unrestricted Walking; 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017); http://i11www.iti.kit.edu/PublicTransitData/… [cited by applicant]
Pajor, Thomas; Algorithm Engineering for Realistic Journey Planning in Transportation Networks; Nov. 15, 2013 (278 pages). [cited by applicant]
Delling et al.; Customizable Route Planning; Microsoft Research Silicon Valley, Karlsruhe Institute of Technology; retrieved Feb. 17, 2020; (12 pages). [cited by applicant]
Delling et al.; Computing Multimodal Journeys in Practice; Microsoft Research Silicon Valley; Karlsruhe Institute of Technology; retrieved Feb. 17, 2020; (12 pages). [cited by applicant]
Delling et al.; Computing and Evaluating Multimodal Journeys; Microsoft Research Silicon Valley; Karlsruhe Institute of Technology; retrieved Feb. 17, 2020; (17 pages). [cited by applicant]
Baum et ak,; UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution ; Karlsruhe Institute of Technology; Jul. 4, 2019 (18 pages). [cited by applicant]
Hoek et al.; osrm-backend/profiles/bicycle.lua; https://github.com/Project-OSRM/osrm-backend/blob/master/profiles/bicycle.lua; Dec. 1, 2019; retrieved Feb. 17, 2020; (15 pages). [cited by applicant]
Nguyen, Huyen Chau; Engineering Multimodal Transit Route Planning; Karlsruhe institute of Technology; Department of Informatics Institute of Theoretical Computer Science; Oct. 31, 2017; (64 pages). [cited by applicant]
Kirchler, Dominik; Efficient routing on multi-modal transportation networks; Ecole Polytechnique X; Oct. 28, 2013; (148 pages). [cited by applicant]
Dibbelt, Julian Matthias; Engineering Algorithms for Route Planning in Multimodal Transportation Networks; Karlsruhe Institute of Technology; Feb. 3, 2016 (225 pages). [cited by applicant]
Dellling et al.; Round-Based Public Transit Routing; Microsoft Research Silicon Valley; Karlsruhe Institute of Technology; Feb. 2016; retrieved Feb. 17, 2020; (11 pages). [cited by applicant]
Delling et al.; Fast and Exact Public Transit Routing with Restricted Pareto Sets; 2019; (12 pages). [cited by applicant]
Examination Report as received in Australian application 2020361447 dated Apr. 22, 2022. [cited by applicant]
Office Action as received in European application 20875579.3 dated May 13, 2022. [cited by applicant]
Office Action as received in Mexican application MX/a/2022/004182 dated Jun. 13, 2022 [no English translation available]. [cited by applicant]
International Search Report and Written Opinion for App. No. PCT/US20/46673 dated Nov. 9, 2020 (8 pages). [cited by applicant]
NPL, Lee, Misuk et al., An Analysis of Destination Choice for Opaque Airline Products Using Multi-dimensional Binary Logit Models, Transportation Research, Part A, 46 (2012) (http://dx.doi.orgil 0.1016/j.tra.2012.08.009. [cited by applicant]
U.S. Appl. No. 16/595,394, filed Dec. 19, 2019, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,394, filed Jun. 9, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,394, filed Oct. 15, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,394, filed Sep. 17, 2021, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 17/648,148, filed Dec. 20, 2022, Ex Parte Quayle Action. [cited by applicant]
U.S. Appl. No. 17/648,148, filed Mar. 1, 2023, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 16/595,429, filed Jan. 8, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,429, filed Jun. 5, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,429, filed Oct. 8, 2020, Notice of Allowance [cited by applicant]
U.S. Appl. No. 16/595,399, filed Jan. 6, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Jun. 18, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Dec. 16, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Jun. 9, 2021, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Nov. 23, 2021, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Mar. 24, 2022, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Oct. 5, 2022, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,399, filed Mar. 1, 2023, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 16/595,387, filed Jan. 9, 2020, Office Action. [cited by applicant]
U.S. Appl. No. 16/595,387, filed Jun. 11, 2020, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 16/993,532, filed Dec. 8, 2021, Office Action. [cited by applicant]
U.S. Appl. No. 16/993,532, filed Apr. 15, 2022, Notice of Allowance. [cited by applicant]
U.S. Appl. No. 17/816,201, filed Nov. 25, 2022, Office Action. [cited by applicant]
U.S. Appl. No. 17/816,201, filed Feb. 22, 2023, Notice of Allowance. [cited by applicant]