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

GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

Author

Listed:
  • Mohammad Dehghani

    (Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz 71557-13876, Iran)

  • Zeinab Montazeri

    (Department of Electrical and Electronics Engineering, Shiraz University of Technology, Shiraz 71557-13876, Iran)

  • Štěpán Hubálovský

    (Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic)

Abstract

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.

Suggested Citation

  • Mohammad Dehghani & Zeinab Montazeri & Štěpán Hubálovský, 2021. "GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems," Mathematics, MDPI, vol. 9(11), pages 1-23, May.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:11:p:1190-:d:561305
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/11/1190/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/11/1190/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    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. Bing Tan & Shanshan Xu & Songxiao Li, 2020. "Modified Inertial Hybrid and Shrinking Projection Algorithms for Solving Fixed Point Problems," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    2. Yinglin Luo & Meijuan Shang & Bing Tan, 2020. "A General Inertial Viscosity Type Method for Nonexpansive Mappings and Its Applications in Signal Processing," Mathematics, MDPI, vol. 8(2), pages 1-18, February.

    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:9:y:2021:i:11:p:1190-:d:561305. 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: 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.