An efficient harris hawk optimization algorithm for solving the travelling salesman problem
| Autor: | Benyamin Abdollahzadeh, Farhad Soleimanian Gharehchopogh |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
Optimization algorithm Computer Networks and Communications Computer science business.industry Harris' hawk 020206 networking & telecommunications 02 engineering and technology Travelling salesman problem Local optimum Encoding (memory) Mutation (genetic algorithm) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Local search (optimization) business Software Problem space |
| Zdroj: | Cluster Computing. 25:1981-2005 |
| ISSN: | 1573-7543 1386-7857 |
| DOI: | 10.1007/s10586-021-03304-5 |
| Popis: | 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 employed to escape the local optima trap. Besides, 80 datasets were evaluated in TSPLIB to demonstrate the performance and efficiency of the proposed algorithm. The results showed the excellent performance of the proposed algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink