CPC G06F 16/9535 (2019.01) [G06F 16/243 (2019.01); G06F 40/30 (2020.01); G06Q 10/02 (2013.01)] | 20 Claims |
1. A system for analyzing an itinerary object based on a ranking of feasible itinerary solutions, the system comprising:
a processor in communication with a parser and a scheduler and operable to:
receive an itinerary object associated with an itinerary request, the itinerary request being associated with one or more passengers, the itinerary object comprising at least one of: the itinerary request, a passenger list, or a conversation; and
return an analysis of one or more itinerary solutions associated with the itinerary object based on the ranking of the feasible itinerary solutions;
the parser in communication with the processor and operable to:
generate an itinerary network associated with the itinerary object, the itinerary network comprising two or more nodes and dependencies between the two or more nodes;
the scheduler in communication with the processor and operable to:
apply a resource-independent scheduling algorithm to the itinerary network to create a plurality of tuples;
perform a content search on the plurality of tuples for each of the one or more passengers;
generate the one or more itinerary solutions based on the content searches;
analyze one or more combinations of the itinerary solutions to determine feasible itinerary solutions; and
generate the ranking of the feasible itinerary solutions based on preferences associated with the one or more passengers.
|