IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v159y2019icp57-92.html
   My bibliography  Save this article

Nature-inspired approach: An enhanced moth swarm algorithm for global optimization

Author

Listed:
  • Luo, Qifang
  • Yang, Xiao
  • Zhou, Yongquan

Abstract

The moth swarm algorithm (MSA) is a recent swarm intelligence optimization algorithm, but its convergence precision and ability can be limited in some applications. To enhance the MSA’s exploration abilities, an enhanced MSA called the elite opposition-based MSA (EOMSA) is proposed. For the EOMSA, an elite opposition-based strategy is used to enhance the diversity of the population and its exploration ability. The EOMSA was validated using 23 benchmark functions and three structure engineering design problems. The results show that the EOMSA can find a more accurate solution than other population-based algorithms, and it also has a fast convergence speed and high degree of stability.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:159:y:2019:i:c:p:57-92
    DOI: 10.1016/j.matcom.2018.10.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475418302829
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2018.10.011?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. Garg, Harish, 2016. "A hybrid PSO-GA algorithm for constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 292-305.
    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. Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.
    2. Hu, Gang & Du, Bo & Li, Huinan & Wang, Xupeng, 2022. "Quadratic interpolation boosted black widow spider-inspired optimization algorithm with wavelet mutation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 200(C), pages 428-467.
    3. Kang, Helei & Liu, Renyun & Yao, Yifei & Yu, Fanhua, 2023. "Improved Harris hawks optimization for non-convex function optimization and design optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 619-639.
    4. Yan, Zheping & Zhang, Jinzhong & Zeng, Jia & Tang, Jialing, 2021. "Nature-inspired approach: An enhanced whale optimization algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 185(C), pages 17-46.

    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. 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.
    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.
    3. Yassin Belkourchia & Mohamed Zeriab Es-Sadek & Lahcen Azrar, 2023. "New Hybrid Perturbed Projected Gradient and Simulated Annealing Algorithms for Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 438-475, May.
    4. Touqeer Ahmed Jumani & Mohd Wazir Mustafa & Nawaf N. Hamadneh & Samer H. Atawneh & Madihah Md. Rasid & Nayyar Hussain Mirjat & Muhammad Akram Bhayo & Ilyas Khan, 2020. "Computational Intelligence-Based Optimization Methods for Power Quality and Dynamic Response Enhancement of ac Microgrids," Energies, MDPI, vol. 13(16), pages 1-22, August.
    5. Ali Sardar Shahraki & Mohim Tash & Tommaso Caloiero & Ommolbanin Bazrafshan, 2024. "Optimal Allocation of Water Resources Using Agro-Economic Development and Colony Optimization Algorithm," Sustainability, MDPI, vol. 16(13), pages 1-18, July.
    6. Li, Chao & Zhai, Rongrong & Yang, Yongping & Patchigolla, Kumar & Oakey, John E. & Turner, Peter, 2019. "Annual performance analysis and optimization of a solar tower aided coal-fired power plant," Applied Energy, Elsevier, vol. 237(C), pages 440-456.
    7. Brayan A. Atoccsa & David W. Puma & Daygord Mendoza & Estefany Urday & Cristhian Ronceros & Modesto T. Palma, 2024. "Optimization of Ampacity in High-Voltage Underground Cables with Thermal Backfill Using Dynamic PSO and Adaptive Strategies," Energies, MDPI, vol. 17(5), pages 1-19, February.
    8. Yan, Zheping & Zhang, Jinzhong & Zeng, Jia & Tang, Jialing, 2021. "Nature-inspired approach: An enhanced whale optimization algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 185(C), pages 17-46.
    9. Máximo Méndez & Mariano Frutos & Fabio Miguel & Ricardo Aguasca-Colomo, 2020. "TOPSIS Decision on Approximate Pareto Fronts by Using Evolutionary Algorithms: Application to an Engineering Design Problem," Mathematics, MDPI, vol. 8(11), pages 1-27, November.
    10. 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.
    11. Kandidayeni, M. & Macias, A. & Khalatbarisoltani, A. & Boulon, L. & Kelouwani, S., 2019. "Benchmark of proton exchange membrane fuel cell parameters extraction with metaheuristic optimization algorithms," Energy, Elsevier, vol. 183(C), pages 912-925.
    12. Aniruddha Samanta & Kajla Basu, 2019. "Multi-objective reliability redundancy allocation problem considering two types of common cause failures," 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. 10(3), pages 369-383, June.
    13. Chen, Shuixia & Wang, Jian-qiang & Zhang, Hong-yu, 2019. "A hybrid PSO-SVM model based on clustering algorithm for short-term atmospheric pollutant concentration forecasting," Technological Forecasting and Social Change, Elsevier, vol. 146(C), pages 41-54.
    14. Gülnur Yildizdan & Ömer Kaan Baykan, 2020. "A New Hybrid BA_ABC Algorithm for Global Optimization Problems," Mathematics, MDPI, vol. 8(10), pages 1-36, October.
    15. Mohit Agarwal & Gur Mauj Saran Srivastava, 2018. "Genetic Algorithm-Enabled Particle Swarm Optimization (PSOGA)-Based Task Scheduling in Cloud Computing Environment," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 17(04), pages 1237-1267, July.
    16. Hakan Yılmazer & Selma Ayşe Özel, 2024. "Diverse but Relevant Recommendations with Continuous Ant Colony Optimization," Mathematics, MDPI, vol. 12(16), pages 1-26, August.
    17. Hong, Wei-Chiang, 2010. "Application of chaotic ant swarm optimization in electric load forecasting," Energy Policy, Elsevier, vol. 38(10), pages 5830-5839, October.
    18. Gao, Renbo & Wu, Fei & Zou, Quanle & Chen, Jie, 2022. "Optimal dispatching of wind-PV-mine pumped storage power station: A case study in Lingxin Coal Mine in Ningxia Province, China," Energy, Elsevier, vol. 243(C).
    19. Gao, Wei-feng & Huang, Ling-ling & Liu, San-yang & Chan, Felix T.S. & Dai, Cai & Shan, Xian, 2015. "Artificial bee colony algorithm with multiple search strategies," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 269-287.
    20. Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes, 2017. "On a smoothed penalty-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 561-585, 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:eee:matcom:v:159:y:2019:i:c:p:57-92. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.