IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v18y2018i3d10.1007_s12351-018-0419-9.html
   My bibliography  Save this article

Vitality-based elephant search algorithm

Author

Listed:
  • Zhonghuan Tian

    (University of Macau)

  • Simon Fong

    (University of Macau)

  • Suash Deb

    (IT and Educational Consultant)

  • Rui Tang

    (University of Macau)

  • Raymond Wong

    (University of New South Wales)

Abstract

Elephant search algorithm (ESA) is one of the contemporary meta-heuristic search algorithms recently proposed. The male elephants are responsible for global exploration, roaming to new dimensions of search space. The female elephants focus on doing local search, for finding the optimal solution. A lifespan mechanism is designed to control the birth and death that all agents will have an increasing dead probability with their aging incrementally. This mechanism is set to avoid whole agents falling into local optimum and those new-born elephants will evolve by inheriting heuristic information from the ancestors. In the naïve version of ESA, the search agents expire at equal probability regardless of their current locations. It is supposed that search agents who have shown to improve their solutions are more likely to continue producing better results than those mediocre agents. By this concept, a vitality-based elephant search algorithm called VESA is proposed to fine-tune the lifespan of search agents using a vitality computation mechanism that rewards the good performing agents’ longer life at the expense of the mediocre agents. With the lifespan extended, the fit agents have more time to continue enhancing the solutions. Computer simulation on nine testing functions shows the VESA outperforms the naïve ESA in terms of the final fitness value. A min–max based self-adaptive ratio search strategy is also proposed to help find a good gender ratio in a reasonable time.

Suggested Citation

  • Zhonghuan Tian & Simon Fong & Suash Deb & Rui Tang & Raymond Wong, 2018. "Vitality-based elephant search algorithm," Operational Research, Springer, vol. 18(3), pages 841-863, October.
    • Handle: RePEc:spr:operea:v:18:y:2018:i:3:d:10.1007_s12351-018-0419-9
    DOI: 10.1007/s12351-018-0419-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-018-0419-9
    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/s12351-018-0419-9?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. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    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. Alireza Pooya & Morteza Pakdaman, 2021. "A new continuous time optimal control model for manpower planning with promotion from inside the system," Operational Research, Springer, vol. 21(1), pages 349-364, March.
    2. Sedghi, Mahdieh & Kauppila, Osmo & Bergquist, Bjarne & Vanhatalo, Erik & Kulahci, Murat, 2021. "A taxonomy of railway track maintenance planning and scheduling: A review and research trends," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    3. Zsolt Ercsey & Zoltán Kovács, 2024. "Multicommodity network flow model of a human resource allocation problem considering time periods," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(4), pages 1041-1059, December.
    4. Seyed Hamid Reza Pasandideh & Seyed Taghi Akhavan Niaki & Reza Abdollahi, 2020. "Modeling and solving a bi-objective joint replenishment-location problem under incremental discount: MOHSA and NSGA-II," Operational Research, Springer, vol. 20(4), pages 2365-2396, December.
    5. Xiong Wang & Fernando A. F. Ferreira & Pengyu Yan, 2024. "A multi-objective competency-based decision support system for the assignment of internal auditors to multiple projects," Annals of Operations Research, Springer, vol. 338(1), pages 303-334, July.
    6. Richárd Kicsiny & Levente Hufnagel & Zoltán Varga, 2023. "Allocation of limited resources under quadratic constraints," Annals of Operations Research, Springer, vol. 322(2), pages 793-817, March.
    7. Meiyan Lin & Kwai Sang Chin & Lijun Ma & Kwok Leung Tsui, 2020. "A comprehensive multi-objective mixed integer nonlinear programming model for an integrated elderly care service districting problem," Annals of Operations Research, Springer, vol. 291(1), pages 499-529, August.

    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:operea:v:18:y:2018:i:3:d:10.1007_s12351-018-0419-9. 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.