Patent ID: 11898858
Assignee: AMADEUS S.A.S.
Field: Measurement (Instruments)
Classification: CPC G  H | IPC G

Claim 0:
1. A system for:
(i) determining a set of routes (Sj), in a computerized environment and in response to a user request received from a client device, using a graph comprising a plurality of nodes and a plurality of links connecting the nodes, the set of routes being determined for at least two tokens (TK), each token being associated with an origin node and a destination node included in the graph and with a token weight, and
(ii) determining a set of solutions, each solution of the set of solutions comprising a unique combination of the candidate routes for the at least two tokens (TK), . . .
wherein the system includes at least one processor and a memory containing instructions that, when executed by the at least one processor, cause the at least one processor to perform operations comprising:
receiving a set of token constraints for each token (TK), the token constraints received for each token comprising at least one constraint related to the token weight;
determining, for each token (TK), a set of candidate routes satisfying at least one of the token constraints received for the token, each candidate route being connected to the origin node and the destination node associated with the token, the candidate route comprising at least one route link included in the graph, the route link being associated with a link weight;

determining shared route links, each shared route link being a route link comprised in a route in the sets of candidate routes determined for the at least two tokens;
filtering the set of candidate routes determined for the at least two tokens (TK) based on a condition related to the weight of each shared route link in a route of the sets of candidate routes and to the weights of the tokens sharing the link;
determining a set of items (ITi), each item (ITi) comprising one or more tokens of the at least two tokens (TK) and a node or a link which is comprised in a candidate route determined for the at least two tokens (TK);
computing, for each item (ITi), an item value, the item value representing a time needed for a token to browse the node or link comprised in the item (ITi), multiplied by the number of tokens (TK) comprised in the item (ITi);
determining, for each solution of the set of solutions, a solution value by adding the item values of all the items (ITi) of each respective solution;
selecting an optimal solution of the set of solutions having the optimal solution value, which provides a set of routes (Si); and
providing the selected optimal solution to a user interface at the client device.