{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:48:33Z","timestamp":1774968513316,"version":"3.50.1"},"publisher-location":"Cham","reference-count":119,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_28","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T15:09:59Z","timestamp":1534172999000},"page":"431-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Garc\u00eda-Mart\u00ednez","sequence":"first","affiliation":[]},{"given":"Francisco J.","family":"Rodriguez","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Adler D (1993) Genetic algorithm and simulated annealing: a marriage proposal. In: Proceedings of the IEEE international conference on neural network, pp 1104\u20131109","DOI":"10.1109\/ICNN.1993.298712"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Alba E, Dorronsoro B (2005) The exploration\/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans Evol Comput 9(2):126\u2013142","DOI":"10.1109\/TEVC.2005.843751"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443\u2013462","DOI":"10.1109\/TEVC.2002.800880"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Alba E, Troya JM (2001) Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Gener Comput Syst 17(4):451\u2013465","DOI":"10.1016\/S0167-739X(99)00129-6"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Al-Naqi A, Erdogan A, Arslan T (2013) Adaptive three-dimensional cellular genetic algorithm for balancing exploration and exploitation processes. Soft Comput 17(7): 1145\u20131157","DOI":"10.1007\/s00500-013-0990-1"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Araujo L, Merelo J (2011) Diversity through multiculturality: assessing migrant choice policies in an island model. IEEE Trans Evol Comput 15(4):456\u2013469","DOI":"10.1109\/TEVC.2010.2064322"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Sch\u00fctz M (1996) Intelligent mutation rate control in canonical genetic algorithms. In: Ra\u015b Z, Michalewicz M (eds) Foundations of intelligent systems. Lecture notes in computer science, vol 1079, pp 158\u2013167","DOI":"10.1007\/3-540-61286-6_141"},{"key":"28_CR8","unstructured":"Baker J (1987) Adaptive selection methods for genetic algorithms. In: Grefenstette J (ed) International conference on genetic algorithms applications and their application. Erlbaum Associates, pp 14\u201321"},{"key":"28_CR9","unstructured":"Baker J (1987) Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the international conference on genetic algorithms, pp 14\u201321"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Baluja S, Caruanna R (1995) Removing the genetics from the standard genetic algorithm. In: Proceedings of the annual conference on machine learning, pp 38\u201346","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Banzhaf W (1990) The \u201cMolecular\u201d traveling salesman. Biol Cybern 64:7\u201314","DOI":"10.1007\/BF00203625"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Beyer H, Deb K (2001) On self-adaptive features in real-parameter evolutionary algorithms. IEEE Trans Evol Comput 5(3):250\u2013270","DOI":"10.1109\/4235.930314"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Bhandarkar S, Zhang H (1999) Image segmentation using evolutionary computation. IEEE Trans Evol Comput 3(1):1\u201321","DOI":"10.1109\/4235.752917"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Blum C (2010) Hybrid metaheuristics \u2013 guest editorial. Comput Oper Res 37(3):430\u2013431","DOI":"10.1016\/j.cor.2009.03.002"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Blum C, Puchinger J, Raidl G, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11:4135\u20134151","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Caruana R, Schaffer J (1988) Representation and hidden bias: gray versus binary coding for genetic algorithms. In: Proceedings of the fifth international conference on machine learning, pp 153\u2013162","DOI":"10.1016\/B978-0-934613-64-4.50021-9"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Chelouah R, Siarry P (2003) Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur J Oper Res 148(2): 335\u2013348","DOI":"10.1016\/S0377-2217(02)00401-0"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11\u201312):1245\u20131287","DOI":"10.1016\/S0045-7825(01)00323-1"},{"key":"28_CR19","unstructured":"Coello C, Lamont G, Veldhuizen D (2006) Evolutionary algorithms for solving multi-objective problems. Springer, New York"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"\u010crepin\u0161ek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35:1\u201335:33","DOI":"10.1145\/2480741.2480752"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Cruz C, Gonz\u00e1lez JR, Pelta DA (2011) Optimization in dynamic environments: a survey on problems, methods and measures. Soft Comput 15(7):1427\u20131448","DOI":"10.1007\/s00500-010-0681-0"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Dantzig G (1957) Discrete variable extremum problems. Oper Res 5:266\u2013277","DOI":"10.1287\/opre.5.2.266"},{"key":"28_CR23","unstructured":"Davis L (1985) Adaptive algorithms to epistactic domains. In: Proceedings of the international conference on artificial intelligence, pp 162\u2013164"},{"key":"28_CR24","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester\/New York"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Deb K (2008) Introduction to evolutionary multiobjective optimization. In: Branke J, Deb K, Miettinen K, S\u0142owiski R (eds) Multiobjective optimization. Lecture notes in computer science, vol 5252. Springer, Berlin\/Heidelberg, pp 59\u201396","DOI":"10.1007\/978-3-540-88908-3_3"},{"key":"28_CR26","unstructured":"De Jong K (1975) An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"De Jong K (1993) Genetic algorithms are NOT function optimizers. In: Whitley LD (ed) Foundations of genetic algorithms 2. Morgan Kaufmann, San Mateo","DOI":"10.1016\/B978-0-08-094832-4.50006-4"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"De Jong K, Sarma J (1993) Generation gaps revisited. In: Whitley LD (ed) Foundations of genetic algorithms. Morgan Kaufmann, San Mateo, pp 19\u201328","DOI":"10.1016\/B978-0-08-094832-4.50007-6"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Eiben A, Smith J (2003) Introduction to evolutionary computation. Natural computing series. Springer, New York","DOI":"10.1007\/978-3-662-05094-1"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Eiben A, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2):124\u2013141","DOI":"10.1109\/4235.771166"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Eklund SE (2004) A massively parallel architecture for distributed genetic algorithms. Parallel Comput 30(5\u20136):647\u2013676","DOI":"10.1016\/j.parco.2003.12.009"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Eshelman L (1991) The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. Foundations of genetic algorithms, vol 1. Morgan Kaufmann, San Mateo, CA, pp 265\u2013283","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"28_CR33","unstructured":"Eshelman L, Schaffer J (1991) Preventing premature convergence in genetic algorithms be preventing incest. In: Proceedings of the international conference on genetic algorithms, pp 115\u2013122"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Eshelman L, Schaffer J (1993) Real-coded genetic algorithms and interval-schemata. In: Whitley LD (ed) Foundations of genetic algorithms 2. Morgan Kaufmann, San Mateo, pp 187\u2013202","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"Fernandes C, Rosa A (2008) Self-adjusting the intensity of assortative mating in genetic algorithms. Soft Comput 12(10):955\u2013979","DOI":"10.1007\/s00500-007-0265-9"},{"key":"28_CR36","unstructured":"Fogarty TC (1989) Varying the probability of mutation in the genetic algorithm. In: Proceedings of the third international conference on genetic algorithms, pp 104\u2013109"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Fogel D (1998) Evolutionary computation: the fossil record. IEEE Press, New York","DOI":"10.1109\/9780470544600"},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892\u20132907","DOI":"10.1016\/j.cor.2007.01.001"},{"key":"28_CR39","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M, Herrera F, Molina D, S\u00e1nchez A (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res 185:1088\u20131113","DOI":"10.1016\/j.ejor.2006.06.043"},{"key":"28_CR40","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M, Herrera F, Molina D, S\u00e1nchez A (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res 185(3):1088\u20131113","DOI":"10.1016\/j.ejor.2006.06.043"},{"key":"28_CR41","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M, Rodr\u00edguez-D\u00edaz F (2012) A simulated annealing method based on a specialised evolutionary algorithm. Appl Soft Comput 12(2):573\u2013588","DOI":"10.1016\/j.asoc.2011.11.007"},{"key":"28_CR42","doi-asserted-by":"crossref","unstructured":"Ghannadian F, Alford C, Shonkwiler R (1996) Application of random restart to genetic algorithms. Inf Sci 95(1\u20132):81\u2013102","DOI":"10.1016\/S0020-0255(96)00121-1"},{"key":"28_CR43","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, New York"},{"key":"28_CR44","unstructured":"Goldberg D (1989) Sizing populations for serial and parallel genetic algorithms. In: Schaffer J (ed) International conference on genetic algorithms. Morgan Kaufmann, pp 70\u201379"},{"key":"28_CR45","unstructured":"Goldberg D, Lingle R (1985) Alleles, Loci and the traveling salesman problem. In: Proceedings of the international conference on genetic algorithms, pp 154\u2013159"},{"key":"28_CR46","unstructured":"Goldberg D, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette J (ed) Proceedings of the international conference on genetic algorithms. L. Erlbraum Associates, pp 41\u201349"},{"key":"28_CR47","unstructured":"Goldberg D, Korb B, Deb K (1990) Messy genetic algorithms: motivation, analysis, and first results. Complex Syst 3:493\u2013530"},{"key":"28_CR48","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves JF, Resende MG (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17(5):487\u2013525","DOI":"10.1007\/s10732-010-9143-1"},{"key":"28_CR49","doi-asserted-by":"crossref","unstructured":"Grosan C, Abraham A (2007) Hybrid evolutionary algorithms: methodologies, architectures, and reviews. In: Grosan C, Abraham A, Ishibuchi H (eds) Hybrid evolutionary algorithms. Springer, Berlin\/New York, pp 1\u201317","DOI":"10.1007\/978-3-540-73297-6_1"},{"key":"28_CR50","unstructured":"Gr\u00f6tschel M, Padberg MM (1978) On the symmetric traveling salesman problem: theory and computations. In: Optimization and operations research. Lecture notes in econocmics and mathematical systems, vol 157. Springer, pp 105\u2013115"},{"key":"28_CR51","doi-asserted-by":"crossref","unstructured":"Gupta S, Garg ML (2013) Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence. Int J Comput Math 90(5):881\u2013902","DOI":"10.1080\/00207160.2012.742514"},{"key":"28_CR52","unstructured":"Harik G (1995) Finding multimodal solutions using restricted tournament selection. In: Proceedings of the international conference on genetic algorithms. Morgan Kaufmann, pp 24\u201331"},{"key":"28_CR53","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M (2000) Gradual distributed real-coded genetic algorithms. IEEE Trans Evol Comput 4(1):43\u201363","DOI":"10.1109\/4235.843494"},{"key":"28_CR54","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M (2003) Fuzzy adaptive genetic algorithms: design, taxonomy, and future directions. Soft Comput 7(8):545\u2013562","DOI":"10.1007\/s00500-002-0238-y"},{"key":"28_CR55","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M, Verdegay J (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12:265\u2013319","DOI":"10.1023\/A:1006504901164"},{"key":"28_CR56","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M, S\u00e1nchez A (2003) A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int J Intell Syst 18(3):309\u2013338","DOI":"10.1002\/int.10091"},{"key":"28_CR57","doi-asserted-by":"crossref","unstructured":"Hinterding R, Michalewicz Z, Eiben A (1997) Adaptation in evolutionary computation: a survey. In: IEEE international conference on evolutionary computation, pp 65\u201369","DOI":"10.1109\/ICEC.1997.592270"},{"key":"28_CR58","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"key":"28_CR59","doi-asserted-by":"crossref","unstructured":"Hutter M, Legg S (2006) Fitness uniform optimization. IEEE Trans Evol Comput 10(5): 568\u2013589","DOI":"10.1109\/TEVC.2005.863127"},{"key":"28_CR60","doi-asserted-by":"crossref","unstructured":"Iman R, Conover W (1982) A distribution-free approach to inducing rank correlation among input variables. Commun Stat Simul Comput 11(3):311\u2013334","DOI":"10.1080\/03610918208812265"},{"key":"28_CR61","unstructured":"Janikow C, Michalewicz Z (1991) An experimental comparison of binary and floating point representation in genetic algorithms. In: Proceedings of the fourth international conference on genetic algorithms, pp 31\u201336"},{"key":"28_CR62","doi-asserted-by":"crossref","unstructured":"Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments-a survey. IEEE Trans Evol Comput 9(3):303\u2013317","DOI":"10.1109\/TEVC.2005.846356"},{"key":"28_CR63","doi-asserted-by":"crossref","unstructured":"Karafotias G, Hoogendoorn M, Eiben A (2015) Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans Evol Comput 19(2):167\u2013187","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"28_CR64","doi-asserted-by":"crossref","unstructured":"Kazarlis S, Papadakis S, Theocharis J, Petridis V (2001) Microgenetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Trans Evol Comput 5(3):204\u2013217","DOI":"10.1109\/4235.930311"},{"key":"28_CR65","doi-asserted-by":"crossref","unstructured":"Kazimipour B, Li X, Qin A (2014) A review of population initialization techniques for evolutionary algorithms. In: Proceedings of the IEEE congress on evolutionary computation, pp 2585\u20132592","DOI":"10.1109\/CEC.2014.6900618"},{"key":"28_CR66","doi-asserted-by":"crossref","unstructured":"Kita H (2001) A comparison study of self-adaptation in evolution strategies and real-coded genetic algorithms. Evol Comput 9(2):223\u2013241","DOI":"10.1162\/106365601750190415"},{"key":"28_CR67","unstructured":"Kominami M, Hamagami T (2007) A new genetic algorithm with diploid chromosomes by using probability decoding for non-stationary function optimization. In: IEEE international conference on systems, man and cybernetics, 2007. ISIC. pp 1268\u20131273"},{"key":"28_CR68","doi-asserted-by":"crossref","unstructured":"Koumousis V, Katsaras C (2006) A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance. IEEE Trans Evol Comput 10(1):19\u201328","DOI":"10.1109\/TEVC.2005.860765"},{"key":"28_CR69","doi-asserted-by":"crossref","unstructured":"Krishnakumar K (1989) Micro-genetic algorithms for stationary and non-stationary function optimization. In: Intelligent control and adaptive systems. Proceedings of the SPIE, vol 1196, pp 289\u2013296","DOI":"10.1117\/12.969927"},{"key":"28_CR70","unstructured":"Kuo T, Hwang S (1996) A genetic algorithm with disruptive selection. IEEE Trans Syst Man Cybern 26(2):299\u2013307"},{"key":"28_CR71","unstructured":"Kurahashi S, Terano T (2000) A genetic algorithm with tabu search for multimodal and multiobjective function optimization. In: Whitley LD, Goldberg DE, Cant-Paz E, Spector L, Parmee IC, Beyer HG (eds) GECCO. Morgan Kaufmann, pp 291\u2013298"},{"key":"28_CR72","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga P, Kuijpers C, Murga R, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","DOI":"10.1023\/A:1006529012972"},{"key":"28_CR73","unstructured":"Li JP, Balazs ME, Parks GT, Clarkson PJ (2002) A species conserving genetic algorithm for multimodal function optimization. Evol Comput 10(3):207\u2013234"},{"key":"28_CR74","doi-asserted-by":"crossref","unstructured":"Liang Y, Leung KS (2011) Genetic algorithm with adaptive elitist-population strategies for multimodal function optimization. Appl Soft Comput 11(2):2017\u20132034","DOI":"10.1016\/j.asoc.2010.06.017"},{"key":"28_CR75","doi-asserted-by":"crossref","unstructured":"Lozano M, Garc\u00eda-Mart\u00ednez C (2010) Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report. Comput Oper Res 37:481\u2013497","DOI":"10.1016\/j.cor.2009.02.010"},{"key":"28_CR76","doi-asserted-by":"crossref","unstructured":"Lozano M, Herrera F, Krasnogor N, Molina D (2004) Real-coded memetic algorithms with crossover hill-climbing. Evol Comput 12(3):273\u2013302","DOI":"10.1162\/1063656041774983"},{"key":"28_CR77","doi-asserted-by":"crossref","unstructured":"Lozano M, Herrera F, Cano JR (2008) Replacement strategies to preserve useful diversity in steady-state genetic algorithms. Inf Sci 178(23):4421\u20134433","DOI":"10.1016\/j.ins.2008.07.031"},{"key":"28_CR78","unstructured":"Mahfoud S (1992) Crowding and preselection revised. In: M\u00e4nner R, Manderick B (eds) Parallel problem solving from nature, vol 2. Elsevier Science, pp 27\u201336"},{"key":"28_CR79","doi-asserted-by":"crossref","unstructured":"Mallipeddi R, Suganthan P (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14(4):561\u2013579","DOI":"10.1109\/TEVC.2009.2033582"},{"key":"28_CR80","unstructured":"Mauldin M (1984) Maintaining diversity in genetic search. In: National conference on artificial intelligence, Austin, pp 247\u2013250"},{"key":"28_CR81","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (1992) Genetic algorithms + data structures = evolution programs. Springer, Berlin\/New York","DOI":"10.1007\/978-3-662-02830-8"},{"key":"28_CR82","doi-asserted-by":"crossref","unstructured":"Michalewicz A, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","DOI":"10.1162\/evco.1996.4.1.1"},{"key":"28_CR83","doi-asserted-by":"crossref","unstructured":"Molina D, Lozano M, Garc\u00eda-Mart\u00ednez C, Herrera F (2010) Memetic algorithms for continuous optimization based on local search chains. Evol Comput 18(1):27\u201363","DOI":"10.1162\/evco.2010.18.1.18102"},{"key":"28_CR84","doi-asserted-by":"crossref","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic, Boston, pp 105\u2013144","DOI":"10.1007\/0-306-48056-5_5"},{"key":"28_CR85","doi-asserted-by":"crossref","unstructured":"Noman N, Iba H (2008) Accelerating differential evolution using an adaptive local search. IEEE Trans Evol Comput 12(1):107\u2013125","DOI":"10.1109\/TEVC.2007.895272"},{"key":"28_CR86","doi-asserted-by":"crossref","unstructured":"Nomura T, Shimohara K (2001) An analysis of two-parent recombinations for real-valued chromosomes in an infinite population. Evol Comput 9(3):283\u2013308","DOI":"10.1162\/106365601750406000"},{"key":"28_CR87","unstructured":"Oh IS, Lee JS, Moon BR (2004) Hybrid genetic algorithms for feature selection. IEEE Trans Pattern Anal Mach Intell 26(11):1424\u20131437"},{"key":"28_CR88","unstructured":"Oliver I, Smith D, Holland J (1987) A study of permutation crossover operators on the TSP. In: Proceedings of the international conference on genetic algorithms and their applications, pp 224\u2013230"},{"key":"28_CR89","doi-asserted-by":"crossref","unstructured":"Pereira A, de Andrade BB (2015) On the genetic algorithm with adaptive mutation rate and selected statistical applications. Comput Stat 30(1):131\u2013150","DOI":"10.1007\/s00180-014-0526-x"},{"key":"28_CR90","doi-asserted-by":"crossref","unstructured":"Potts J, Giddens T, Yadav S (1994) The development and evaluation of an improved genetic algorithm based on migration and artificial selection. IEEE Trans Syst Man Cybern 24: 73\u201386","DOI":"10.1109\/21.259687"},{"key":"28_CR91","doi-asserted-by":"crossref","unstructured":"Preechakul C, Kheawhom S (2009) Modified genetic algorithm with sampling techniques for chemical engineering optimization. J Ind Eng Chem 15:110\u2013118","DOI":"10.1016\/j.jiec.2008.09.003"},{"key":"28_CR92","doi-asserted-by":"crossref","unstructured":"Preux P, Talbi E (1999) Towards hybrid evolutionary algorithms. Int Trans Oper Res 6(6): 557\u2013570","DOI":"10.1111\/j.1475-3995.1999.tb00173.x"},{"key":"28_CR93","doi-asserted-by":"crossref","unstructured":"Raidl G (2006) A unified view on hybrid metaheuristics. In: Almeida F, Aguilera MB, Blum C, Vega JM, P\u00e9rez MP, Roli A, Sampels M (eds) Hybrid metaheuristics, LNCS, vol 4030. Springer, pp 1\u201312","DOI":"10.1007\/11890584_1"},{"key":"28_CR94","doi-asserted-by":"crossref","unstructured":"Reeves C (2010) Genetic algorithms. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, vol 146. Springer, New York, pp 109\u2013139","DOI":"10.1007\/978-1-4419-1665-5_5"},{"key":"28_CR95","doi-asserted-by":"crossref","unstructured":"Reeves C, Rowe J (2001) Genetic algorithms: principles and perspectives. Kluwer, Norwell","DOI":"10.1007\/b101880"},{"key":"28_CR96","doi-asserted-by":"crossref","unstructured":"Rodriguez F, Garcia-Martinez C, Lozano M (2012) Hybrid metaheuristics based on evolutionary algorithms and simulated annealing: taxonomy, comparison, and synergy test. IEEE Trans Evol Comput 16(6):787\u2013800","DOI":"10.1109\/TEVC.2012.2182773"},{"key":"28_CR97","doi-asserted-by":"crossref","unstructured":"Sareni B, Krahenbuhl L (1998) Fitness sharing and Niching methods revisited. IEEE Trans Evol Comput 2(3):97\u2013106","DOI":"10.1109\/4235.735432"},{"key":"28_CR98","doi-asserted-by":"crossref","unstructured":"Serpell M, Smith J (2010) Self-adaption of mutation operator and probability for permutation representations in genetic algorithms. Evol Comput 18(3):491\u2013514","DOI":"10.1162\/EVCO_a_00006"},{"key":"28_CR99","unstructured":"Smith JE, Fogarty TC (1997) Operator and parameter adaptation in genetic algorithms. Soft Comput 1(2):81\u201387"},{"key":"28_CR100","doi-asserted-by":"crossref","unstructured":"Smith A, Coit D, Baeck T, Fogel D, Michalewicz Z (1997) Penalty functions. In: B\u00e4ck T, Fogel DB, Michalewics Z (eds) Handbook on evolutionary computation. Oxford University Press, New York, pp C5.2:1\u2013C5.2:6","DOI":"10.1887\/0750308958\/b386c48"},{"key":"28_CR101","doi-asserted-by":"crossref","unstructured":"Srinivas M, Patnaik L (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656\u2013667","DOI":"10.1109\/21.286385"},{"key":"28_CR102","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proceedings of the international conference on genetic algorithms, pp 2\u20139"},{"key":"28_CR103","doi-asserted-by":"crossref","unstructured":"Talbi E (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5):541\u2013564","DOI":"10.1023\/A:1016540724870"},{"key":"28_CR104","unstructured":"Talbi EG, Bachelet V (2006) Cosearch: a parallel cooperative metaheuristic. J Math Model Algorithms 5(1):5\u201322"},{"key":"28_CR105","doi-asserted-by":"crossref","unstructured":"Tantar A, Melab N, Talbi E (2008) A grid-based genetic algorithm combined with an adaptive simulated annealing for protein structure prediction. Soft Comput 12(12):1185\u20131198","DOI":"10.1007\/s00500-008-0298-8"},{"key":"28_CR106","unstructured":"Thierens D (1998) Selection schemes, elitist recombination, and selection intensity. In: Proceedings of the 7th international conference on genetic algorithms. Morgan Kaufmann, pp 152\u2013159"},{"key":"28_CR107","doi-asserted-by":"crossref","unstructured":"Ting CK, Li ST, Lee C (2003) On the harmonious mating strategy through tabu search. Inf Sci 156:189\u2013214","DOI":"10.1016\/S0020-0255(03)00176-2"},{"key":"28_CR108","doi-asserted-by":"crossref","unstructured":"Tuson A, Ross P (1998) Adapting operator settings in genetic algorithms. Evol Comput 6(2):161\u2013184","DOI":"10.1162\/evco.1998.6.2.161"},{"key":"28_CR109","unstructured":"Uyar Ai, Harmanci AE (2005) A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9(11): 803\u2013814"},{"key":"28_CR110","doi-asserted-by":"crossref","unstructured":"van Kemenade C, Kok J, Eiben AE (1995) Raising GA performance by simultaneous tuning of selective pressure and recombination disruptiveness. In: Proceedings of the 1995 IEEE congress on evolutionary computation (CEC 1995), pp 346\u2013351","DOI":"10.1109\/ICEC.1995.489171"},{"key":"28_CR111","doi-asserted-by":"crossref","unstructured":"Venkatraman S, Yen G (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424\u2013435","DOI":"10.1109\/TEVC.2005.846817"},{"key":"28_CR112","doi-asserted-by":"crossref","unstructured":"Vrugt J, Robinson B, Hyman J (2009) Self-adaptive multimethod search for global optimization in real-parameter spaces. IEEE Trans Evol Comput 13(2):243\u2013259","DOI":"10.1109\/TEVC.2008.924428"},{"key":"28_CR113","unstructured":"Whitley D (1989) The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In: Proceedings of the international conference on genetic algorithms. Morgan Kaufmann, pp 116\u2013121"},{"key":"28_CR114","unstructured":"Wong YY, Lee KH, Leung KS, Ho CW (2003) A novel approach in parameter adaptation and diversity maintenance for genetic algorithms. Soft Comput 7(8):506\u2013515"},{"key":"28_CR115","doi-asserted-by":"crossref","unstructured":"Yang CH, Nygard K (1993) Effects of initial population in genetic search for time constrained traveling salesman problems. In: Proceedings of the ACM computer science conference, pp 378\u2013383","DOI":"10.1145\/170791.170875"},{"key":"28_CR116","doi-asserted-by":"crossref","unstructured":"Yang S, Ong Y, Jin Y (eds) (2007) Evolutionary computation in dynamic and uncertain environments. Studies in computational intelligence, vol 51. Springer, Berlin\/London","DOI":"10.1007\/978-3-540-49774-5"},{"issue":"1","key":"28_CR117","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/TEVC.2009.2017517","volume":"14","author":"J Yao","year":"2010","unstructured":"Yao J, Kharma N, Grogono P (2010) Bi-objective multipopulation genetic algorithm for multimodal function optimization. IEEE Trans Evol Comput 14(1):80\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"28_CR118","first-page":"45","volume":"10","author":"\u00d6 Yeniay","year":"2005","unstructured":"Yeniay \u00d6 (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10(1):45\u201356","journal-title":"Math Comput Appl"},{"issue":"2","key":"28_CR119","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/TEVC.2008.2003008","volume":"13","author":"SY Yuen","year":"2009","unstructured":"Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2):454\u2013472","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T03:20:46Z","timestamp":1571714446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":119,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_28","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}