A new genetic algorithm for the asymmetric traveling salesman problem

► This paper presents a genetic algorithm for solving the asymmetric traveling salesman problem. ► Experimental results demonstrate that the proposed GA outperforms state-of-the-art heuristic algorithms. ► Effective crossover operator for the ATSP is designed. ► We provide useful insights for designing effective GAs. ► We create a new set of benchmarks for the ATSP.