Enhanced Krill Herd Algorithm Using Shuffled Frog Leaping and Meme Grouping for Multi-Objective Optimization Problems
Abstract
To solve the low performance problem of krill herd algorithm in the face of multi-modal optimization problems, this study proposes an improved krill herd algorithm based on a hybrid frog leaping algorithm and meme grouping method. This study analyzes the global optimization and local distribution behavior characteristics of the krill herd algorithm. Then, combined with the hybrid frog leaping algorithm, the krill individuals are optimized through meme grouping to enhance the algorithm's global and local search capabilities. This study conducted MATLAB simulation experiments to test the Schaffer function and Griebank function, and compared the results with traditional krill herd algorithms. The results showed that the improved algorithm began to converge in the search of Schaffer and Griebank functions at the 32nd and 68th iterations, and basically completed convergence at the 64th and 130th iterations, with minimum errors of 3% and 5%, respectively. The minimum errors of traditional krill herd algorithms were 5% and 8%. This study further validated the algorithm through logistics scheduling and showed that the optimized algorithm shortened the completion time of scheduling tasks by 3 hours and reduced costs by 13,500 yuan. Research has shown that the proposed method performs outstandingly in improving global optimization capability and computational efficiency, and has practical application value.DOI:
https://doi.org/10.31449/inf.v48i23.6786Downloads
Published
How to Cite
Issue
Section
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.







