System and method for itinerary planning

Abstract

The present invention relates to a system and method for itinerary planning. The method commences with processing of network segments stored in a database to generate builds in response to receiving an itinerary planning request. At least one of the builds having a cost that is lowest is selected. The cost is determined as a function of at least two factors. The at least one build is outputted.

Description

FIELD OF THE INVENTION[0001]The present invention relates to the field of transportation. In particular, it relates to a system and method for itinerary planningBACKGROUND OF THE INVENTION[0002]Itinerary planning is generally known. Given a travel network, and a set of parameters that form an itinerary planning request, an itinerary is generated that best satisfies the parameters. The travel network typically is a street network or a public transportation network, but, in some cases, can incorporate two or more travel means to enable a comprehensive solution to be provided. The travel network consists of a set of paths, or network segments, that are terminated at both ends by nodes. For example, both metropolitan trains and transit buses travel along fixed routes that have scheduled stops therealong. Nodes can be used to represent the stops and network segments model the travel of the trains and buses between the stops. Nodes are often defined to denote points where interchange betw...

AI Technical Summary

Benefits of technology

[0023]a processor executing computer-executable instructions for processing said network segments to generate builds in response to receiving an itinerary planning request, selecting at least one of said build having a cost that is lowest, said cost being determined as a function of at least two factors, and outputting said at least one build having a lowest cost.

[0026]The processor executing the computer-executable instructions can modify the function of the factors, and repeat the processing and the selecting. The processor executing the computer-executable instructions can adjust parameters in the function. In addition, the processor executing the computer-executable instructions can merge the at least one build selected before the repeating with the at least one build selected during the repeating.

Problems solved by technology

It can be undesirable to plan arrival at an intersection of a first bus route being traveled, for example, to change to a second bus route when the last bus for the day will have already departed from that location.

This ordering of partial solutions can, however, be processor-intensive.

While Dijkstra's Algorithm and other such approaches provide a reasonably efficient solution in some scenarios, it may not provide desirable solutions in many cases.

Images