System and method for itinerary planning
First Claim
Patent Images
1. A method for itinerary planning, comprising:
- populating by a computer processor a first queue stored on a non-transitory computer readable medium with a first set of network segments connected to an origin;
removing by the computer processor one of said network segments from said first queue;
placing by the computer processor an expansion build representing said one network segment together with a continuing network segment in a second queue stored on a non-transitory computer readable medium if said continuing network segment has not been considered and a noted cost for arriving at the end of the continuing network segment, via expansion build, is the best found thus far, noting by the computer processor a total cost of arriving at a destination for the expansion build if the expansion build arrives at the destination;
placing by the computer processor a captured build representing said one network segment together with said continuing network segment in said first queue if said continuing network segment has been considered and a noted cost for arriving at the end of the continuing network segment, via the captured build, is the best found thus far;
repeating said placing until said first queue is empty;
replacing by the computer processor said first queue with said expansion builds in said second queue;
repeating said removing to said replacing steps until said first and second queues are empty; and
outputting by the computer processor at least one of said builds having a lowest costwherein said lowest cost is determined by the computer processor based on a total cost (C) function;
2 Assignments
0 Petitions
Accused Products
Abstract
A method for itinerary planning includes the steps of populating a first queue with a first set of network segments connected to an origin, removing one of the network segments from the first queue, placing an expansion build representing the one network segment together with a continuing network segment in a second queue if the continuing network segment has not been considered, noting a cost for the expansion build if it arrives at a destination, and placing a captured build representing the one network segment together with the continuing network segment in the first queue if the continuing network segment has been considered.
-
Citations
19 Claims
-
1. A method for itinerary planning, comprising:
-
populating by a computer processor a first queue stored on a non-transitory computer readable medium with a first set of network segments connected to an origin; removing by the computer processor one of said network segments from said first queue; placing by the computer processor an expansion build representing said one network segment together with a continuing network segment in a second queue stored on a non-transitory computer readable medium if said continuing network segment has not been considered and a noted cost for arriving at the end of the continuing network segment, via expansion build, is the best found thus far, noting by the computer processor a total cost of arriving at a destination for the expansion build if the expansion build arrives at the destination; placing by the computer processor a captured build representing said one network segment together with said continuing network segment in said first queue if said continuing network segment has been considered and a noted cost for arriving at the end of the continuing network segment, via the captured build, is the best found thus far; repeating said placing until said first queue is empty; replacing by the computer processor said first queue with said expansion builds in said second queue; repeating said removing to said replacing steps until said first and second queues are empty; and outputting by the computer processor at least one of said builds having a lowest cost wherein said lowest cost is determined by the computer processor based on a total cost (C) function; - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An itinerary planning system for itinerary planning, comprising:
-
a database of network segments stored on a non-transitory computer readable medium; a processor executing computer-executable instructions stored on the computer readable medium, the computer-executable instructions comprising;
analyzing said network segments and, receiving an itinerary planning request, populating a first queue with a first set of network segments connected to an origin, removing one of said network segments from said first queue, placing an expansion build representing said one network segment together with a continuing network segment in a second queue if said continuing network segment has not been considered and a noted cost for arriving at the end of the continuing network segment, via expansion build, is the best found thus far, and noting a total cost of arriving at a destination for the expansion build if the expansion build arrives at the destination, placing a captured build representing said one network segment together with said continuing network segment in said first queue if said continuing network segment has been considered and a noted cost for arriving at the end of the continuing network segment, via the captured build, is the best found thus far, repeating said placing until said first queue is empty, replacing said first queue with said expansion builds in said second queue, and repeating said removing to said replacing steps until said first and second queues are empty, and outputting at least one of said builds having a lowest cost;wherein said lowest cost is determined by the computer processor based on a total cost (C) function; - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A method for itinerary planning, comprising:
-
generating by a computer processor builds of network segments for a journey, said network segments being stored in a database on a non-transitory computer readable medium accessible by a computer system; placing by the computer processor said builds that whose last network segment has been previously considered in a first queue if a noted cost for arriving at an end of a last network segment in the builds is the best found thus far; placing said builds whose last network has been previously unconsidered in a second queue stored on a non-transitory computer readable medium if a noted cost for arriving at an end of a last network segment in the builds is the best found thus far, noting a total cost of arriving at the destination for said builds if said builds arrive at the destination; expanding said builds in said first queue before expanding said builds in said second queue; and outputting by the computer processor at least one of said builds arriving at a destination for said journey having a lowest cost; wherein said lowest cost is determined by the computer processor based on a total cost (C) function; - View Dependent Claims (16, 17, 18, 19)
-
Specification