|
|||||
|
|
An efficient harris hawk optimization algorithm for solving the travelling salesman problem |
|
| Authors: | Gharehchopogh Farhad Soleimanian Abdollahzadeh Benyamin |
| Abstract: | Cluster Computing - 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... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |