초록 ▼

A method is provided for using a computer to select a travel route based on a selected performance criteria from a plurality of possible travel routes connecting a plurality of destinations. Information is input describing the location of each destination to be visited. For each pair of destinations

A method is provided for using a computer to select a travel route based on a selected performance criteria from a plurality of possible travel routes connecting a plurality of destinations. Information is input describing the location of each destination to be visited. For each pair of destinations, a connecting path having an optimum performance value based on the selected performance criteria is determined. An array of randomly ordered sequences is created with each sequence representing a unique ordering of the destinations to be visited. For each sequence, the optimum performance values for each connecting path of each pair of destinations are summed to obtain a total performance value for the routes described by the sequence. A genetic cellular automaton is iteratively applied to the array to determine the travel route having the selected performance criteria by computing a near optimum sequence of destinations.

대표청구항 ▼

A route scheduling computer comprising: a memory including a roadmap database, said roadmap database defining a plurality of road segments connecting a plurality of possible destinations; circuitry for inputting information describing selected ones of said plurality of said possible destinations to

A route scheduling computer comprising: a memory including a roadmap database, said roadmap database defining a plurality of road segments connecting a plurality of possible destinations; circuitry for inputting information describing selected ones of said plurality of said possible destinations to be visited; and a processor for selecting a travel route having a shortest route travel time connecting said destinations to be visited, said processor operable to: select a combination of said road segments forming a path connecting said destinations for each of said destinations to be visited, said path having shortest path travel time between a pair of said destinations; create an array of randomly ordered sequences, each of said sequences corresponding to a unique order of said destinations to be visited; sum in order of said shortest path travel time for said sequences and to determine a route travel time associated with each of said sequences; and select an order of said destinations to be visited representing said travel route having said shortest route travel time by a genetic cellular operator to said sequences in said array, said generic cellular operator using said determined route travel time as a fitness function.