US 12,332,958 B2
Determining feasible itinerary solutions
Naomi Liora Miller, New York City, NY (US); Harold Roy Miller, Toronto (CA); and Warren Stableford, Burlington (CA)
Assigned to AMGINE TECHNOLOGIES (US), INC., Dover, DE (US)
Filed by Amgine Technologies (US), Inc., Dover, DE (US)
Filed on Jul. 8, 2024, as Appl. No. 18/766,213.
Application 18/766,213 is a continuation of application No. 18/321,327, filed on May 22, 2023, granted, now 12,067,066.
Application 18/321,327 is a continuation of application No. 17/502,625, filed on Oct. 15, 2021, granted, now 11,698,941.
Application 17/502,625 is a continuation of application No. 16/275,133, filed on Feb. 13, 2019, granted, now 11,222,088, issued on Jan. 11, 2022.
Application 16/275,133 is a continuation of application No. 15/595,795, filed on May 15, 2017, granted, now 10,210,270, issued on Feb. 19, 2019.
Application 15/595,795 is a continuation of application No. 15/069,791, filed on Mar. 14, 2016, granted, now 9,659,099, issued on May 23, 2017.
Application 15/069,791 is a continuation in part of application No. 13/419,989, filed on Mar. 14, 2012, granted, now 9,286,629, issued on Mar. 15, 2016.
Claims priority of provisional application 61/452,633, filed on Mar. 14, 2011.
Prior Publication US 2024/0362283 A1, Oct. 31, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/00 (2019.01); G06F 16/242 (2019.01); G06F 16/9535 (2019.01); G06F 40/30 (2020.01); G06Q 10/02 (2012.01)
CPC G06F 16/9535 (2019.01) [G06F 16/243 (2019.01); G06F 40/30 (2020.01); G06Q 10/02 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system for fulfilling itinerary requests, the system comprising:
a processor configured to:
receive an itinerary request associated with one or more passengers;
create an itinerary object associated with the itinerary request, the itinerary object comprising at least one of: the itinerary request, an itinerary network, a list of passengers, and a conversation message; and
return at least one itinerary solution selected from feasible itinerary solutions based on a ranking of the feasible solutions;
a parser in communication with the processor and operable to:
generate the itinerary network associated with the itinerary object, the itinerary network comprising two or more nodes and dependencies between the two or more nodes; and
a scheduler in communication with the processor and operable to:
receive a topology of nodes obtained from a pre-schedule algorithm applied to the itinerary object;
receive a plurality of tuples obtained from a resource independent schedule algorithm applied to the nodes of the topology of nodes;
perform a content search on an ordered list of the plurality of tuples for each of the one or more passengers;
generate one or more feasible itinerary solutions based on the content search; and
generate the ranking of the feasible itinerary solutions based on preferences associated with the one or more passengers.