Method and system of building actual travel fares

摘要

A method of building actual travel fares in a computer, from fare databases, is disclosed. A graph of nodes representing travel destinations is built which comprises edges connecting pairs of nodes. Each edge references a lowest travel fare. Also, a tree of fares is built for each graph edge. Trees comprise at least a root node holding the lowest travel fare of the corresponding graph edge. They possibly include more nodes comprising a context key and an associated travel fare. Trees are organized to have children nodes holding a travel fare equal to or larger than travel fare of a parent node. Thus, less expensive fare paths can efficiently be extracted since graph edges, included in the fare paths, reference the associated trees of fares and are gone through in ascending order of their lowest fare values. A learning entity is used to build and update the trees of fares. It gathers its data from processes aimed at building travel solutions for the end-users. A system implementing the method of extracting fare paths according to the invention is made capable of handling many destinations in the elapsed time of a computer transaction thus, can propose thematic travel options to end-users who are not required to choose a particular destination to start planning a trip.