IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v243y2026icp362-381.html

Improved Egret Swarm Optimization Algorithm with mixed multi-strategy for system evaluation

Author

Listed:
  • Peng, Weishi
  • Wu, Runze
  • Wang, Yu
  • Wang, Jingyi

Abstract

To address the inherent limitations of the conventional Egret Swarm Optimization Algorithm (ESOA), this study proposes an enhanced variant, namely the improved egret swarm optimization algorithm (IESOA), which integrates a hybrid multi-strategy framework. Initially, the piecewise chaotic mapping is employed for population initialization. This approach enables a more flexible distribution of egret individuals within the initial solution space, thereby enhancing population diversity and mitigating the risk of the algorithm converging to local optima. Subsequently, an adaptive T-distribution method is introduced to update the hunting positions of egret squads. This modification strengthens the algorithms capability to escape local optima and improves its global search performance. Furthermore, a sine–cosine strategy is incorporated to dynamically adjust the search direction and control step size variations during the optimization process, which significantly accelerates the convergence speed. Experimental results demonstrate that IESOA exhibits robust performance in escaping local optima, achieves rapid convergence, and maintains relatively high optimization accuracy.

Suggested Citation

  • Peng, Weishi & Wu, Runze & Wang, Yu & Wang, Jingyi, 2026. "Improved Egret Swarm Optimization Algorithm with mixed multi-strategy for system evaluation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 243(C), pages 362-381.
  • Handle: RePEc:eee:matcom:v:243:y:2026:i:c:p:362-381
    DOI: 10.1016/j.matcom.2025.11.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425004902
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.11.025?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:matcom:v:243:y:2026:i:c:p:362-381. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.