KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization

被引:2
作者
Liu, Mingxia [1 ]
You, Xiaoming [1 ]
Yu, Xingxing [2 ]
Liu, Sheng [3 ]
机构
[1] Shanghai Univ Engn Sci, Coll Elect & Elect Engn, Shanghai 201620, Peoples R China
[2] Donghua Univ, Sch Comp Sci & Technol, Shanghai 201620, Peoples R China
[3] Shanghai Univ Engn Sci, Coll Management, Shanghai 201620, Peoples R China
基金
中国国家自然科学基金;
关键词
Convergence; Urban areas; Optimization; Ant colony optimization; Traveling salesman problems; Heuristic algorithms; Sociology; KL divergence; multi-colony ant optimization; pheromone distribution; pheromone fusion; traveling salesman problem; ALGORITHM; SYSTEM; STRATEGIES;
D O I
10.1109/ACCESS.2019.2948395
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we present a heterogeneous multi-colony ant optimization with a novel interaction strategy named pheromone fusion to balance the search ability and the convergence speed of the conventional ant colony optimization. The pheromone fusion performs interaction directly and effectively by the interchange of the pheromone matrices. It could exploit the benefits of pheromone distribution and take full use of the advantages of heterogeneous sub-colonies. There are also two states defined in this study to control the interaction. The global state based on KL divergence determines which sub-colonies should interact with each other, while the local state based on information entropy decides when a sub-colony starts interaction. These two states greatly improve the adaptability and ensure the effectiveness of the interaction. In addition, a reward and punishment strategy is introduced to adjust the pheromone distribution and facilitate the interaction. The experimental results on the Traveling Salesman Problem demonstrate that the proposed algorithm outperforms the multi-colony algorithms presented in some recent works. The studies also indicate that the proposed algorithm could improve the solution quality and accelerate the convergence compared with single-colony algorithms.
引用
收藏
页码:152646 / 152657
页数:12
相关论文
共 38 条
[1]  
Bullnheimer B., 1999, CENTRAL EUROPEAN J O, V7, P25
[2]   Entropy-Based Dynamic Heterogeneous Ant Colony Optimization [J].
Chen, Jia ;
You, Xiao-Ming ;
Liu, Sheng ;
Li, Juan .
IEEE ACCESS, 2019, 7 :56317-56328
[3]   A New Evolutionary Multiobjective Model for Traveling Salesman Problem [J].
Chen, Xuejiao ;
Liu, Yuxin ;
Li, Xianghua ;
Wang, Zhen ;
Wang, Songxin ;
Gao, Chao .
IEEE ACCESS, 2019, 7 :66964-66979
[4]   Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach [J].
Chen, Zong-Gan ;
Zhan, Zhi-Hui ;
Lin, Ying ;
Gong, Yue-Jiao ;
Gu, Tian-Long ;
Zhao, Feng ;
Yuan, Hua-Qiang ;
Chen, Xiaofeng ;
Li, Qing ;
Zhang, Jun .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (08) :2912-2926
[5]  
DENG K, 2009, COMPUT ENG APPL, V44, P9
[6]   An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem [J].
Deng, Wu ;
Xu, Junjie ;
Zhao, Huimin .
IEEE ACCESS, 2019, 7 :20281-20292
[7]   Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment [J].
Deng, Wu ;
Zhao, Huimin ;
Yang, Xinhua ;
Xiong, Juxia ;
Sun, Meng ;
Li, Bo .
APPLIED SOFT COMPUTING, 2017, 59 :288-302
[8]   A novel collaborative optimization algorithm in solving complex optimization problems [J].
Deng, Wu ;
Zhao, Huimin ;
Zou, Li ;
Li, Guangyu ;
Yang, Xinhua ;
Wu, Daqing .
SOFT COMPUTING, 2017, 21 (15) :4387-4398
[9]   Solving the traveling salesman problem using cooperative genetic ant systems [J].
Dong, Gaifang ;
Guo, William W. ;
Tickle, Kevin .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) :5006-5011
[10]  
[董荣荣 Dong Rongrong], 2019, [中国农业大学学报, Journal of China Agricultural University], V24, P41