A genetic algorithm for determining multiple routes and its applications
Junko Inagaki, M. Haseyama, Hiroki KITAJIMA · 2003
This paper presents a genetic algorithm approach for routing applications. The genetic algorithm produces many possible solutions in its search process. By utilizing this feature, our method determines both the shortest route and multiple semi-shortest routes in one search. Existing methods, such as Dijkstra's algorithm, search only for the shortest route, and cannot determine any other short routes. Therefore the proposed algorithm is useful for this kind of routing. Furthermore, the method can determine the routes which are short and not similar depending on geographical conditions since the genotype structure of our method has a weighting factor which controls route length.