IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v9y2018i4d10.1007_s13198-017-0651-3.html
   My bibliography  Save this article

A new ants interaction scheme for continuous optimization problems

Author

Listed:
  • Anand Kumar

    (Indian Institute of Technology Mandi)

  • Manoj Thakur

    (Indian Institute of Technology Mandi)

  • Garima Mittal

    (Indian Institute of Management Lucknow)

Abstract

Ant colony optimization (ACO) algorithms have been used successfully to solve a wide variety of combinatorial optimization problems. In the recent past many modifications have been proposed in ACO algorithms to solve continuous optimization problems. However, most of the ACO variants to solve continuous optimization problems lack ability of efficient exploration of the search space and suffer from the problem of premature convergence. In this work a new ACO algorithm (ACO–LD) is proposed that incorporates Laplace distribution based interaction scheme among the ants. Also, in order to avoid the problem of stagnation, an additional diversification mechanism is introduced. The proposed ACO–LD is tested on benchmark test functions taken from Congress on Evolutionary Computation 2014 (CEC2014) and the results are compared with four state-of-the-art algorithms reported in CEC2014. ACO–LD is also applied to solve six real life problems and the results are compared with the results of six other algorithms reported in the literature. The analysis of the results shows that the overall performance of ACO–LD is found to be better than the other algorithms included in the present study.

Suggested Citation

  • Anand Kumar & Manoj Thakur & Garima Mittal, 2018. "A new ants interaction scheme for continuous optimization problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(4), pages 784-801, August.
    • Handle: RePEc:spr:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0651-3
    DOI: 10.1007/s13198-017-0651-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-017-0651-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-017-0651-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
    2. Liao, Tianjun & Stützle, Thomas & Montes de Oca, Marco A. & Dorigo, Marco, 2014. "A unified ant colony optimization algorithm for continuous optimization," European Journal of Operational Research, Elsevier, vol. 234(3), pages 597-609.
    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. Zhaojun Zhang & Zhaoxiong Xu & Shengyang Luan & Xuanyu Li & Yifei Sun, 2020. "Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem," Mathematics, MDPI, vol. 8(10), pages 1-16, September.

    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. Stefano Bromuri, 2019. "Dynamic heuristic acceleration of linearly approximated SARSA( $$\lambda $$ λ ): using ant colony optimization to learn heuristics dynamically," Journal of Heuristics, Springer, vol. 25(6), pages 901-932, December.
    2. Li, Guiqiang & Jin, Yi & Akram, M.W. & Chen, Xiao & Ji, Jie, 2018. "Application of bio-inspired algorithms in maximum power point tracking for PV systems under partial shading conditions – A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 81(P1), pages 840-873.
    3. Bera, Sasadhar & Mukherjee, Indrajit, 2016. "A multistage and multiple response optimization approach for serial manufacturing system," European Journal of Operational Research, Elsevier, vol. 248(2), pages 444-452.
    4. Zhaojun Zhang & Zhaoxiong Xu & Shengyang Luan & Xuanyu Li & Yifei Sun, 2020. "Opposition-Based Ant Colony Optimization Algorithm for the Traveling Salesman Problem," Mathematics, MDPI, vol. 8(10), pages 1-16, September.
    5. Nikolaos Ploskas & Nikolaos V. Sahinidis, 2022. "Review and comparison of algorithms and software for mixed-integer derivative-free optimization," Journal of Global Optimization, Springer, vol. 82(3), pages 433-462, March.
    6. Ozgur Kisi & Armin Azad & Hamed Kashi & Amir Saeedian & Seyed Ali Asghar Hashemi & Salar Ghorbani, 2019. "Modeling Groundwater Quality Parameters Using Hybrid Neuro-Fuzzy Methods," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 33(2), pages 847-861, January.
    7. Bera, Sasadhar & Mukherjee, Indrajit, 2012. "An ellipsoidal distance-based search strategy of ants for nonlinear single and multiple response optimization problems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 321-332.
    8. Amjad Hudaib & Mohammad Khanafseh & Ola Surakhi, 2018. "An Improved Version of K-medoid Algorithm using CRO," Modern Applied Science, Canadian Center of Science and Education, vol. 12(2), pages 116-116, February.
    9. Liao, Tianjun & Stützle, Thomas & Montes de Oca, Marco A. & Dorigo, Marco, 2014. "A unified ant colony optimization algorithm for continuous optimization," European Journal of Operational Research, Elsevier, vol. 234(3), pages 597-609.
    10. Eroğlu, Yunus & Seçkiner, Serap Ulusam, 2012. "Design of wind farm layout using ant colony algorithm," Renewable Energy, Elsevier, vol. 44(C), pages 53-62.
    11. Martin Schlüter & Matthias Gerdts, 2010. "The oracle penalty method," Journal of Global Optimization, Springer, vol. 47(2), pages 293-325, June.
    12. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    13. Luo, Qifang & Yang, Xiao & Zhou, Yongquan, 2019. "Nature-inspired approach: An enhanced moth swarm algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 159(C), pages 57-92.
    14. Tiago Maritan Ugulino Araújo & Lisieux Marie M. S. Andrade & Carlos Magno & Lucídio Anjos Formiga Cabral & Roberto Quirino Nascimento & Cláudio N. Meneses, 2016. "DC-GRASP: directing the search on continuous-GRASP," Journal of Heuristics, Springer, vol. 22(4), pages 365-382, August.
    15. Shao, Peng & Liang, Ying & Li, Guangquan & Li, Xing & Yang, Le, 2023. "Birefringence learning: A new global optimization technology model based on birefringence principle in application on artificial bee colony," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 470-486.
    16. Andres Quiros-Granados & JAvier Trejos-Zelaya, 2019. "Estimation of the yield curve for Costa Rica using combinatorial optimization metaheuristics applied to nonlinear regression," Papers 2001.00920, arXiv.org.
    17. Jelić, Marko & Batić, Marko & Krstić, Aleksandra & Bottarelli, Michele & Mainardi, Elena, 2023. "Comparative analysis of metaheuristic optimization approaches for multisource heat pump operation," Renewable and Sustainable Energy Reviews, Elsevier, vol. 188(C).
    18. Qiang Yang & Xu Guo & Xu-Dong Gao & Dong-Dong Xu & Zhen-Yu Lu, 2022. "Differential Elite Learning Particle Swarm Optimization for Global Numerical Optimization," Mathematics, MDPI, vol. 10(8), pages 1-32, April.
    19. Nantiwat Pholdee & Sujin Bureerat, 2016. "Hybrid real-code ant colony optimisation for constrained mechanical design," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(2), pages 474-491, January.
    20. Saeed Behzadpoor & Iraj Faraji Davoudkhani & Almoataz Youssef Abdelaziz & Zong Woo Geem & Junhee Hong, 2022. "Power System Stability Enhancement Using Robust FACTS-Based Stabilizer Designed by a Hybrid Optimization Algorithm," Energies, MDPI, vol. 15(22), pages 1-30, November.

    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:spr:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0651-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.