This technique uses a historical memory of successful positions found by individuals stored in the external archive to guide those individuals in different directions and thus to improve the exploration and exploitation abilities of the AGSK algorithm.
Jul 7, 2021
Jul 17, 2021 · This paper introduces a modification of the recently developed Adaptive Gaining Sharing Knowledge (AGSK) algorithm.
This paper introduces a modification of the recently developed Adaptive Gaining Sharing Knowledge (AGSK) algorithm. The AGSK algorithm simulates the process ...
This technique uses a historical memory of successful positions found by individuals stored in the external archive to guide those individuals in different ...
Evaluating the Performance of Adaptive Gaining- Sharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems ... Success-History based parameter adaptation ...
Apr 30, 2021 · Tanabe and Fukunaga [26] proposed a success-history based parameter adaptation for DE (SHADE). By establishing new historical storages Mcr ...
This paper presents a modification of the recently proposed Gaining–Sharing Knowledge (GSK)-based algorithm and applies it to optimize resource scheduling in ...
Missing: History | Show results with:History
Jul 10, 2024 · A dynamic Harris hawks optimizer based on historical information and tournament strategy (DHHO-HITS) is proposed in this paper.
In this study, a new technique for generating potential solutions in biology-inspired algorithms is proposed. This technique uses a historical memory of ...
Feb 25, 2022 · An improved binary gaining–sharing knowledge-based algorithm (IBGSK) with mutation is proposed to effectively solve this challenging binary optimization ...