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 条
[1]   Discrete Spider Monkey Optimization for Travelling Salesman Problem [J].
Akhand, M. A. H. ;
Ayon, Safial Islam ;
Shahriyar, S. A. ;
Siddique, N. ;
Adeli, H. .
APPLIED SOFT COMPUTING, 2020, 86 (86)
[2]   A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem [J].
Alipour, Mir Mohammad ;
Razavi, Seyed Naser ;
Derakhshi, Mohammad Reza Feizi ;
Balafar, Mohammad Ali .
NEURAL COMPUTING & APPLICATIONS, 2018, 30 (09) :2935-2951
[3]   Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems [J].
Benyamin, Abdollahzadeh ;
Farhad, Soleimanian Gharehchopogh ;
Saeid, Barshandeh .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2021, 36 (03) :1270-1303
[4]  
DCavid B, 2018, APPL SOFT COMPUT, V71
[5]   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
[6]   Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem [J].
Dong, Xueshi ;
Zhang, Hong ;
Xu, Min ;
Shen, Fanfan .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2021, 114 :229-242
[7]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[8]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[9]   Ant colony optimization -: Artificial ants as a computational intelligence technique [J].
Dorigo, Marco ;
Birattari, Mauro ;
Stuetzle, Thomas .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39
[10]   AN ANALOG APPROACH TO THE TRAVELING SALESMAN PROBLEM USING AN ELASTIC NET METHOD [J].
DURBIN, R ;
WILLSHAW, D .
NATURE, 1987, 326 (6114) :689-691