Imperial competitive algorithm with policy learning for the traveling salesman problem

Abstract

The traveling salesman problem (TSP) is one of the most studied combinatorial optimization problems. In this paper, we present the new idea of combining the imperial competitive algorithm with a policy-learning function for solving the TSP problems. All offspring of each country are defined as representing feasible solutions for the TSP. All countries can grow increasingly strong by learning the effective policies of strong countries. Weak countries will generate increasingly excellent offspring by learning the policies of strong countries while retaining the characteristics of their own country. Imitating these policies will enable the weak countries to produce improved offspring; the solutions generated will, therefore, acquire a favorable scheme while maintaining diversity. Finally, experimental results for TSP instances from the TSP library have shown that our proposed algorithm can determine the salesman's tour with more effective performance levels than other known methods.