A novel evolutionary algorithm with indirect representation and extended nearest neighbor constructive procedure for solving routing problems

This paper presents a novel evolutionary algorithm for solving routing and sequencing problems. It builds directly on the observation that the optimal solution is composed mostly of short and low-cost links. It uses an indirect representation and an extended nearest neighbor constructive procedure. The representation scheme is redundant making it possible to have multiple attractors in the search space representing the same optimal solution. The order-based crossover is used that allows for combining partial solutions contained in parental individuals. Further, an adaptive iterated scheme is used to allow for escaping from a region of attraction of a local optimum. Proof-of-concept experiments have been carried out on the classical TSP with data sets ranging from 100 to 2392 nodes. The proposed algorithm was compared with two other relevant EAs. The achieved results clearly show the proposed method is competitive to and better than the compared EAs.