IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v538y2020ics0378437119315328.html
   My bibliography  Save this article

Selfish herd optimizer with levy-flight distribution strategy for global optimization problem

Author

Listed:
  • Zhao, Ruxin
  • Wang, Yongli
  • Liu, Chang
  • Hu, Peng
  • Li, Yanchao
  • Li, Hao
  • Yuan, Chi

Abstract

In recent years, research on stochastic optimization algorithms has received more and more attention from researchers, especially bio-inspired optimization algorithms. Selfish herd optimizer (SHO) is a novel bio-inspired optimization algorithm. It has features that are easy to understand and implement. However, its global search ability is insufficient and precision needs to be further improved. Therefore, we add levy-flight distribution strategy to improve its global search ability and precision. Our main contribution is to use selfish herd optimizer with levy-flight distribution strategy (LFSHO) to solve function and engineering example optimization problem. From experiment results, we can see that LFSHO has more advantages than other algorithms, according to precision, convergence speed and standard variance. It can conclude that LFSHO is a new method for solving function optimization problem and engineering example optimization problem.

Suggested Citation

  • Zhao, Ruxin & Wang, Yongli & Liu, Chang & Hu, Peng & Li, Yanchao & Li, Hao & Yuan, Chi, 2020. "Selfish herd optimizer with levy-flight distribution strategy for global optimization problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    • Handle: RePEc:eee:phsmap:v:538:y:2020:i:c:s0378437119315328
    DOI: 10.1016/j.physa.2019.122687
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119315328
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.122687?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. Omran, Mahamed G.H. & Salman, Ayed, 2009. "Constrained optimization using CODEQ," Chaos, Solitons & Fractals, Elsevier, vol. 42(2), pages 662-668.
    2. Chao Liu & Peifeng Niu & Guoqiang Li & Yunpeng Ma & Weiping Zhang & Ke Chen, 2018. "Enhanced shuffled frog-leaping algorithm for solving numerical function optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 1133-1153, June.
    3. Liu, Pu & Cui, Guomin & Xiao, Yuan & Chen, Jiaxing, 2018. "A new heuristic algorithm with the step size adjustment strategy for heat exchanger network synthesis," Energy, Elsevier, vol. 143(C), pages 12-24.
    Full references (including those not matched with items on IDEAS)

    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. Garg, Harish, 2016. "A hybrid PSO-GA algorithm for constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 292-305.
    2. Liu, Liuchen & Cui, Guomin & Chen, Jiaxing & Huang, Xiaohuang & Li, Di, 2022. "Two-stage superstructure model for optimization of distributed energy systems (DES) part I: Model development and verification," Energy, Elsevier, vol. 245(C).
    3. Amarjeet Singh & Kusum Deep, 2017. "Hybridizing gravitational search algorithm with real coded genetic algorithms for structural engineering design problem," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 505-536, September.
    4. Lin Sun & Suisui Chen & Jiucheng Xu & Yun Tian, 2019. "Improved Monarch Butterfly Optimization Algorithm Based on Opposition-Based Learning and Random Local Perturbation," Complexity, Hindawi, vol. 2019, pages 1-20, February.
    5. Tung L. Dang & Thi H. H. Huynh & Manh T. Nguyen, 2021. "Media attention and firm value: International evidence," International Review of Finance, International Review of Finance Ltd., vol. 21(3), pages 865-894, September.
    6. Bao, Zhongkai & Cui, Guoming & Chen, Jiaxing & Sun, Tao & Xiao, Yuan, 2018. "A novel random walk algorithm with compulsive evolution combined with an optimum-protection strategy for heat exchanger network synthesis," Energy, Elsevier, vol. 152(C), pages 694-708.

    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:phsmap:v:538:y:2020:i:c:s0378437119315328. 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/physica-a-statistical-mechpplications/ .

    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.