The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Whitley, D. (1994) · Statistics and Computing · doi:10.1007/bf00175354 · Cited by 4,522
Introduction to Evolutionary Computing
Eiben, A. E., & Smith, J. E. (2003) · Natural Computing Series · doi:10.1007/978-3-662-05094-1 · Cited by 4,176
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Genetic Algorithms and Engineering Optimization
Gen, M., & Cheng, R. (1999) · doi:10.1002/9780470172261 · Cited by 2,548
Adaptive probabilities of crossover and mutation in genetic algorithms
Srinivas, M., & Patnaik, L. M. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.286385 · Cited by 2,512
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
A Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
Evolution of the mutation rate
Lynch, M. (2010) · Trends in Genetics · doi:10.1016/j.tig.2010.05.003 · Cited by 1,151
Genetic algorithms: concepts and applications [in engineering design]
Man, K. F., Tang, K. S., & Kwong, S. (1996) · IEEE Transactions on Industrial Electronics · doi:10.1109/41.538609 · Cited by 1,120
The traveling salesman problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., & Dizdarevic, S. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006529012972 · Cited by 849
An overview of genetic algorithms: Part 1, fundamentals
Beasley, D. W. C., Bull, D., & Martin, R. R. (1993) · Bristol Research (University of Bristol) · Cited by 797
Roulette-wheel selection via stochastic acceptance
Lipowski, A., & Lipowska, D. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.004 · Cited by 761
Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review
Abu Alfeilat, H. A., Hassanat, A. B. A., Lasassmeh, O., Tarawneh, A. S., Alhasanat, M. B., Eyal Salman, H. S., & Prasath, V. B. S. (2019) · Big Data · doi:10.1089/big.2018.0175 · Cited by 667
Self-citationApplying adaptive algorithms to epistatic domains
Davis, L. D. (1985) · International Joint Conference on Artificial Intelligence · Cited by 642
Genetic Algorithms: Concepts and Applications
Man, K. F., Tang, K. S., & Kwong, S. (1996) · Cited by 615
Genetic Algorithms: Concepts and Designs
Man, K. F., Tang, K. S., & Kwong, S. (1999) · Medical Entomology and Zoology · Cited by 576
Hybrid methods using genetic algorithms for global optimization
Renders, J.-M., & Flasse, S. P. (1996) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.485836 · Cited by 409
Genetic Algorithm Performance with Different Selection Strategies in Solving TSP
Razali, N. M., & Geraghty, J. (2011) · Cited by 359
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Freisleben, B., & Merz, P. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542671 · Cited by 277
Comparative review of selection techniques in genetic algorithm
Shukla, A., Pandey, H. M., & Mehrotra, D. (2015) · 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE) · doi:10.1109/ablaze.2015.7154916 · Cited by 259
An Analysis of the Elastic Net Approach to the Traveling Salesman Problem
Durbin, R., Szeliski, R., & Yuille, A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.348 · Cited by 184
Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms
Zhong, J., Hu, X.-M., Zhang, J., & Gu, M. H. (2006) · doi:10.1109/cimca.2005.1631619 · Cited by 164
A SURVEY OF GENETIC ALGORITHMS APPLICATIONS FOR IMAGE ENHANCEMENT AND SEGMENTATION
Paulinas, M., & Ušinskas, A. (2007) · Information Technology And Control · doi:10.5755/j01.itc.36.3.11886 · Cited by 163
Understanding Interactions among Genetic Algorithm Parameters.
Deb, K., & Agrawal, S. (1998) · Cited by 161
On Stopping Criteria for Genetic Algorithms
Safe, M. D., Carballido, J. A., Ponzoni, I., & Brignole, N. B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28645-5_41 · Cited by 148
Evolution of Appropriate Crossover and Mutation Operators in a Genetic Process
Hong, T., Wang, H.-S., Lin, W.-Y., & Lee, W. (2002) · Applied Intelligence · doi:10.1023/a:1012815625611 · Cited by 106
A Novel Crossover Operator for Genetic Algorithms: Ring CrossoverPreprint
Kaya, Y., Uyar, M., & Tek\D{j}n, R. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.0355 · Cited by 103
Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence
Pelikán, M., Pelikán, M., Cantú‐Paz, E., & Goldberg, D. E. (2000) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 102
Genetic programming: optimal population sizes for varying complexity problems
Piszcz, A., & Soule, T. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144166 · Cited by 63
On enhancing genetic algorithms using new crossovers
Hassanat, A. B. A., Esra', N. A., & Alkafaween, A. A. (2017) · International Journal of Computer Applications in Technology · doi:10.1504/ijcat.2017.084774 · Cited by 54
Self-citationAlexandre, E., Cuadra, L., Rosa-Zurera, M., & López-Ferreras, F. (2007) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tasl.2007.905139 · Cited by 39
Furthest-Pair-Based Decision Trees: Experimental Results on Big Data Classification
Hassanat, A. B. A. (2018) · Information · doi:10.3390/info9110284 · Cited by 29
Self-citationWang, Y. M., & Yin, H. L. (2018) · Mathematical Problems in Engineering · doi:10.1155/2018/5743287 · Cited by 19
On enhancing genetic algorithms using new crossovers
Alkafaween, E., & Hassanat, A. B. A. (2017) · International Journal of Computer Applications in Technology · doi:10.1504/ijcat.2017.10005868 · Cited by 18
Self-citationPereira, G. C., de Oliveira, M. M. F., & Ebecken, N. F. F. (2013) · Journal of Intelligent Learning Systems and Applications · doi:10.4236/jilsa.2013.51007 · Cited by 16
Modeling Permutations for Genetic Algorithms
Krömer, P., Platoš, J., & Snåšel, V. (2009) · International Conference of Soft Computing and Pattern Recognition (SoCPaR) · doi:10.1109/socpar.2009.31 · Cited by 9
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Black hole attack detection in vehicular ad-hoc network using secure AODV routing algorithm
Kumar, A., Varadarajan, V., Kumar, A., Dadheech, P., Choudhary, S. S., Kumar, V. D. A., Panigrahi, B. K., & Veluvolu, K. C. (2021) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103352 · Cited by 138
Metadata
- Authors
- Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., & Prasath, V. B. S.
- Venue
- Information
- Publisher
- MDPI AG
- Published
- 2019-12-10
- Volume
- 10
- Issue
- 12
- Pages
- 390
- ISSN
- 2078-2489 (ISSN-L)
- OpenAlex
- W2993471286
- Cited by
- 668
- References
- 41
- FWCI
- 24.75
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.