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

A Novel Integrated Heuristic Optimizer Using a Water Cycle Algorithm and Gravitational Search Algorithm for Optimization Problems

Author

Listed:
  • Mengnan Tian

    (School of Science, Xi’an Polytechnic University, Xi’an 710048, China)

  • Junhua Liu

    (School of Computer Science, Xi’an Polytechnic University, Xi’an 710048, China)

  • Wei Yue

    (School of Science, Xi’an Polytechnic University, Xi’an 710048, China)

  • Jie Zhou

    (School of Science, Xi’an Polytechnic University, Xi’an 710048, China)

Abstract

This paper presents a novel composite heuristic algorithm for global optimization by organically integrating the merits of a water cycle algorithm (WCA) and gravitational search algorithm (GSA). To effectively reinforce the exploration and exploitation of algorithms and reasonably achieve their balance, a modified WCA is first put forward to strengthen its search performance by introducing the concept of the basin, where the position of the solution is also considered into the assignment of the sea or river and its streams, and the number of the guider solutions is adaptively reduced during the search process. Furthermore, the enhanced WCA is adaptively cooperated with the gravitational search to search for new solutions based on their historical performance within a certain stage. Moreover, the binomial crossover operation is also incorporated after the water cycle search or the gravitational search to further improve the search capability of the algorithm. Finally, the performance of the proposed algorithm is evaluated by comparing with six excellent meta-heuristic algorithms on the IEEE CEC2014 test suite, and the numerical results indicate that the proposed algorithm is very competitive.

Suggested Citation

  • Mengnan Tian & Junhua Liu & Wei Yue & Jie Zhou, 2023. "A Novel Integrated Heuristic Optimizer Using a Water Cycle Algorithm and Gravitational Search Algorithm for Optimization Problems," Mathematics, MDPI, vol. 11(8), pages 1-26, April.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:8:p:1880-:d:1124396
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/8/1880/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/8/1880/
    Download Restriction: no
    ---><---

    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:11:y:2023:i:8:p:1880-:d:1124396. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.