To achieve an optimal solution to the traveling sales problem, School of Automation (TSP), an improved wolf pack algorithm (IWPA) that addresses this problem through migration, summoning, and besiegement behavior is proposed. This proposal is based on a basic WPA concept. In this algorithm, it retains the division-work cooperative search characteristics of WPA, adds negative feedback to the algorithm, and sets adaptive parameters, which solves the disadvantages of slow convergence speed and low-dimensional search efficiency of WPA. Finally, the path planning simulation of the IWPA was performed and the proposed approach was compared with ant colony optimization and particle swarm optimization. The simulation results indicate that IWPA has specific advantages over similar algorithms regarding feasibility, convergence, and stability.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org