Abstract: The present invention relates to a system and method for itinerary planning. The method commences with the population of a first queue with a first set of network segments connected to the origin. One of the network segments is removed from the first queue. An expansion build representing the one network segment removed from the input queue is placed together with a continuing network segment in a second queue if the continuing network segment has not been considered. A captured build representing the network segment removed from the input queue together with the continuing network segment in the first queue if the continuing network segment has been considered. The placing is repeated until the first queue is empty. The first queue is replaced with the builds in the second queue. The removing to the replacing is repeated until the first and second queues are empty. At least one of the builds having a lowest cost is outputted.

Abstract: The present invention relates to a method and system for itinerary planning. The method commences with the receipt of an itinerary-planning request specifying an origin and a destination. A build of network segments extending from the origin is generated. A continuing network segment extending from the build is identified. The continuing network segment is discarded if the continuing network segment is marked as a local network segment and is distant from the origin and from the destination. The continuing network segment is evaluated if the network segment is proximate to one of the origin and the destination. At least one suitable itinerary is determined for the itinerary-planning request. The at least one suitable itinerary is outputted.