集団の再利用に基づくGAによるカーナビゲーションのための動的経路探索

抄録

When using car navigation systems, it is important for users to be able to find alternative routes in real time when traffic conditions change as well as optimal routes before starting a journey. In this paper, we propose a new method for determining the easiest to-drive and quasi-shortest route within a given amount of time using a genetic algorithm. Genetic algorithms always have solutions in a population to provide alternative routes using other solutions. Parts of arterial roads are regarded as viruses, and we generated a population of viruses in addition to a population of routes. Experimental results show that the proposed method results in a faster search time than the Dijkstra algorithm.