期刊文献+

Hybrid Optimization Algorithm Based on Wolf Pack Search and Local Search for Solving Traveling Salesman Problem 被引量:10

Hybrid Optimization Algorithm Based on Wolf Pack Search and Local Search for Solving Traveling Salesman Problem
原文传递
导出
摘要 Traveling salesman problem(TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence(SI) based algorithms for TSP cannot coordinate with the exploration and exploitation abilities and are easily trapped into local optimum. In order to deal with this situation, a new hybrid optimization algorithm based on wolf pack search and local search(WPS-LS)is proposed for TSP. The new method firstly simulates the predatory process of wolf pack from the broad field to a specific place so that it allows for a search through all possible solution spaces and prevents wolf individuals from getting trapped into local optimum. Then, local search operation is used in the algorithm to improve the speed of solving and the accuracy of solution. The test of benchmarks selected from TSPLIB shows that the results obtained by this algorithm are better and closer to the theoretical optimal values with better robustness than those obtained by other methods. Traveling salesman problem(TSP) is one of the typical NP-hard problems, and it has been used in many engineering applications. However, the previous swarm intelligence(SI) based algorithms for TSP cannot coordinate with the exploration and exploitation abilities and are easily trapped into local optimum. In order to deal with this situation, a new hybrid optimization algorithm based on wolf pack search and local search(WPS-LS)is proposed for TSP. The new method firstly simulates the predatory process of wolf pack from the broad field to a specific place so that it allows for a search through all possible solution spaces and prevents wolf individuals from getting trapped into local optimum. Then, local search operation is used in the algorithm to improve the speed of solving and the accuracy of solution. The test of benchmarks selected from TSPLIB shows that the results obtained by this algorithm are better and closer to the theoretical optimal values with better robustness than those obtained by other methods.
作者 董如意 王生生 王光耀 王新颖 DONG Ruyi;WANG Shengsheng;WANG Guangyao;WANG Xinying
出处 《Journal of Shanghai Jiaotong university(Science)》 EI 2019年第1期41-47,共7页 上海交通大学学报(英文版)
基金 the National Natural Science Foundation of China(No.61502198) the Science&Technology Development Project of Jilin Province(Nos.20180101334JC and 20190302117GX) the"3th-Five Year" Science and Technology Research Project of Education Department of Jilin Province(No.JJKH20170574KJ)
关键词 TRAVELING SALESMAN problem(TSP) SWARM intelligence(SI) WOLF PACK search(WPS) combinatorial optimization traveling salesman problem(TSP) swarm intelligence(SI) wolf pack search(WPS) combinatorial optimization
  • 相关文献

参考文献1

二级参考文献4

共引文献182

同被引文献93

引证文献10

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部