| 摘要 |
PROBLEM TO BE SOLVED: To enable a driver to search an optimum path capable of coping with the change of restriction condition like congestion of a road, by repeating selection, exchange, and substitution processes to a plurality of paths passing a plurality of intersections, and updating the quasi-optimum path. SOLUTION: Out of a plurality of stored 1 initial paths (paths formed by passing a plurality of intersections from a present position to a destination), a path whose objective function value is approximate to the optimum value is selected 2 and stored 3. The objective function value turns the aptitude to a searching object into numeric values. Paths passing a common intersection are detected 4 out of selection paths, partial paths from the common intersection to the destination are mutually exchanged 5, and a specific number of new paths are formed and stored 1. Out of the paths, a path passing two of the intersections on both ends of a partial path for substitution which is formed by four arbitrary continuous intersections is detected 7. The part between the two intersections is substituted 8 by the partial path for substitution. In the paths after processing, a quasi-optimum path which is most approximate to the optimum value is stored 9. |
