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

A Multi-Mechanism Seagull Optimization Algorithm Incorporating Generalized Opposition-Based Nonlinear Boundary Processing

Author

Listed:
  • Xinyu Liu

    (School of Computer and Information Engineering, Jiangxi Agriculture University, Nanchang 330045, China)

  • Guangquan Li

    (School of Computer and Information Engineering, Jiangxi Agriculture University, Nanchang 330045, China)

  • Peng Shao

    (School of Computer and Information Engineering, Jiangxi Agriculture University, Nanchang 330045, China)

Abstract

The seagull optimization algorithm (SOA), a well-known illustration of intelligent algorithms, has recently drawn a lot of academic interest. However, it has a variety of issues including slower convergence, poorer search accuracy, the single path for pursuing optimization, and the simple propensity to slip into local optimality. This paper suggests a multi-mechanism seagull optimization algorithm (GEN−SOA) that incorporates the generalized opposition-based, adaptive nonlinear weights, and evolutionary boundary constraints to address these demerits further. These methods are balanced and promoted the population variety and the capability to conduct global and local search. Compared with SOA, PSO, SCA, SSA, and BOA on 12 well-known test functions, the experimental results demonstrate that GEN-SOA has a higher accuracy and faster convergence than the other five algorithms, and it can find the global optimal solution beyond the local optimum. Furthermore, to verify the capability of GEN−SOA to solve practical problems, this paper applied GEN−SOA to solve two standard engineering optimization design problems including a welding optimization and a pressure vessel optimization, and the experimental results showed that it has significant advantages over SOA.

Suggested Citation

  • Xinyu Liu & Guangquan Li & Peng Shao, 2022. "A Multi-Mechanism Seagull Optimization Algorithm Incorporating Generalized Opposition-Based Nonlinear Boundary Processing," Mathematics, MDPI, vol. 10(18), pages 1-19, September.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:18:p:3295-:d:912364
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/18/3295/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/18/3295/
    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:10:y:2022:i:18:p:3295-:d:912364. 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.