基于猎人猎物优化算法求解TSP问题  

Solving TSP problem based on the hunter-prey optimizer algorithm

作　　者：王芬[1] 杨媛 WANG fen;YANG yuan(School of Mathematics and Computer Science,Ningxia Normal University,Guyuan Ningxia 756099)

机构地区：[1]宁夏师范学院数学与计算机科学学院,宁夏固原756099

出　　处：《宁夏师范学院学报》2022年第7期59-63,71,共6页Journal of Ningxia Normal University

基　　金：宁夏自然科学基金项目(2022AAC03328,2022AAC03315).

摘　　要：旅行商问题是经典的NP难问题,为解决旅行商问题,提出用猎人猎物优化算法解决旅行商问题.该算法通过模拟动物猎食的过程对旅行商问题进行寻优,并用MATLAB进行验证分析.结果表明,该算法具有收敛速度快,寻优能力强的特点,对求解旅行商问题得到较好的优化结果.The traveling salesman problem is a classical NP hard problem.The hunter-prey optimizer algorithm is proposed to solve the traveling salesman problem.The algorithm optimizes the traveling salesman problem by simulating the process of animal hunting,and verifies and analyzes it with MATLAB.The results show that the algorithm has the characteristics of fast convergence and strong optimization ability,and obtains better optimization results for solving the traveling salesman problem.

关 键 词：猎人猎物优化算法 TSP问题 NP难问题 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]