A new wolf colony search algorithm based on search strategy for solving travelling salesman problem
by Yang Sun; Lin Teng; Shoulin Yin; Hang Li
International Journal of Computational Science and Engineering (IJCSE), Vol. 18, No. 1, 2019

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.

Online publication date: Fri, 14-Dec-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com