مشخصات پژوهش

صفحه نخست /An improved gazelle ...
عنوان
An improved gazelle optimization algorithm using dynamic opposition‑based learning and chaotic mapping combination for solving optimization problems
نوع پژوهش مقاله چاپ شده
کلیدواژه‌ها
Dynamic opposition-based learning, Gazelle optimization algorithm, Dynamic chaotic local search, Metaheuristic algorithm, Hit rate
چکیده
The gazelle optimization algorithm (GOA) is an iterative optimization method inspired by the agile movements of gazelles, employing adaptive step sizes and velocity adjustments for rapid convergence in continuous search spaces. However, GOA tends to lack diversity, leading to issues like local minima trapping and premature convergence. This paper addresses these limitations by introducing dynamic opposition-based learning (OBL) and incorporating a balanced sine-control-logistic chaotic mapping system, resulting in the improved GOA (IGOA). Dynamic OBL accelerates the search process, improving learning and selecting superior candidate solutions, while chaotic mapping in chaotic local search widens ranges for exploration and local optima escape. Evaluating IGOA against seven algorithms, including GOA and others, across 31 general test functions, the results consistently showcase IGOA’s superior efficiency in achieving solutions closest to optima, early convergence, and hit rate when compared to alternative algorithms.
پژوهشگران عطیه عبداله پورازاد (نفر اول)، علیرضا روحی (نفر دوم)، عین اله پیرا (نفر سوم)