US 11,676,233 B2
Method of generating a set of itineraries by limited querying of databases
Alienor Didier, Juan les pins (FR); Serena Rocconi, Golfe Juan (FR); Camille Garello, Antibes (FR); Florian Briy, Antibes (FR); and Lionel Perez, Juan les Pins (FR)
Assigned to AMADEUS S.A S., Biot (FR)
Filed by AMADEUS S.A.S., Biot (FR)
Filed on Aug. 2, 2019, as Appl. No. 16/530,352.
Claims priority of application No. FR1857412 (FR), filed on Aug. 9, 2018.
Prior Publication US 2020/0051192 A1, Feb. 13, 2020
Int. Cl. G06F 16/29 (2019.01); G01C 21/34 (2006.01); G06Q 10/06 (2012.01); G06Q 50/30 (2012.01); G06Q 10/04 (2012.01); G06Q 50/26 (2012.01); G06F 16/9537 (2019.01); G06Q 10/0631 (2023.01); G06Q 10/047 (2023.01)
CPC G06Q 50/26 (2013.01) [G01C 21/343 (2013.01); G06F 16/29 (2019.01); G06F 16/9537 (2019.01); G06Q 10/047 (2013.01); G06Q 10/06316 (2013.01); G06Q 50/30 (2013.01)] 19 Claims
OG exemplary drawing
 
1. A method of handling a request at a computing system from a client computing device, the method comprising:
(A) at the computing system, via execution of a graph generating process prior to receipt of the request:
gathering data from a plurality of content provider platforms;
generating a plurality of transport-service graphs based on the gathered data, wherein each transport-service graph comprises a plurality of nodes and internal edges connecting the nodes; wherein the nodes represent stops in a corresponding public-transportation network and the internal edges represent connections between the stops;
generating a connection graph containing the plurality of transport-service graphs and including connection edges between nodes from distinct ones of the transport-service graphs;
generating a metagraph containing (i) a plurality of metagraph nodes each representing a respective one of the transport-service graphs, and (ii) metagraph edges connecting the metagraph nodes and corresponding to the connection edges;
storing the connection graph and the metagraph in a storage device;
(B) at the computing system, receiving the request from the client computing device, the request containing an origin, a destination, and at least one of a departure time and an arrival time;
(C) at the computing system, via execution of a route selecting process:
retrieving the metagraph from the storage device, and selecting a metaroute including a subset of the metagraph nodes, based on the origin and the destination;
retrieving a portion of the connection graph from the storage device corresponding to the selected metaroute, excluding a remainder of the connection graph, and selecting an origin node and a destination node in the retrieved portion of the connection graph according to the origin and destination, respectively; and
selecting one or more routes between the origin node and the destination node comprising joining for a route a number of successive segments, a segment being a transportation connection between two nodes of a single transport-service graph by one or more internal edges;
(D) at the computing system, via execution of an offer building process:
sending at least one query asking a price and availability of a segment of the routes selected by the route selecting process to a respective content provider platform;
aggregating responses from the queried content provider platforms in order to build an itinerary for each route selected, thereby building a set of itineraries;
generating an offer comprising the set of itineraries; and
sending the offer to the client computing device.