Ringed Seal Search for Global Optimization via a Sensitive Search Model.

• Main Authors: Saadi, Younes, Herawan, Tutut, Balakrishnan, Vimala, Risnumawan, Anhar, Tri Riyadi Yanto, Iwan, Chiroma, Haruna
• Format: Course Material
• Language: English
• Published: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0144371 2018
• Subjects: QA75 Electronic computers. Computer science; ringed seal
• Online Access: http://eprints.uad.ac.id/11647/; http://eprints.uad.ac.id/11647/1/Ringed%20Seal%20Search%20for%20Global%20Optimization%20via%20a%20Sensitive%20Search%20Model.pdf

The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behav-ior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emit-ted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and valida-tions were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of conver-gence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global optimization problems.