查看文章

Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this paper presented a new method that uses random-key encoding to generate a tour. This method helps maintain the main capabilities of the HHO algorithm, on the one hand, and to take advantage of the capabilities of active mechanisms in the continuous-valued problem space on the other hand. For the exploration phase, the DE/best/2 mutation mechanism employed in the exploitation phase, besides the main strategies in the HHO algorithm, was used. Ten neighborhood search operators are used, four of which are introduced. These operators were intelligently selected using the MCF. The Lin-Kernighan local search mechanism was utilized to improve the proposed algorithm's performance, and the Metropolis acceptance strategy was …