Abstract
This paper introduces a modification of the recently developed Adaptive Gaining Sharing Knowledge (AGSK) algorithm. The AGSK algorithm simulates the process of human gaining and sharing knowledge using two main phases to solve optimization problems: junior and senior. AGSK’s efficiency was proved; however, there are still various approaches that can be used to improve its workability. In this study a new technique for generating potential solutions for the AGSK algorithm is proposed. 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. At first, the size of the external archive was fixed, but later in order to improve the performance of AGSK, a reduction technique was applied to decrease its size during the optimization process. Moreover, three different approaches were used to update the external archive after each algorithm’s iteration. The modified algorithm (as well as its original variant) was evaluated on a set of test functions taken from the CEC 2021 competition. The obtained experimental results are presented and compared. It was established that the proposed modification of the AGSK algorithm allows finding better solutions with the same computational effort. Thus, proposed position adaptation technique’s usefulness was demonstrated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kumar, S., Chauhan, E.A.: A survey on image feature selection techniques. Int. J. Comput. Sci. Inf. Technol. 5(5), 6449–6452 (2014)
Yoshida, M., et al.: Using evolutionary algorithms and machine learning to explore sequence space for the discovery of antimicrobial peptides. Chem 4(3), 533–543 (2018)
Schmitt, L.M.: Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theoret. Comput. Sci. 310(1–3), 181–231 (2004)
Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1997)
Mohamed, A.W., Hadi, A.A., Mohamed, A.K.: Gaining-sharing knowledge based algorithm for solving optimization problems: a novel nature-inspired algorithm. Int. J. Mach. Learn. Cybern. 11(7), 1501–1529 (2019). https://doi.org/10.1007/s13042-019-01053-x
Mohamed, A.W., Hadi, A.A., Mohamed, A.K., Awad, N.H.: Evaluating the performance of adaptive gaining sharing knowledge based algorithm on CEC 2020 benchmark problems. In: 2020 IEEE Congress on Evolutionary Computation, pp. 1–8 (2020)
Črepinšek, M., Liu, S., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45(3), Article no. 35 (2013)
Zhang, J., Sanderson, A.: JADE: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945–958 (2009)
Akhmedova, S., Stanovov, V., Semenkin, E.: Success-history based position adaptation in co-operation of biology related algorithms. In: Tan, Y., Shi, Y., Niu, B. (eds.) ICSI 2019. LNCS, vol. 11655, pp. 39–49. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26369-0_4
Mohamed, A.W., Hadi, A.A., Mohamed, A.K., Agrawal, P., Kumar, A., Suganthan P.N.: Problem definitions and evaluation criteria for the CEC 2021 special session and competition on single objective bound constrained numerical optimization. Technical report. https://github.com/P-N-Suganthan/2021-SO-BCO. Accessed 18 Apr 2021
Acknowledgments
This research was funded by the Council for grants of the President of the Russian Federation for young researchers, grant number MK-1579.2020.9 in 2020–2022.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Akhmedova, S., Stanovov, V. (2021). Success-History Based Position Adaptation in Gaining-Sharing Knowledge Based Algorithm. In: Tan, Y., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2021. Lecture Notes in Computer Science(), vol 12689. Springer, Cham. https://doi.org/10.1007/978-3-030-78743-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-78743-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-78742-4
Online ISBN: 978-3-030-78743-1
eBook Packages: Computer ScienceComputer Science (R0)