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

Solving TSP problem based on the hunter-prey optimizer algorithm

旅行商问题是经典的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.