An ant colony optimization algorithm with evolutionary experience-guided pheromone updating strategies for multi-objective optimization

被引:12
|
作者
Zhao, Haitong [2 ]
Zhang, Changsheng [1 ]
机构
[1] Northeastern Univ, Software Coll, 195 Chuangxin Rd, Shenyang 110169, Peoples R China
[2] Northeastern Univ, Sch Comp Sci & Engn, 195 Chuangxin Rd, Shenyang 110169, Peoples R China
基金
中国国家自然科学基金;
关键词
Ant colony optimization; Multi-objective optimization; Historical experience; Pheromone updating; DECOMPOSITION; MOEA/D;
D O I
10.1016/j.eswa.2022.117151
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Since the multi-objective ant colony optimization algorithm consumes a massive cost of time and computation resources, improving its convergence performance is essential. This paper proposes a historical experience-guided pheromone updating approach to improve the efficiency and enhance the optimization quality, which uses a learning automata to choose suitable pheromone updating methods adaptively according to the searching history. The learning automata performs different kinds of pheromone updating schemes, including a novel intragroup evolutionary information-guided strategy and two widely accepted strategies. A comparative experiment tests the proposed algorithm on multi-objective benchmark traveling salesman problems with a high-dimensional search space, as well as the primer design problem, which is practical in the biology area. The experimental results indicate that the proposed algorithm has a competitive performance on both the benchmark problems and the practical problem.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Improved ant colony algorithm for multi-objective optimization
    [J]. 2005, Univ. of Electronic Science and Technology of China, Chengdu, China (34):
  • [2] Ant colony optimization for multi-objective optimization problems
    Alaya, Ines
    Solnon, Christine
    Ghedira, Khaled
    [J]. 19TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, VOL I, PROCEEDINGS, 2007, : 450 - 457
  • [3] Multi-objective Ant Colony Optimization: Review
    Awadallah, Mohammed A.
    Makhadmeh, Sharif Naser
    Al-Betar, Mohammed Azmi
    Dalbah, Lamees Mohammad
    Al-Redhaei, Aneesa
    Kouka, Shaimaa
    Enshassi, Oussama S.
    [J]. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2024,
  • [4] A Modified Pareto Strength Ant Colony Optimization Algorithm for the Multi-objective Optimization Problems
    Ariyasingha, I. D. I. D.
    Fernando, T. G. I.
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION FOR SUSTAINABILITY (ICIAFS): INTEROPERABLE SUSTAINABLE SMART SYSTEMS FOR NEXT GENERATION, 2016,
  • [5] Multi-objective Ant Colony Algorithm Based on Pheromone Weight
    Yang, Lei
    Jia, Xiaotian
    Liu, Ganming
    [J]. 2020 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2020), 2020, : 49 - 53
  • [6] Multi-objective Ant Colony Optimization Algorithm Based on Load Balance
    Zhu, Liwen
    Tang, Ruichun
    Tao, Ye
    Ren, Meiling
    Xue, Lulu
    [J]. CLOUD COMPUTING AND SECURITY, ICCCS 2016, PT I, 2016, 10039 : 193 - 205
  • [7] Multi-Objective Optimization of Smart Grid Based on Ant Colony Algorithm
    Shi, Zhongsheng
    Kumar, Rajiv
    Tomar, Ravi
    [J]. ELECTRICA, 2022, 22 (03): : 395 - 402
  • [8] Multi-objective ant colony optimization algorithm for virtual machine placement
    Zhao, Jun
    Ma, Zhong
    Liu, Chi
    Li, Haishan
    Wang, Xinyu
    [J]. Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2015, 42 (03): : 173 - 178
  • [9] Urban Projects Planning by Multi-objective Ant Colony Optimization Algorithm
    Khelifa, Boudjemaa
    Laouar, Mohamed Ridda
    [J]. ICIST '18: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES, 2018,
  • [10] An Advanced Ant Colony Algorithm for Constrained Multi-objective Optimization Problem
    Luo, Yan-mei
    Yu, Guo-yan
    [J]. 2ND INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND OPTIMIZATION TECHNOLOGIES AND APPLICATIONS (MSOTA 2018), 2018, : 485 - 493