{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:39Z","timestamp":1770906279656,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Genetic Algorithms are stochastic optimization methods where solution candidates, complying to a specific problem representation, are evaluated according to a predefined fitness function. These approaches can provide solutions in various tasks even, where analytic solutions can not be or are too complex to be computed. In this paper we will show, how certain set of problems are partially solvable allowing us to grade segments of a solution individually, which results local and individual tuning of mutation parameters for genes. We will demonstrate the efficiency of our method on the N-Queens and travelling salesman problems where we can demonstrate that our approach always results faster convergence and in most cases a lower error than the traditional approach.<\/jats:p>","DOI":"10.3390\/a14010016","type":"journal-article","created":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T19:55:56Z","timestamp":1610308556000},"page":"16","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Adaptive Gene Level Mutation"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3111-5559","authenticated-orcid":false,"given":"Jalal","family":"Al-Afandi","sequence":"first","affiliation":[{"name":"Faculty of Information Technology and Bionics, P\u00e1zm\u00e1ny P\u00e9ter Catholic University, 1083 Budapest, Hungary"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5855-4186","authenticated-orcid":false,"given":"Andr\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology and Bionics, P\u00e1zm\u00e1ny P\u00e9ter Catholic University, 1083 Budapest, Hungary"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"key":"ref_1","first-page":"109","article-title":"A quantum-inspired evolutionary algorithm for multiobjective image segmentation","volume":"1","author":"Talbi","year":"2007","journal-title":"Int. J. Math. Phys. Eng. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","article-title":"Evolutionary optimization in uncertain environments-a survey","volume":"9","author":"Jin","year":"2005","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.artmed.2007.07.010","article-title":"A multi-approaches-guided genetic algorithm with application to operon prediction","volume":"41","author":"Wang","year":"2007","journal-title":"Artif. Intell. Med."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Krawiec, K., and Pawlak, M. (2015, January 8\u201310). Genetic programming with alternative search drivers for detection of retinal blood vessels. Proceedings of the European Conference on the Applications of Evolutionary Computation, Copenhagen, Denmark.","DOI":"10.1007\/978-3-319-16549-3_45"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1111\/j.1539-6924.2008.01160.x","article-title":"Reducing risk through real options in systems design: The case of architecting a maritime domain protection system","volume":"29","author":"Buurman","year":"2009","journal-title":"Risk Anal. Int. J."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.dss.2010.12.001","article-title":"An evolutionary real options framework for the design and management of projects and systems with complex real options and exercising conditions","volume":"51","author":"Zhang","year":"2011","journal-title":"Decis. Support Syst."},{"key":"ref_7","unstructured":"Milone, D.H., Merelo, J.J., and Rufiner, H. (2002, January 12\u201317). Evolutionary algorithm for speech segmentation. Proceedings of the 2002 Congress on Evolutionary Computation, CEC\u201902 (Cat. No. 02TH8600), Honolulu, HI, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/CEC.2000.870304","article-title":"Evolutionary artificial potential fields and their application in real time robot path planning","volume":"Volume 1","author":"Vadakkepat","year":"2000","journal-title":"Proceedings of the 2000 congress on evolutionary computation, CEC00 (Cat. No. 00TH8512)"},{"key":"ref_9","unstructured":"Pan, X., Zhang, J., and Szeto, K.Y. (2005, January 13\u201315). Application of Mutation Only Genetic Algorithm for the Extraction of Investment Strategy in Financial Time Series. Proceedings of the 2005 International Conference on Neural Networks and Brain, Beijing, China."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Corus, D., and Oliveto, P.S. (2017). Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms. arXiv.","DOI":"10.1145\/3205651.3208214"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Berger-Tal, O., Nathan, J., Meron, E., and Saltz, D. (2014). The exploration-exploitation dilemma: A multidisciplinary framework. PLoS ONE, 9.","DOI":"10.1371\/journal.pone.0095693"},{"key":"ref_12","unstructured":"Abdoun, O., Abouchabaka, J., and Tajani, C. (2012). Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-69432-8_2","article-title":"Parameter Control in Evolutionary Algorithms","volume":"Volume 54","author":"Lobo","year":"2007","journal-title":"Parameter Setting in Evolutionary Algorithms"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Case, B., and Lehre, P.K. (2020). Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure. arXiv.","DOI":"10.1109\/TEVC.2020.2985450"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/72.363438","article-title":"Gradient descent learning algorithm overview: A general dynamical systems perspective","volume":"6","author":"Baldi","year":"1995","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_16","unstructured":"Ma, Y.A., Chen, Y., Jin, C., Flammarion, N., and Jordan, M.I. (2018). Sampling Can Be Faster Than Optimization. arXiv."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Bottou, L. (2010, January 22\u201327). Large-scale machine learning with stochastic gradient descent. Proceedings of the COMPSTAT\u20192010, Paris, France.","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref_18","unstructured":"Kingma, D.P., and Ba, J. (2014). Adam: A method for stochastic optimization. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Young, S.R., Rose, D.C., Karnowski, T.P., Lim, S.H., and Patton, R.M. (2015, January 15\u201320). Optimizing deep learning hyper-parameters through an evolutionary algorithm. Proceedings of the Workshop on Machine Learning in High-Performance Computing Environments, Austin, TX, USA.","DOI":"10.1145\/2834892.2834896"},{"key":"ref_20","unstructured":"Such, F.P., Madhavan, V., Conti, E., Lehman, J., Stanley, K.O., and Clune, J. (2017). Deep neuroevolution: Genetic algorithms are a competitive alternative for training deep neural networks for reinforcement learning. arXiv."},{"key":"ref_21","first-page":"1848","article-title":"Proposal of 8-queens problem","volume":"3","author":"Bezzel","year":"1848","journal-title":"Berl. Schachzeitung"},{"key":"ref_22","first-page":"376","article-title":"Solving Travelling Salesman Problem Using Genetic Algorithm","volume":"3","author":"Gupta","year":"2013","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multidimensional knapsack problem","volume":"4","author":"Chu","year":"1998","journal-title":"J. Heuristics"},{"key":"ref_24","unstructured":"Korejo, I., and Yang, S. (2009, January 13\u201316). A Comparative Study of Adaptive Mutation Operators for Genetic Algorithms. Proceedings of the 8th Metaheuristic International Conference, Hamburg, Germany."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Jeong, I.K., and Lee, J.J. (1996). Adaptive Simulated Annealing Genetic Algorithm for System Identification. Eng. Appl. Artif. Intell., 9.","DOI":"10.1016\/0952-1976(96)00049-8"},{"key":"ref_26","unstructured":"Hinterding, R. (December, January 29). Gaussian Mutation and Self-Adaptation for Numeric Genetic Algorithms. Proceedings of the 1995 IEEE International Conference on Evolutionary Computation, Perth, WA, Australia."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TEVC.2003.816583","article-title":"Evolutionary Programming Using Mutations Based on the L\u00c9vy Probability Distribution","volume":"8","author":"Lee","year":"2004","journal-title":"Evol. Comput. IEEE Trans."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1009642825198","article-title":"Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms","volume":"6","author":"Hong","year":"2000","journal-title":"J. Heuristics"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TCYB.2015.2399478","article-title":"Self-adaptive differential evolution algorithm with zoning evolution of control parameters and adaptive mutation strategies","volume":"46","author":"Fan","year":"2015","journal-title":"IEEE Trans. Cybern."},{"key":"ref_30","unstructured":"Li, C., Yang, S., and Korejo, I. (2021, January 09). An Adaptive Mutation Operator for Particle Swarm Optimization. Available online: https:\/\/bura.brunel.ac.uk\/handle\/2438\/5884."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Yang, S. (2004, January 13\u201315). Adaptive Mutation Using Statistics Mechanism for Genetic Algorithms. Proceedings of the International Conference on Innovative Techniques and Applications of Artificial Intelligence, Cambridge, UK.","DOI":"10.1007\/978-0-85729-412-8_2"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Yang, S., and Etaner-Uyar, A. (2006, January 23\u201327). Adaptive mutation with fitness and allele distribution correlation for genetic algorithms. Proceedings of the 2006 ACM Symposium on Applied Computing, Dijon, France.","DOI":"10.1145\/1141277.1141499"},{"key":"ref_33","unstructured":"Sarkar, U., and Nag, S. (2018). An Adaptive Genetic Algorithm for Solving N-Queens Problem. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"7430125","DOI":"10.1155\/2017\/7430125","article-title":"Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator","volume":"2017","author":"Hussain","year":"2017","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_35","first-page":"4669","article-title":"Comparison and analysis of different mutation strategies to improve the performance of genetic algorithm","volume":"5","author":"Patil","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1712630","DOI":"10.1155\/2016\/1712630","article-title":"List-based simulated annealing algorithm for traveling salesman problem","volume":"2016","author":"Zhan","year":"2016","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","article-title":"Improving variable neighborhood search to solve the traveling salesman problem","volume":"68","author":"Hore","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Xu, D., Weise, T., Wu, Y., L\u00e4ssig, J., and Chiong, R. (2015, January 25\u201328). An investigation of hybrid tabu search for the traveling salesman problem. Proceedings of the Bio-Inspired Computing-Theories and Applications, Hefei, China.","DOI":"10.1007\/978-3-662-49014-3_47"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, M.A., and Burtscher, M. (2015, January 7\u20138). Rethinking the parallelization of random-restart hill climbing: A case study in optimizing a 2-opt TSP solver for GPU execution. Proceedings of the 8th Workshop on General Purpose Processing Using GPUs, San Francisco, CA, USA.","DOI":"10.1145\/2716282.2716287"},{"key":"ref_40","unstructured":"Dawkins, R. (1989). The Selfish Gene, Oxford University Press."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/1\/16\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:09:11Z","timestamp":1760159351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/1\/16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1]]}},"alternative-id":["a14010016"],"URL":"https:\/\/doi.org\/10.3390\/a14010016","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,9]]}}}