A new genetic algorithm for routing the shortest route via several designated points
Junko Inagaki, M. Haseyama, Hiroki KITAJIMA · 2002
This paper presents a method of routing the shortest route via several designated points using a genetic algorithm and its effectiveness verified by applying the algorithm to map data. The proposed algorithm uses a fitness function which includes weight parameters based on the building block hypothesis. By using this function, the optimum is efficiently obtained. This kind of routing is difficult in the case of using existing methods such as Dijkstra's method. Also, the proposed method is more useful.