A new Wolf colony search algorithm based on search strategy for solving travelling salesman problem

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Though many intelligence algorithms are used for travelling salesman problem (TSP), the main objective of this paper is to execute new approach to obtain significant improvements. This paper proposes an improved Wolf colony search algorithm based on search strategy. First, we introduce interaction strategy into travel behaviour and calling behaviour to promote the communication between artificial wolves, which can improve the information acquirement for wolves and enhance the exploring ability of wolves. Second, we present adaptive siege strategy for siege behaviour, which guarantees that the new algorithm can obtain better collaborative search feature. Therefore, the range of Wolf siege constantly decreases and the mining ability of Wolf algorithm increases with the new strategy. Finally, experiments are carried out to verify the effectiveness of new method compared with other algorithms for TSP problems. The results show that the improved Wolf colony search algorithm has higher solving accuracy, faster convergence speed.

Cite

CITATION STYLE

APA

Sun, Y., Teng, L., Yin, S., & Li, H. (2019). A new Wolf colony search algorithm based on search strategy for solving travelling salesman problem. International Journal of Computational Science and Engineering, 18(1), 1–11. https://doi.org/10.1504/IJCSE.2019.096970

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free