Author
Abstract
Multi-modal optimization assists academics, engineers, scientists and decision-makers to solve complex situations by evaluating several outcomes and configurations. The Flamingo Search Algorithm (FSA) is a relatively recent optimisation approach. The migratory and foraging habits of flamingos serve as the inspiration for this swarm intelligent algorithm. Uni-modal FSA provides a global solution to optimal design in different research areas of the optimization problems. This paper presents the multi-modal variant of the Flamingo Search Algorithm named MMFSA. The algorithm uses three clustering as niching methods to improve search. However due to randomness, the exploitation capabilities in vicinity area maybe limited. MMFSA addresses this issue. In MMFSA, best solutions obtained from each cluster are further improved using a self-augmentation process. The MMFSA’s efficiency and efficacy are confirmed by extensive multi-modal benchmark functions testing. Success rate, average optima identified, maximum peak ratio, functions evaluation and optima success performance measure algorithm efficacy. Comparison results of MMFSA with contemporary multi-modal algorithms reveal that MMFSA outperforms other multi-modal optimization algorithms. MMFSA is able to provide 95% accuracy for the obtained solutions. Proposed MMFSA also affirms its superiority for various performance metrics over multi-modal benchmark functions.
Suggested Citation
Seema & Shikha Mehta & Hema Banati, 2025.
"Multi-modal Flamingo Search Algorithm (MMFSA),"
International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 16(7), pages 2480-2494, July.
Handle:
RePEc:spr:ijsaem:v:16:y:2025:i:7:d:10.1007_s13198-025-02807-3
DOI: 10.1007/s13198-025-02807-3
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
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:ijsaem:v:16:y:2025:i:7:d:10.1007_s13198-025-02807-3. 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: 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.