A Genetic Algorithm for Routing with an Upper Bound Constraint
Jun Inagaki · IEICE Transactions on Information and Systems · 2005
This paper presents a method of searching for the shortest route via the most designated points with the length not exceeding the preset upper bound. The proposed algorithm can obtain the quasi-optimum route efficiently and its effectiveness is verified by applying the algorithm to the actual map data.