Abstract
This paper proposes Komodo Mlipir Algorithm (KMA) as a new metaheuristic optimizer. It is inspired by two phenomena: the behavior of Komodo dragons living in the East Nusa Tenggara, Indonesia, and the Javanese gait named mlipir. Adopted the foraging and reproduction of Komodo dragons, the population of a few Komodo individuals (candidate solutions) in KMA are split into three groups based on their qualities: big males, female, and small males. First, the high-quality big males do a novel movement called high-exploitation low-exploration to produce better solutions. Next, the middle-quality female generates a better solution by either mating the highest-quality big male (exploitation) or doing parthenogenesis (exploration). Finally, the low-quality small males diversify candidate solutions using a novel movement called mlipir (a Javanese term defined as a walk on the side of the road to reach a particular destination safely), which is implemented by following the big males in a part of their dimensions. A self-adaptation of the population is also proposed to control the exploitation–exploration balance. An examination using the well-documented twenty-three benchmark functions shows that KMA outperforms the recent metaheuristic algorithms. Besides, it provides high scalability to optimize thousand-dimensional functions. The source code of KMA is publicly available at: https://suyanto.staff.telkomuniversity.ac.id/komodo-mlipir-algorithm and https://www.mathworks.com/matlabcentral/fileexchange/102514-komodo-mlipir-algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.