A GA-based routing method with an upper bound constraint

This paper presents a method of searching for the shortest route via the most designated points among the routes whose lengths are less than the upper bound and its effectiveness is 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.