{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:14:39Z","timestamp":1784268879098,"version":"3.55.0"},"reference-count":115,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Genetic algorithm (GA) is an artificial intelligence search method that uses the process of evolution and natural selection theory and is under the umbrella of evolutionary computing algorithm. It is an efficient tool for solving optimization problems. Integration among (GA) parameters is vital for successful (GA) search. Such parameters include mutation and crossover rates in addition to population that are important issues in (GA). However, each operator of GA has a special and different influence. The impact of these factors is influenced by their probabilities; it is difficult to predefine specific ratios for each parameter, particularly, mutation and crossover operators. This paper reviews various methods for choosing mutation and crossover ratios in GAs. Next, we define new deterministic control approaches for crossover and mutation rates, namely Dynamic Decreasing of high mutation ratio\/dynamic increasing of low crossover ratio (DHM\/ILC), and Dynamic Increasing of Low Mutation\/Dynamic Decreasing of High Crossover (ILM\/DHC). The dynamic nature of the proposed methods allows the ratios of both crossover and mutation operators to be changed linearly during the search progress, where (DHM\/ILC) starts with 100% ratio for mutations, and 0% for crossovers. Both mutation and crossover ratios start to decrease and increase, respectively. By the end of the search process, the ratios will be 0% for mutations and 100% for crossovers. (ILM\/DHC) worked the same but the other way around. The proposed approach was compared with two parameters tuning methods (predefined), namely fifty-fifty crossover\/mutation ratios, and the most common approach that uses static ratios such as (0.03) mutation rates and (0.9) crossover rates. The experiments were conducted on ten Traveling Salesman Problems (TSP). The experiments showed the effectiveness of the proposed (DHM\/ILC) when dealing with small population size, while the proposed (ILM\/DHC) was found to be more effective when using large population size. In fact, both proposed dynamic methods outperformed the predefined methods compared in most cases tested.<\/jats:p>","DOI":"10.3390\/info10120390","type":"journal-article","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T10:52:41Z","timestamp":1575975161000},"page":"390","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":593,"title":["Choosing Mutation and Crossover Ratios for Genetic Algorithms\u2014A Review with a New Dynamic Approach"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9991-304X","authenticated-orcid":false,"given":"Ahmad","family":"Hassanat","sequence":"first","affiliation":[{"name":"Computer Science Department, Community College, University of Tabuk, Tabuk 71491, Saudi Arabia"},{"name":"Computer Science Department, Mutah University, Karak 61711, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khalid","family":"Almohammadi","sequence":"additional","affiliation":[{"name":"Computer Science Department, Community College, University of Tabuk, Tabuk 71491, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9525-1459","authenticated-orcid":false,"given":"Esra\u2019a","family":"Alkafaween","sequence":"additional","affiliation":[{"name":"Computer Science Department, Mutah University, Karak 61711, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eman","family":"Abunawas","sequence":"additional","affiliation":[{"name":"Computer Science Department, Mutah University, Karak 61711, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Awni","family":"Hammouri","sequence":"additional","affiliation":[{"name":"Computer Science Department, Mutah University, Karak 61711, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-7453","authenticated-orcid":false,"given":"V. B. Surya","family":"Prasath","sequence":"additional","affiliation":[{"name":"Division of Biomedical Informatics, Cincinnati Children\u2019s Hospital Medical Center, OH 45229, USA"},{"name":"Department of Pediatrics, University of Cincinnati College of Medicine, Cincinnati, OH 45267, USA"},{"name":"Department of Biomedical Informatics, College of Medicine, University of Cincinnati, OH 45267, USA"},{"name":"Department of Electrical Engineering and Computer Science, University of Cincinnati, OH 45221, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"ref_1","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, MIT Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/41.538609","article-title":"Genetic algorithms: Concepts and applications","volume":"43","author":"Man","year":"1996","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref_3","unstructured":"Golberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00175354","article-title":"A genetic algorithm tutorial","volume":"4","author":"Whitley","year":"1994","journal-title":"Stat. Comput."},{"key":"ref_5","first-page":"58","article-title":"A genetic algorithm for projective invariant object recognition","volume":"1","author":"Tsang","year":"1996","journal-title":"IEEE TENCON Digit. Signal Process. Appl."},{"key":"ref_6","first-page":"1323","article-title":"Optimal routing in ad-hoc network using genetic algorithm","volume":"03","author":"Mohammed","year":"2012","journal-title":"Int. J. Adv. Netw. Appl."},{"key":"ref_7","first-page":"87","article-title":"Application of genetic algorithm in software testing","volume":"3","author":"Srivastava","year":"2009","journal-title":"Int. J. Softw. Eng. Its Appl."},{"key":"ref_8","first-page":"278","article-title":"A survey of genetic algorithms applications for image enhancement and segmentation","volume":"36","author":"Paulinas","year":"2015","journal-title":"Inf. Technol. Control"},{"key":"ref_9","first-page":"3","article-title":"A HybridWavelet-Shearlet Approach to Robust Digital ImageWatermarking","volume":"41","author":"Hassanat","year":"2017","journal-title":"Informatica"},{"key":"ref_10","unstructured":"Benkhellat, Z., and Belmehdi, A. (2012, January 3\u20136). Genetic algorithms in speech recognition systems. Proceedings of the International Conference on Industrial Engineering and Operations Management, Istanbul, Turkey."},{"key":"ref_11","first-page":"363","article-title":"Speech feature extraction and recognition using genetic algorithm","volume":"4","author":"Gupta","year":"2014","journal-title":"Int. J. Emerg."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3390\/jsan4040293","article-title":"On optimal multi-sensor network configuration for 3D registration","volume":"4","author":"Aliakbarpour","year":"2015","journal-title":"J. Sens. Actuator Netw."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.aci.2017.12.003","article-title":"EELAM: Energy efficient lifetime aware multicast route selection for mobile ad hoc networks","volume":"15","author":"Papanna","year":"2019","journal-title":"Appl. Comput. Inform."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.aci.2017.05.005","article-title":"Genetic-neuro-fuzzy system for grading depression","volume":"14","author":"Ashish","year":"2018","journal-title":"Appl. Comput. Inform."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.aci.2015.06.001","article-title":"A Genetic-Neuro-Fuzzy inferential model for diagnosis of tuberculosis","volume":"13","author":"Omisore","year":"2017","journal-title":"Appl. Comput. Inform."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"20","DOI":"10.4018\/IJGCMS.2018070102","article-title":"On Computerizing the Ancient Game of t\u0101b","volume":"10","author":"Hassanat","year":"2018","journal-title":"Int. J. Gaming Comput.-Mediat. Simul. (IJGCMS)"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Guo, K., Yang, M., and Zhu, H. (2019). Application research of improved genetic algorithm based on machine learning in production scheduling. Neural Computing and Applications, Springer.","DOI":"10.1007\/s00521-019-04571-5"},{"key":"ref_18","first-page":"1","article-title":"Cost-Optimization Problem with a Soft Time Window Based on an Improved Fuzzy Genetic Algorithm for Fresh Food Distribution","volume":"2018","author":"Wang","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_19","unstructured":"Hendricks, D., Wilcox, D., and Gebbie, T. (2014). High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1142\/S1469026803000987","article-title":"Optimization of production systems using genetic algorithms","volume":"3","author":"Mustafa","year":"2003","journal-title":"Int. J. Comput. Intell. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2003). Introduction to Evolutionary Computing, Springer.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref_22","unstructured":"Zhong, J., Hu, X., Gu, M., and Zhang, J. (2005, January 28\u201330). Comparison of performance between different selection strategies on simple genetic algorithms. Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906), Vienna, Austria."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Michalewicz, Z., Schoenauer, M., and Smith, J.E. (2007). Parameter control in evolutionary algorithms. Parameter Setting in Evolutionary Algorithms, Springer.","DOI":"10.1007\/978-3-540-69432-8_2"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1109\/ICSMC.1996.565436","article-title":"A dynamic mutation genetic algorithm","volume":"3","author":"Hong","year":"1996","journal-title":"IEEE Int. Conf. Syst. Man, Cybern."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Gen, M., and Runwei, C. (2000). Genetic Algorithms and Engineering Optimization, Wiley.","DOI":"10.1002\/9780470172261"},{"key":"ref_26","first-page":"265","article-title":"Understanding interactions among genetic algorithm parameters","volume":"5","author":"Deb","year":"1999","journal-title":"Found. Genet. Algorithms"},{"key":"ref_27","first-page":"57","article-title":"Genetic Optimization of Artificial Neural Networks to Forecast Virioplankton Abundance from Cytometric Data","volume":"5","author":"Pereira","year":"2013","journal-title":"J. Intell. Learn. Syst. Appl."},{"key":"ref_28","first-page":"214","article-title":"Novel encoding scheme in genetic algorithms for better fitness","volume":"1","author":"Kumar","year":"2012","journal-title":"Int. J. Eng. Adv. Technol."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Shyr, W.J. (2010). Parameters Determination for Optimum Design by Evolutionary Algorithm, IntechOpen.","DOI":"10.5772\/9638"},{"key":"ref_30","unstructured":"Alkafaween, E.O. (2015). Novel Methods for Enhancing the Performance of Genetic Algorithms. [Master\u2019s Thesis, Mu\u2019tah University]."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Shukla, A., Pandey, H.M., and Mehrotra, D. (2015, January 25\u201327). Comparative review of selection techniques in genetic algorithm. Proceedings of the International Conference on Futuristic Trends on Computational Analysis and Knowledge Management, Noida, India.","DOI":"10.1109\/ABLAZE.2015.7154916"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","article-title":"Optimization of control parameters for genetic algorithms","volume":"16","author":"Grefenstette","year":"1986","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_33","unstructured":"Razali, N.M., and Geraghty, J. (2011, January 6\u20138). Genetic algorithm performance with different selection strategies in solving TSP. Proceedings of the world congress on engineering, London, UK."},{"key":"ref_34","first-page":"5","article-title":"Genetic algorithm performance with different selection methods in solving multi-objective network design problem","volume":"70","author":"Oladele","year":"2013","journal-title":"Int. J. Comput. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T. (1996). Evolutionary Algorithms in Theory and Practice, Oxford University Press.","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.physa.2011.12.004","article-title":"Roulette-wheel selection via stochastic acceptance","volume":"391","author":"Lipowski","year":"2012","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"Srinivas","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_38","unstructured":"Obitko, M. (1998). Introduction to Genetic Algorithms, Czech Technical University."},{"key":"ref_39","unstructured":"Kaya, Y., and Uyar, M. (2011). A novel crossover operator for genetic algorithms: Ring crossover. arXiv."},{"key":"ref_40","first-page":"199","article-title":"Genetic Algorithm\u2014An Approach to Solve Global Optimization","volume":"1","author":"Bajpai","year":"2010","journal-title":"Indian J. Comput. Sci. Eng."},{"key":"ref_41","first-page":"19","article-title":"Multi-population methods with adaptive mutation for multi-modal optimization problems","volume":"2","author":"Korejo","year":"2013","journal-title":"Int. J. Soft Comput. Artif. Intell. Appl."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Safe, M., Carballido, J., Ponzoni, I., and Brignole, N. (2004). On stopping criteria for genetic algorithms. Brazilian Symposium on Artificial Intelligence, Springer.","DOI":"10.1007\/978-3-540-28645-5_41"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01530777","article-title":"A formal analysis of the role of multi-point crossover","volume":"5","author":"Spears","year":"1992","journal-title":"Ann. Math. Artif. Intell."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.tig.2010.05.003","article-title":"Evolution of the mutation rate","volume":"26","author":"Lynch","year":"2010","journal-title":"Trends Genet."},{"key":"ref_45","unstructured":"Roeva, O., Fidanova, S., and Paprzycki, M. (2013, January 8\u201311). Influence of the population size on the genetic algorithm performance in case of cultivation process modelling. Proceedings of the IEEE Conference on Computer Science and Information Systems, Krak\u00f3w, Poland."},{"key":"ref_46","unstructured":"Tuson, A.L., and Ross, P. (1995). Adapting Operator Probabilities in Genetic Algorithms. [Master\u2019s Thesis, Department of Artificial Intelligence]."},{"key":"ref_47","unstructured":"Davis, L. (1991). Handbook of Genetic Algorithms, Van Nostrand Reinhold Co."},{"key":"ref_48","first-page":"83","article-title":"Genetic programming: The ratio of crossover to mutation as a function of time","volume":"6","author":"Munroe","year":"2004","journal-title":"Res. Lett. Inf. Math. Sci."},{"key":"ref_49","unstructured":"Bernard, T. (2016). Modeling, Control and Optimization of Water System, Springer."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","article-title":"Parameter control in evolutionary algorithms","volume":"3","author":"Eiben","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_51","first-page":"56","article-title":"An overview of genetic algorithms: Part 1 Fundamentals","volume":"15","author":"Beasley","year":"1993","journal-title":"Univ. Comput."},{"key":"ref_52","first-page":"170","article-title":"An overview of genetic algorithms: Part 2 Research topics","volume":"15","author":"Beasley","year":"1993","journal-title":"Univ. Comput."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.294849","article-title":"Genetic algorithms: A survey","volume":"27","author":"Srinivas","year":"1994","journal-title":"Computer"},{"key":"ref_54","unstructured":"DeJong, K. (1975). Analysis of the Behavior of a Class of Genetic Adaptive. [Ph.D. Thesis, University of Michigan]."},{"key":"ref_55","unstructured":"Schlierkamp-Voosen, D. (1993). Optimal interaction of mutation and crossover in the breeder genetic algorithm. International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1012815625611","article-title":"Evolution of appropriate crossover and mutation operators in a genetic process","volume":"16","author":"Hong","year":"2002","journal-title":"Appl. Intell."},{"key":"ref_57","unstructured":"Pelikan, M., Goldberg, D.E., and Cant\u00fa-Paz, E. (2000, January 10\u201312). Bayesian optimization algorithm, population sizing, and time to convergence. Proceedings of the Annual Conference on Genetic and Evolutionary Computation, Las Vegas, NV, USA."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Piszcz, A., and Soule, T. (2006, January 8\u201312). Genetic programming: Optimal population sizes for varying complexity problems. Proceedings of the Annual Conference on Genetic and Evolutionary Computation, Seattle, WA, USA.","DOI":"10.1145\/1143997.1144166"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TEVC.2005.860765","article-title":"A sawtooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance","volume":"10","author":"Katsaras","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2003.03.029","article-title":"The parameterless genetic algorithm in practice","volume":"167","author":"Lobo","year":"2004","journal-title":"Inf. Sci."},{"key":"ref_61","first-page":"900","article-title":"Optimal population size and the genetic algorithm","volume":"100","author":"Gotshall","year":"2002","journal-title":"Population"},{"key":"ref_62","unstructured":"Diaz-Gomez, P.A., and Hougen, D.F. (2007). Initial population for genetic algorithms: A metric approach. GEM, 43\u201349. Available online: http:\/\/www.cameron.edu\/ pdiaz-go\/GAsPopMetric.pdf."},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Dong, M., and Wu, Y. (2009). Dynamic crossover and mutation genetic algorithm based on expansion sampling. International Conference on Artificial Intelligence and Computational Intelligence, Springer.","DOI":"10.1007\/978-3-642-05253-8_16"},{"key":"ref_64","first-page":"1","article-title":"Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review","volume":"7","author":"Hassanat","year":"2019","journal-title":"Big Data"},{"key":"ref_65","unstructured":"Chiroma, H., Abdulkareem, S., Abubakar, A., Zeki, A., Gital, A.Y., and Usman, M.J. (2013, January 6\u20137). Correlation study of genetic algorithm operators: Crossover and mutation probabilities. Proceedings of the International Symposium on Mathematical Sciences and Computing Research, Ipoh City, Malaysia."},{"key":"ref_66","unstructured":"Huang, Y., and Shi, K. (1996, January 14\u201317). Genetic algorithms in the identification of fuzzy compensation system. Proceedings of the 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929), Beijing, China."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1109\/3477.485836","article-title":"Hybrid methods using genetic algorithms for global optimization","volume":"26","author":"Renders","year":"1996","journal-title":"IEEE Trans. Syst. Man, Cybern. Part B Cybern."},{"key":"ref_68","unstructured":"Vavak, F., and Fogarty, C. (1996, January 20\u201322). Comparison of steady state and generational genetic algorithms for use in nonstationary environments. Proceedings of the IEEE International Conference on Evolutionary Computation, Nagoya, Japan."},{"key":"ref_69","unstructured":"Chaiyaratana, N., and Zalzala, A. (1999, January 6\u20139). Hybridisation of neural networks and genetic algorithms for time-optimal control. Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Washington, DC, USA."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Man, F.K., Tang, S.K., and Kwong, S. (1999). Genetic Algorithms: Concepts and Designs, Springer.","DOI":"10.1007\/978-1-4471-0577-0"},{"key":"ref_71","unstructured":"Ammar, H.H., and Tao, Y. (2000, January 24\u201325). Fingerprint registration using genetic algorithms. Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, Richardson, TX, USA."},{"key":"ref_72","unstructured":"Jareanpon, C., Pensuwon, W., Frank, R.J., and Dav, N. (2004, January 26\u201329). An adaptive RBF network optimised using a genetic algorithm applied to rainfall forecasting. Proceedings of the IEEE International Symposium on Communications and Information Technology, Sapporo, Japan."},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Yu, X., and Meng, B. (2006, January 25\u201327). Research on dynamics in group decision support systems based on multi-objective genetic algorithms. Proceedings of the IEEE International Conference on Service Systems and Service Management, Troyes, France.","DOI":"10.1109\/ICSSSM.2006.320750"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"2249","DOI":"10.1109\/TASL.2007.905139","article-title":"Feature selection for sound classification in hearing aids through restricted search driven by genetic algorithms","volume":"15","author":"Alexandre","year":"2007","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Meng, X., and Song, B. (2007, January 18\u201321). Fast genetic algorithms used for PID parameter optimization. Proceedings of the IEEE International Conference on Automation and Logistics, Jinan, China.","DOI":"10.1109\/ICAL.2007.4338930"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1016\/j.patrec.2007.08.001","article-title":"Generative learning of visual concept using multi objective genetic programming","volume":"28","author":"Krawiec","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"ref_77","first-page":"192","article-title":"A heterogeneous framework for the global parallelization of genetic algorithms","volume":"5","author":"Hamdan","year":"2008","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Liu, J. (2009, January 10\u201311). Application of fuzzy neural networks based on genetic algorithms in integrated navigation system. Proceedings of the IEEE Conference on Intelligent Computation Technology and Automation, Changsha, China.","DOI":"10.1109\/ICICTA.2009.393"},{"key":"ref_79","unstructured":"Ka, Y.W., and Chi, L. (2008). Positioning weather systems from remote sensing data using genetic algorithms. Computational Intelligence for Remote Sensing, Springer."},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Sorsa, A., Peltokangas, R., and Leiviska, K. (2009, January 6\u20138). Real coded genetic algorithms and nonlinear parameter identification. Proceedings of the IEEE International Conference on Intelligent System, Varna, Bulgaria.","DOI":"10.1109\/IS.2008.4670495"},{"key":"ref_81","unstructured":"Ai, J., and Feng-Wen, H. (2009, January 21\u201323). Methods for optimizing weights of wavelet neural network based on adaptive annealing genetic algorithms. Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, Beijing, China."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Kr\u00f6mer, P., Plato\u0161, J., and Sn\u00e1\u0161el, V. (2009, January 4\u20137). Modeling permutation for genetic algorithms. Proceedings of the IEEE International Conference on Soft Computing Pattern Recognition, Malacca, Malaysia.","DOI":"10.1109\/SoCPaR.2009.31"},{"key":"ref_83","doi-asserted-by":"crossref","unstructured":"Lin, C. (2009, January 14\u201317). An adaptive genetic algorithms based on population diversity strategy. Proceedings of the IEEE International Conference on Genetic and Evolutionary Computing, Guilin, China.","DOI":"10.1109\/WGEC.2009.67"},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Lizhe, Y., Bo, X., and Xiangjie, W. (2010, January 21\u201324). BP network model optimized by adaptive genetic algorithms and the application on quality evaluation for class. Proceedings of the IEEE International Conference on Future Computer and Communication, Wuhan, China.","DOI":"10.1109\/ICFCC.2010.5497635"},{"key":"ref_85","first-page":"123","article-title":"Optimal placement of piles in real grillages: Experimental comparison of optimization algorithms","volume":"40","author":"Ivanikovas","year":"2011","journal-title":"Inf. Technol. Control"},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Zhang, L., and Zhang, X. (2011, January 16\u201318). Measurement of the optical properties using genetic algorithms optimized neural networks. Proceedings of the 2011 Symposium on Photonics and Optoelectronics (SOPO), Wuhan, China.","DOI":"10.1109\/SOPO.2011.5780643"},{"key":"ref_87","first-page":"243","article-title":"Comparison of genetic algorithms and quantum genetic algorithms","volume":"7","author":"Laboudi","year":"2012","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref_88","doi-asserted-by":"crossref","unstructured":"Capraro, C.T., Bradaric, I., Capraro, G., and Kong, L. (2008, January 26\u201330). Using genetic algorithms for radar waveform selection. Proceedings of the 2008 IEEE Radar Conference, Rome, Italy.","DOI":"10.1109\/RADAR.2008.4720947"},{"key":"ref_89","first-page":"660","article-title":"Application of Elman neural network based on improved niche adaptive genetic algorithm","volume":"2","author":"Guo","year":"2011","journal-title":"IEEE Int. Conf. Intell. Control Inf. Process."},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_91","first-page":"785","article-title":"Enhancing genetic algorithms using multi mutations: Experimental results on the travelling salesman problem","volume":"14","author":"Hassanat","year":"2016","journal-title":"Int. J. Comput. Sci. Inf. Secur."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1504\/IJCAT.2017.084774","article-title":"On enhancing genetic algorithms using new crossovers","volume":"55","author":"Hassanat","year":"2017","journal-title":"Int. J. Comput. Appl. Technol."},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"ref_94","unstructured":"Reisleben, B., and Merz, P. (1996, January 20\u201322). A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. Proceedings of the IEEE International Conference on Evolutionary Computation, Nagoya, Japan."},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: A review of representations and operators","volume":"13","author":"Kuijpers","year":"1999","journal-title":"Artif. Intell. Rev."},{"key":"ref_96","first-page":"4519","article-title":"Study of various mutation operators in genetic algorithms","volume":"5","author":"Soni","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_97","doi-asserted-by":"crossref","unstructured":"Hassanat, A., Prasath, V., Abbadi, M., Abu-Qdari, S., and Faris, H. (2018). An improved genetic algorithm with a new initialization mechanism based on regression techniques. Information, 9.","DOI":"10.3390\/info9070167"},{"key":"ref_98","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1080\/25765299.2019.1615172","article-title":"Permutation rules and genetic algorithm to solve the traveling salesman problem","volume":"26","author":"Kaabi","year":"2019","journal-title":"Arab J. Basic Appl. Sci."},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Manag. Sci."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle swarm optimization-based algorithms for TSP and generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_102","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","article-title":"Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem","volume":"21","author":"Malek","year":"1989","journal-title":"Ann. Oper. Res."},{"key":"ref_103","doi-asserted-by":"crossref","unstructured":"Aarts, E.H.L., and Stehouwer, H.P. (1993, January 13\u201316). Neural networks and the travelling salesman problem. Proceedings of the International Conference on Artificial Neural Networks, Amsterdam, The Netherlands.","DOI":"10.1007\/978-1-4471-2063-6_282"},{"key":"ref_104","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1162\/neco.1989.1.3.348","article-title":"An analysis of the elastic net approach to the traveling salesman problem","volume":"1","author":"Durbin","year":"1989","journal-title":"Neural Comput."},{"key":"ref_105","first-page":"1524","article-title":"Implementation of heuristics for solving travelling salesman problem using nearest neighbour and minimum spanning tree algorithms","volume":"7","author":"Karkory","year":"2013","journal-title":"Int. J. Math. Comput. Phys. Electr. Comput. Eng."},{"key":"ref_106","first-page":"2032","article-title":"Exploring travelling salesman problem using genetic algorithm","volume":"3","author":"Singh","year":"2014","journal-title":"Int. J. Eng. Res. Technol."},{"key":"ref_107","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator","volume":"3","author":"Ahmed","year":"2010","journal-title":"Int. J. Biom. Bioinform."},{"key":"ref_108","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","article-title":"The \u201cmolecular\u201d traveling salesman","volume":"64","author":"Banzhaf","year":"1990","journal-title":"Biol. Cybern."},{"key":"ref_109","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","volume":"85","author":"Davis","year":"1985","journal-title":"Int. Jt. Conf. Artif. Intell."},{"key":"ref_110","first-page":"61","article-title":"Analyzing the performance of mutation operators to solve the travelling salesman problem","volume":"2","author":"Abdoun","year":"2012","journal-title":"Int. J. Emerg. Sci."},{"key":"ref_111","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"ref_112","doi-asserted-by":"crossref","unstructured":"Hassanat, A. (2018). Furthest-Pair-Based Decision Trees: Experimental Results on Big Data Classification. Information, 9.","DOI":"10.3390\/info9110284"},{"key":"ref_113","doi-asserted-by":"crossref","unstructured":"Hassanat, A. (2018). Norm-Based Binary Search Trees for Speeding Up KNN Big Data Classification. Computers, 7.","DOI":"10.3390\/computers7040054"},{"key":"ref_114","doi-asserted-by":"crossref","unstructured":"Hassanat, A.B. (2018). Two-point-based binary search trees for accelerating big data classification using KNN. PLoS ONE, 13.","DOI":"10.1371\/journal.pone.0207772"},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/big.2018.0064","article-title":"Furthest-pair-based binary search tree for speeding big data classification using k-nearest neighbors","volume":"6","author":"Hassanat","year":"2018","journal-title":"Big Data"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/390\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:52Z","timestamp":1760190052000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":115,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["info10120390"],"URL":"https:\/\/doi.org\/10.3390\/info10120390","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,10]]}}}