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

被引:0
作者
Sun, Yang [1 ]
Teng, Lin [1 ]
Yin, Shoulin [1 ]
Li, Hang [1 ]
机构
[1] Shenyang Normal Univ, Software Coll, 253 HuangHe Bei St, Shenyang 110034, Liaoning, Peoples R China
关键词
wolf colony search algorithm; WA; search strategy; interaction strategy; adaptive siege strategy; siege behaviour; travelling salesman problem; TSP; ARTIFICIAL BEE COLONY; CUCKOO SEARCH; OPTIMIZATION; COVERAGE;
D O I
10.1504/IJCSE.2019.096970
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 35 条
[1]   Multiple colony bees algorithm for continuous spaces [J].
Akpinar, Sener ;
Baykasoglu, Adil .
APPLIED SOFT COMPUTING, 2014, 24 :829-841
[2]   Sensor Scheduling for Multi-Modal Confident Information Coverage in Sensor Networks [J].
Deng, Xianjun ;
Wang, Bang ;
Liu, Wenyu ;
Yang, Laurence T. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (03) :902-913
[3]   Barrier coverage in wireless sensor networks with adjustable sensing ranges [J].
Deng, Xianjun ;
Wang, Bang ;
Wang, Changqing ;
Liu, Wenyu .
INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2014, 15 (1-3) :121-132
[4]   Maximising area-constrained partial fault tolerance in reconfigurable logic using selection criteria [J].
Foster, David L. ;
Hanna, Darrin M. .
INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2013, 5 (1-2) :81-94
[5]  
Gendreau M., 2015, OPER RES, V40, P1086
[6]   On the Dubins Traveling Salesman Problem [J].
Jerome Le Ny ;
Feron, Eric ;
Frazzoli, Emilio .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2012, 57 (01) :265-270
[7]   Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions [J].
Kang, Fei ;
Li, Junjie ;
Ma, Zhenyue .
INFORMATION SCIENCES, 2011, 181 (16) :3508-3531
[8]   A quick artificial bee colony (qABC) algorithm and its performance on optimization problems [J].
Karaboga, Dervis ;
Gorkemli, Beyza .
APPLIED SOFT COMPUTING, 2014, 23 :227-238
[9]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[10]  
Lam YM, 2013, INT J COMPUT SCI ENG, V8, P281