A GA-based systematic reasoning approach for solving traveling salesman problems using an orthogonal array crossover

摘要

This paper proposes a novel genetic algorithm-based systematic reasoning approach using an orthogonal array crossover (OAX) for solving the traveling salesman problem (TSP). OAx makes use of the systematic reasoning ability of orthogonal arrays that can effectively preserve superior sub-paths from parents and guide the solution towards better quality OAx combines the advantages of two traditional approaches: canonical approach and heuristic approach. It is shown empirically that OAx outperforms various superior crossovers in both accuracy and speed. An improved OAx with a well-know heuristic method is also presented.