Ant colony algorithm with Stackelberg game and multi-strategy fusion

被引:14
作者
Chen, Da [1 ]
You, XiaoMing [1 ]
Liu, Sheng [2 ]
机构
[1] Shanghai Univ Engn Sci, Coll Elect & Elect Engn, Shanghai 201620, Peoples R China
[2] Shanghai Univ Engn Sci, Sch Management, Shanghai 201620, Peoples R China
关键词
TSP problem; Multiple populations; Stackelberg game; Multi-strategy fusion; HYBRID GENETIC ALGORITHM; OPTIMIZATION; SYSTEM; MECHANISM;
D O I
10.1007/s10489-021-02774-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Aiming at the disadvantages of the ant colony algorithm, such as slow convergence speed and easy to fall into local optimum, this paper proposes an ant colony algorithm with Stackelberg game and multi-strategy fusion. Firstly, Stackelberg game is established between ant colonies, and the population with the excellent performance is taken as the leader to increase the influence of excellent ant colony. Secondly, a multi-strategy fusion system is proposed, which is composed of three strategies: One is the pheromone fusion strategy, which selects the population whose entropy is less than the threshold value and the population with the highest similarity for pheromone fusion to increase the diversity of the algorithm. The second is the elite ant learning strategy, which speeds up the convergence rate by learning the elite ants of the elite population; The third is the pheromone recombination strategy, which helps the algorithm jump out of the local optimum. The simulation experiments of multiple cases in TSPLIB show that the improved algorithm balances diversity and the convergence speed, and effectively improves the quality of the solution.
引用
收藏
页码:6552 / 6574
页数:23
相关论文
共 48 条
[11]   DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem [J].
Ebadinezhad, Sahar .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 92
[12]  
Emile J., 1953, REV ECON-FR, V4, P944
[13]   Premium-penalty ant colony optimization and its application in slope stability analysis [J].
Gao, Wei .
APPLIED SOFT COMPUTING, 2016, 43 :480-488
[14]   An enhanced heuristic ant colony optimization for mobile robot path planning [J].
Gao, Wenxiang ;
Tang, Qing ;
Ye, Beifa ;
Yang, Yaru ;
Yao, Jin .
SOFT COMPUTING, 2020, 24 (08) :6139-6150
[15]   A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem [J].
Gulcu, Saban ;
Mahi, Mostafa ;
Baykan, Omer Kaan ;
Kodaz, Halife .
SOFT COMPUTING, 2018, 22 (05) :1669-1685
[16]   Ant colony optimization for assembly sequence planning based on parameters optimization [J].
Han, Zunpu ;
Wang, Yong ;
Tian, De .
FRONTIERS OF MECHANICAL ENGINEERING, 2021, 16 (02) :393-409
[17]  
Jia YH, 2018, IEEE INT CON MULTI
[18]   A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem [J].
Khan, Indadul ;
Maiti, Manas Kumar .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 :428-438
[19]   CAAS: a novel collective action-based ant system algorithm for solving TSP problem [J].
Li, Sicong ;
Cai, Saihua ;
Li, Li ;
Sun, Ruizhi ;
Yuan, Gang .
SOFT COMPUTING, 2020, 24 (12) :9257-9278
[20]   A High-Accuracy Synchronization Phase-Compensation Method Based on Kalman Filter for Bistatic Synthetic Aperture Radar [J].
Liang, Da ;
Liu, Kaiyu ;
Zhang, Heng ;
Deng, Yunkai ;
Liu, Dacheng ;
Chen, Yafeng ;
Li, Chuang ;
Yue, Haixia ;
Wang, Robert .
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2020, 17 (10) :1722-1726