IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i6p925-d770671.html
   My bibliography  Save this article

A New Fast Ant Colony Optimization Algorithm: The Saltatory Evolution Ant Colony Optimization Algorithm

Author

Listed:
  • Shugang Li

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Yanfang Wei

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Xin Liu

    (School of Management, Shanghai University, Shanghai 200444, China)

  • He Zhu

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Zhaoxu Yu

    (Department of Automation, East China University of Science and Technology, Shanghai 200237, China)

Abstract

Various studies have shown that the ant colony optimization (ACO) algorithm has a good performance in approximating complex combinatorial optimization problems such as traveling salesman problem (TSP) for real-world applications. However, disadvantages such as long running time and easy stagnation still restrict its further wide application in many fields. In this study, a saltatory evolution ant colony optimization (SEACO) algorithm is proposed to increase the optimization speed. Different from the past research, this study innovatively starts from the perspective of near-optimal path identification and refines the domain knowledge of near-optimal path identification by quantitative analysis model using the pheromone matrix evolution data of the traditional ACO algorithm. Based on the domain knowledge, a near-optimal path prediction model is built to predict the evolutionary trend of the path pheromone matrix so as to fundamentally save the running time. Extensive experiment results on a traveling salesman problem library (TSPLIB) database demonstrate that the solution quality of the SEACO algorithm is better than that of the ACO algorithm, and it is more suitable for large-scale data sets within the specified time window. This means it can provide a promising direction to deal with the problem about slow optimization speed and low accuracy of the ACO algorithm.

Suggested Citation

  • Shugang Li & Yanfang Wei & Xin Liu & He Zhu & Zhaoxu Yu, 2022. "A New Fast Ant Colony Optimization Algorithm: The Saltatory Evolution Ant Colony Optimization Algorithm," Mathematics, MDPI, vol. 10(6), pages 1-22, March.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:925-:d:770671
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/6/925/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/6/925/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lipowski, Adam & Lipowska, Dorota, 2012. "Roulette-wheel selection via stochastic acceptance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(6), pages 2193-2196.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shugang Li & Hui Chen & Xin Liu & Jiayi Li & Kexin Peng & Ziming Wang, 2023. "Online Personalized Learning Path Recommendation Based on Saltatory Evolution Ant Colony Optimization Algorithm," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    2. Yunshan Sun & Qian Huang & Ting Liu & Yuetong Cheng & Yanqin Li, 2023. "Multi-Strategy Enhanced Harris Hawks Optimization for Global Optimization and Deep Learning-Based Channel Estimation Problems," Mathematics, MDPI, vol. 11(2), pages 1-28, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Enming & Zhou, Zhongbao & Li, Ruiyang & Chang, Zhongxiang & Shi, Jianmai, 2024. "The multi-fleet delivery problem combined with trucks, tricycles, and drones for last-mile logistics efficiency requirements under multiple budget constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    2. Andrés Alfonso Rosales-Muñoz & Luis Fernando Grisales-Noreña & Jhon Montano & Oscar Danilo Montoya & Alberto-Jesus Perea-Moreno, 2021. "Application of the Multiverse Optimization Method to Solve the Optimal Power Flow Problem in Direct Current Electrical Networks," Sustainability, MDPI, vol. 13(16), pages 1-28, August.
    3. Hu, Yusha & Li, Jigeng & Hong, Mengna & Ren, Jingzheng & Lin, Ruojue & Liu, Yue & Liu, Mengru & Man, Yi, 2019. "Short term electric load forecasting model and its verification for process industrial enterprises based on hybrid GA-PSO-BPNN algorithm—A case study of papermaking process," Energy, Elsevier, vol. 170(C), pages 1215-1227.
    4. Mehmet Burak Şenol & Ekrem Alper Murat, 2023. "A sequential solution heuristic for continuous facility layout problems," Annals of Operations Research, Springer, vol. 320(1), pages 355-377, January.
    5. Baowei Wang & Peng Zhao, 2020. "An Adaptive Image Watermarking Method Combining SVD and Wang-Landau Sampling in DWT Domain," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    6. Fathy, Ahmed, 2022. "A novel artificial hummingbird algorithm for integrating renewable based biomass distributed generators in radial distribution systems," Applied Energy, Elsevier, vol. 323(C).
    7. Pascal P Klamser & Pawel Romanczuk, 2021. "Collective predator evasion: Putting the criticality hypothesis to the test," PLOS Computational Biology, Public Library of Science, vol. 17(3), pages 1-21, March.
    8. Maryam Dehghan Chenary & Arman Ferdowsi & Richard F. Hartl, 2024. "A Pareto-Based Clustering Approach for Solving a Bi-Objective Mobile Hub Location Problem with Congestion," Logistics, MDPI, vol. 8(4), pages 1-30, December.
    9. Ojer, Jaume & López, Álvaro G. & Used, Javier & Sanjuán, Miguel A.F., 2022. "A stochastic hybrid model with a fast concentration bias for chemotactic cellular attraction," Chaos, Solitons & Fractals, Elsevier, vol. 156(C).
    10. Sun, Li & Liu, Like & Xu, Zhongzhi & Jie, Yang & Wei, Dong & Wang, Pu, 2015. "Locating inefficient links in a large-scale transportation network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 537-545.
    11. Farhan Aadil & Khalid Bashir Bajwa & Salabat Khan & Nadeem Majeed Chaudary & Adeel Akram, 2016. "CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-21, May.
    12. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
    13. Sean Grimes & David E. Breen, 2023. "A Multi-Agent Approach to Binary Classification Using Swarm Intelligence," Future Internet, MDPI, vol. 15(1), pages 1-27, January.
    14. Xuanang Feng & Jianing Zhao & Eisuke Kita, 2021. "Genetic Algorithm-based Optimization of Deep Neural Network Ensemble," The Review of Socionetwork Strategies, Springer, vol. 15(1), pages 27-47, June.
    15. Samaneh Seifollahi-Aghmiuni & Omid Bozorg Haddad, 2018. "Multi Objective Optimization with a New Evolutionary Algorithm," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(12), pages 4013-4030, September.
    16. Tungom, Chia E. & Wang, Hong & Beata, Kamuya & Niu, Ben, 2024. "SWOAM: Swarm optimized agents for energy management in grid-interactive connected buildings," Energy, Elsevier, vol. 301(C).
    17. Xianbo Xiang & Caoyang Yu & He Xu & Stuart X. Zhu, 2018. "Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    18. Li, Zerun & Liu, Wei & Wang, Jincheng & Xiong, Kezhao & Di, Zengru, 2024. "Weakening and disappearance of the jaming behavior in systems of self-propelled particles," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
    19. Reza Ghanbari & Khatere Ghorbani-Moghadam & Nezam Mahdavi-Amiri, 2021. "A time variant multi-objective particle swarm optimization algorithm for solving fuzzy number linear programming problems using modified Kerre’s method," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 403-424, June.
    20. Ahmed A. Ewees & Mohammed A. A. Al-qaness & Laith Abualigah & Diego Oliva & Zakariya Yahya Algamal & Ahmed M. Anter & Rehab Ali Ibrahim & Rania M. Ghoniem & Mohamed Abd Elaziz, 2021. "Boosting Arithmetic Optimization Algorithm with Genetic Algorithm Operators for Feature Selection: Case Study on Cox Proportional Hazards Model," Mathematics, MDPI, vol. 9(18), pages 1-22, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:925-:d:770671. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.