[1] |
DORIGO M , GAMBARDELL L M . Ant colonies for the travelling salesman problem[J]. Bio Systems, 1997,43(2): 73-81.
|
[2] |
MAEKAWA K , TAMAKI H , KITA H ,et al. A method for the traveling salesman problem based on the genetic algorithm[J]. Transactions of the Society of Instrument & Control Engineers, 1995,31(5): 598-605.
|
[3] |
WANG J , ERSOY O K , HE M ,et al. Multi-offspring genetic algorithm and its application to the traveling salesman problem[J]. Applied Soft Computing, 2016,43(3): 415-423.
|
[4] |
MURRAY A T , CHURCH R L . Applying simulated annealing to location-planning models[J]. Journal of Heuristics, 1996,2(1): 31-53.
|
[5] |
YU D , JIA J . A neural network algorithm with optimized parameters and used to solve the TSP[J]. Acta Electronica Sinica, 1993,21(7): 16-22.
|
[6] |
LIN Y , BIAZ Z , LIU X . Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing – tabu search algorithm to solve the symmetrical traveling salesman problem[J]. Applied Soft Computing, 2016,49(9): 937-952.
|
[7] |
LIU Z , LI X , WANG H . Improvement of self-adaptive ant colony algorithm based on cloud model[J]. Computer Engineering and Applications, 2016,52(19): 68-71.
|
[8] |
PAN G , LI K , OUYANG A ,et al. Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP[J]. Soft Computing, 2016,20(2): 555-566.
|
[9] |
DORIGO M , MANIEZZO V , COLORNI A ,et al. Ant system:optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems Man and Cybernetics-Part B, 1996,26(1): 29-41.
|
[10] |
DORIGO M , GAMBARDELLA L M . Ant colony system:a cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997,1(1): 53-66.
|
[11] |
孟祥萍, 片兆宇, 沈中玉 ,等. 基于方向信息素协调的蚁群算法[J]. 控制与决策, 2013,28(5): 782-786.
|
|
MENG X P , PIAN Z Y , SHEN Z Y ,et al. Ant algorithm based on di-rection-coordinating[J]. Control and Decision, 2013(5): 782-786.
|
[12] |
吴华锋, 陈信强, 毛奇凰 ,等. 基于自然选择策略的蚁群算法求解TSP问题[J]. 通信学报, 2013,34(4): 165-170.
|
|
WU H F , CHEN X Q , MAO Q F ,et al. Improved ant colony algorithm based on natural selection strategy for solving TSP problem[J]. Journal on Communications, 2013(4): 165-170.
|
[13] |
林建兵, 陈智雄, 姚国祥 . 一种基于域密度的蚁群系统(AS)改进算法及结果解析[J]. 武汉大学学报(工学版), 2016,49(4): 627-634.
|
|
LIN J B , CHEN Z X , YAO G X . An improved AS algorithm and re-sult analyzing based on domain and its density[J]. Engineering Journal of Wuhan University, 2016,49(4): 627-634.
|
[14] |
马学森, 曹政, 韩江洪 ,等. 改进蚁群算法的无线传感器网络路由优化与路径恢复算法[J]. 电子测量与仪器学报, 2015,29(9): 1320-1327.
|
|
MA X S , CAO Z , HAN J H ,et al. Routing optimization and path re-covery algorithm in wireless sensor network based on improved ant colony algorithm[J]. Journal of Electronic Measurement and Instru-ment, 2015,29(9): 1320-1327.
|
[15] |
孙力娟, 王良俊, 王汝传 . 改进的蚁群算法及其在TSP中的应用研究[J]. 通信学报, 2004,25(10): 111-116.
|
|
SUN L J , WANG L J , WANG R C ,et al.Research of using an improved ant colony algorithm to solve TSP[J]. Journal on Communications, 2004,25(10): 111-116.
|
[16] |
BU Y , LI T Q , ZHANG Q . A weighted max-min ant colony algorithm for TSP instances[J]. IEICE Transactions on Fundamentals of Electronics Communications & Computer Sciences, 2015(3): 894-897.
|
[17] |
耿志强, 邱大洪, 韩永明 . 基于混沌的 MMAS 算法及其在旅行商问题中的应用[J]. 计算机工程, 2016,42(3): 192-197.
|
|
GENG Z Q , QIU D H , HAN Y M . Max-min ant system algorithm based on chaos and its application in TSP[J]. Computer Engineering, 2016,42(3): 192-197.
|
[18] |
WANG Y . Hybrid max-min ant system with four vertices and three lines inequality for traveling salesman problem[J]. Soft Computing, 2015,19(3): 585-596.
|
[19] |
张层 . 基于二维凸包的改进蚁群算法求解 TSP 问题[D]. 广州:华南理工大学, 2013.
|
|
ZHANG C . An improved ant colony algorithm based on two-dimensional convex hull for TSP[D]. Guangzhou:South China University of Technology, 2013.
|
[20] |
党小超, 李小艳 . 基于图论的 WSN 节点定位路径规划[J]. 计算机工程, 2012,38(11): 100-103.
|
|
DANG X C , LI X Y . WSN node localization path planning based on graph theory[J]. Computer Engineering, 2012,38(11): 100-103.
|
[21] |
PRAGYA , DUTTA M , PRATYUSH , . TSP solution using dimensional ant colony optimization[C]// International Conference on Advanced Computing & Communication Technologies. 2015: 506-512.
|
[22] |
QIN H , ZHOU S , HUO L ,et al. A new ant colony algorithm based on dynamic local search for TSP[C]// International Conference on Communication Systems and Network Technologies. 2015: 913-917.
|
[23] |
GU S , ZHANG X . An improved ant colony algorithm with soldier ants[C]// 2015 11th International Conference on Natural Computation (ICNC). 2016: 205-209.
|
[24] |
LUO W , LIN D , FENG X X . An improved ant colony optimization and its application on TSP problem[C]// 2016 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber,Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData). 2017: 136-141.
|
[25] |
盛国军, 温涛, 郭权 ,等. 基于改进蚁群算法的可信服务发现[J]. 通信学报, 2013,34(10): 37-48.
|
|
SHENG G J , WEN T , GUO Q ,et al. Trustworthy service discovery based on a modified ant colony algorithm[J]. Journal on Communica-tions, 2013,34(10): 37-48.
|
[26] |
詹士昌, 徐婕, 吴俊 . 蚁群算法中有关算法参数的最优选择[J]. 科技通报, 2003,19(5): 381-386.
|
|
ZHAN S C , XU J , WU J . The optimal selection on the parameters of the ant colony algorithm[J]. Bulletin of Science and Technology, 2003,19(5): 381-386.
|