Adolescent Identity Search Algorithm (AISA): A novel metaheuristic approach for solving optimization problems

This paper proposes a novel population-based metaheuristic optimization algorithm, called Adolescent Identity Search Algorithm (AISA), which is inspired by the process of identity development/search of adolescents. AISA simulates the identity formation behavior of adolescents in the peer group. This behavior is modeled mathematically to solve optimization problems. The proposed algorithm is evaluated on thirty-nine well-known unimodal, multimodal, fixed-dimensional multimodal, composite and CEC 2019 benchmark functions to test exploration, exploitation, local optima avoidance, and convergence properties. The results are verified by an extensive comparative study with thirteen state-of-art metaheuristic algorithms. Furthermore, AISA has been used to solve IIR system identification and inverse kinematics problem of a seven Degrees Of Freedom (7-DOF) robot manipulator considered as the real-life engineering applications. The overall optimization results demonstrate that AISA possesses a strong and robust capability to produce superior performance over other competitor metaheuristic algorithms in solving various complex numerical optimization problems. © 2020 Elsevier B.V.