A new fitness function of a genetic algorithm for routing applications
This paper presents a method of determining a fitness function in a genetic algorithm for routing the shortest route via several designated points. We can search for the optimum route efficiently by using the proposed fitness function and its validity is verified by applying it to the actual map data.
genetic algorithm routing designated points dijkstra's algorithm building block hypothesis