{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:23:08Z","timestamp":1648977788689},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T00:00:00Z","timestamp":1426723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00500-015-1630-8","type":"journal-article","created":{"date-parts":[[2015,3,18]],"date-time":"2015-03-18T05:06:47Z","timestamp":1426655207000},"page":"2149-2176","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bolstering efficient SSGAs based on an ensemble of probabilistic variable-wise crossover strategies"],"prefix":"10.1007","volume":"20","author":[{"given":"Jeonghwan","family":"Gwak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moongu","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,19]]},"reference":[{"key":"1630_CR1","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In: Proceedings of the 2005 IEEE congress on evolutionary computation, pp 1769\u20131776","DOI":"10.1109\/CEC.2005.1554902"},{"key":"1630_CR2","doi-asserted-by":"crossref","DOI":"10.1887\/0750306653","volume-title":"Evolutionary computation 2: advanced algorithms and operators","author":"T B\u00e4ck","year":"2000","unstructured":"B\u00e4ck T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 2: advanced algorithms and operators. Institute of Physics Publishing, Bristol"},{"key":"1630_CR3","unstructured":"Ballester PJ, Carter JN (2004) An effective real-parameter genetic algorithm with parent centric normal crossover for multimodal optimization. In: Proceedings of the genetic and evolutionary computation conference, LNCS, vol 3102. Springer, New York, pp 901\u2013913"},{"key":"1630_CR4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/4235.930314","volume":"5","author":"H-G Beyer","year":"2001","unstructured":"Beyer H-G, Deb K (2001) On self-adaptive features in real-parameter evolutionary algorithms. IEEE Trans Evolut Comput 5:250\u2013270","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR5","first-page":"1491","volume-title":"Proceedings of the genetic and evolutionary computation conference","author":"CR Bonham","year":"1999","unstructured":"Bonham CR, Parmee IC (1999) An investigation of exploration and exploitation within cluster oriented genetic algorithms (COGAs). Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp 1491\u20131497"},{"key":"1630_CR6","unstructured":"Clerc M (2011) Standard PSO 2011. In: Particle swarm central (Online). http:\/\/www.particleswarm.info"},{"key":"1630_CR7","unstructured":"Davis L (1989) Adapting operator probabilities in genetic algorithms. In: Schaffer JD (ed) Proceedings of 3rd international conference on genetic algorithms, Morgan Kaufmann, San Mateo, pp 61\u201369"},{"key":"1630_CR8","first-page":"19","volume-title":"Foundations of genetic algorithms 2","author":"KA Jong De","year":"1993","unstructured":"De Jong KA, Sarma J (1993) Generation gaps revisited. In: Whitley LD (ed) Foundations of genetic algorithms 2. Morgan Kaufmann, San Mateo, pp 19\u201328"},{"key":"1630_CR9","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"1630_CR10","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115\u2013148","journal-title":"Complex Syst"},{"key":"1630_CR11","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S (1999) A niched-penalty approach for constraint handling in genetic algorithms. In: Proceedings of the international conference on artificial neural networks and genetic algorithms (ICANNGA-99), pp 235\u2013243","DOI":"10.1007\/978-3-7091-6384-9_40"},{"key":"1630_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1162\/106365602760972767","volume":"10","author":"K Deb","year":"2002","unstructured":"Deb K, Anand A, Joshi D (2002) A computationally efficient evolutionary algorithm for real-parameter evolution. Evolut Comput 10:371\u2013395","journal-title":"Evolut Comput"},{"key":"1630_CR13","unstructured":"Deb K, Beyer H-G (1999) Self-adaptation in real-parameter genetic algorithms with simulated binary crossover. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp 172\u2013179"},{"key":"1630_CR14","unstructured":"Deb K, Deb D (2012) Analyzing mutation schemes for real-parameter genetic algorithms. KanGAL, report no 2012016"},{"key":"1630_CR15","unstructured":"Deb K, Jain H (2011) Self-adaptive parent to mean-centric recombination for real-parameter optimization. Indian Institute of Technology Kanpur, KanGAL, report no 2011001"},{"key":"1630_CR16","doi-asserted-by":"crossref","unstructured":"Deb K, Karthik S, Okabe T (2007) Self-adaptive simulated binary crossover for real-parameter optimization. In: Proceedings of 9th annual conference on genetic and evolutionary computation, London, England, pp 1187\u20131194","DOI":"10.1145\/1276958.1277190"},{"key":"1630_CR17","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1016\/j.amc.2006.10.047","volume":"188","author":"K Deep","year":"2007","unstructured":"Deep K, Thakur M (2007) A new crossover operator for real coded genetic algorithms. Appl Math Comput 188:895\u2013911","journal-title":"Appl Math Comput"},{"key":"1630_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1:3\u201318","journal-title":"Swarm Evolut Comput"},{"key":"1630_CR19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11047-012-9360-7","volume":"12","author":"J Dom\u00ednguez","year":"2013","unstructured":"Dom\u00ednguez J, Alba E (2013) Dealing with hardware heterogeneity: a new parallel search model. Nat Comput 12:179\u2013193","journal-title":"Nat Comput"},{"key":"1630_CR20","first-page":"187","volume-title":"Foundations of genetic algorithms 2","author":"LJ Eshelman","year":"1993","unstructured":"Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval-schemata. In: Whitley LD (ed) Foundations of genetic algorithms 2. Morgan Kaufmann Publishers, San Mateo, pp 187\u2013202"},{"key":"1630_CR21","first-page":"60","volume-title":"Proceedings of 2001 congress on evolutionary computation","author":"C Fernandes","year":"2001","unstructured":"Fernandes C, Rosa A (2001) A study on non-random mating and varying population size in genetic algorithms using a royal road function. Proceedings of 2001 congress on evolutionary computation. IEEE Press, Piscataway, pp 60\u201366"},{"key":"1630_CR22","volume-title":"Evolutionary computation: toward a new philosophy of machine intelligence","author":"DB Fogel","year":"1995","unstructured":"Fogel DB (1995) Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press, New York"},{"key":"1630_CR23","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1162\/evco.1995.3.4.491","volume":"3","author":"DB Fogel","year":"1995","unstructured":"Fogel DB, Beyer H-G (1995) A note on empirical evaluation of intermediate recombination. Evolut Comput 3:491\u2013495","journal-title":"Evolut Comput"},{"key":"1630_CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10489-011-0325-9","volume":"37","author":"J Garc\u00eda-Nieto","year":"2012","unstructured":"Garc\u00eda-Nieto J, Alba E (2012) Parallel multi-swarm optimizer for gene selection in DNA microarrays. Appl Intell 37:255\u2013266","journal-title":"Appl Intell"},{"key":"1630_CR25","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1016\/j.ejor.2006.06.043","volume":"185","author":"C Garcia-Martinez","year":"2008","unstructured":"Garcia-Martinez C, Lozano M, Herrera F, Molina D, Sanchez AM (2008) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Op Res 185:1088\u20131113","journal-title":"Eur J Op Res"},{"key":"1630_CR26","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc, Massachusetts"},{"key":"1630_CR27","first-page":"69","volume-title":"Foundations of genetic algorithms","author":"DE Goldberg","year":"1991","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins GJE (ed) Foundations of genetic algorithms. Morgan Kaufmann, San Mateo, pp 69\u201393"},{"key":"1630_CR28","doi-asserted-by":"crossref","unstructured":"Gwak J, Jeon M (2013) A robust real-coded genetic algorithm using an ensemble of crossover operators. In: Proceedings of the genetic and evolutionary computation conference, pp 1737\u20131738","DOI":"10.1145\/2464576.2480792"},{"key":"1630_CR29","doi-asserted-by":"crossref","unstructured":"Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of 1996 IEEE confernce evolutionary computing (ICEC \u201996), Berlin, Germany, pp 312\u2013317","DOI":"10.1109\/ICEC.1996.542381"},{"key":"1630_CR30","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen N, Ostermeier A (2001) Completely derandomized selfadaptation in evolution strategies. Evolut Comput 9:159\u2013195","journal-title":"Evolut Comput"},{"key":"1630_CR31","first-page":"24","volume-title":"Proceedings of the 6th international conference on genetic algorithms","author":"G Harik","year":"1995","unstructured":"Harik G (1995) Finding multimodal solutions using restricted tournament selection. In: Eshelman LJ (ed) Proceedings of the 6th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 24\u201331"},{"key":"1630_CR32","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/4235.843494","volume":"4","author":"F Herrera","year":"2000","unstructured":"Herrera F, Lozano M (2000) Gradual distributed real-coded genetic algorithms. IEEE Trans Evolut Comput 4:43\u201363","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR33","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/int.10091","volume":"18","author":"F Herrera","year":"2003","unstructured":"Herrera F, Lozano M, S\u00e1nchez AM (2003) A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int J Intell Syst 18:309\u2013338","journal-title":"Int J Intell Syst"},{"key":"1630_CR34","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s00500-004-0380-9","volume":"9","author":"F Herrera","year":"2005","unstructured":"Herrera F, Lozano M, S\u00e1nchez AM (2005) Hybrid crossover operators for real-coded genetic algorithms: an experimental study. Soft Comput 9:280\u2013298","journal-title":"Soft Comput"},{"key":"1630_CR35","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0165-0114(96)00179-0","volume":"92","author":"F Herrera","year":"1997","unstructured":"Herrera F, Lozano M, Verdegay JL (1997) Fuzzy connectives based crossover operators to model genetic algorithms population diversity. Fuzzy Set Syst 92:21\u201330","journal-title":"Fuzzy Set Syst"},{"key":"1630_CR36","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F Herrera","year":"1998","unstructured":"Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioral analysis. Artif Intell Rev 12:265\u2013319","journal-title":"Artif Intell Rev"},{"key":"1630_CR37","doi-asserted-by":"crossref","unstructured":"Herrera F, Lozano M, Molina D (2010) Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems. http:\/\/sci2s.ugr.es\/eamhco\/CFP.php","DOI":"10.1007\/s00500-010-0639-2"},{"key":"1630_CR38","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2478\/acsc-2014-0010","volume":"24","author":"DVK Khanh","year":"2014","unstructured":"Khanh DVK, Vasant P, Elamvazuthi I, Dieu VN (2014) Optimization of thermo-electric coolers using hybrid genetic algorithm and simulated annealing. Arch Control Sci 24:155\u2013176","journal-title":"Arch Control Sci"},{"key":"1630_CR39","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE conference on neural networks, IV, Piscataway, NJ, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1630_CR40","unstructured":"Kita H, Ono I, Kobayashi S (1999) The multi-parent unimodal normal distribution crossover for real-coded genetic algorithms. In: Proceedings of the IEEE congress on evolutionary computation, vol 2, pp 1588\u20131595"},{"key":"1630_CR41","unstructured":"Liang JJ, Qu B-Y, Suganthan PN, Hern\u00e1ndez-D\u00edaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session and competition on real-parameter optimization, technical report 201212. Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, Computational Intelligence Laboratory"},{"key":"1630_CR42","doi-asserted-by":"crossref","unstructured":"Liang Y, Zhang M, Browne WN (2014) Image segmentation: a survey of methods based on evolutionary computation. Simul Evolut Learn LNCS 8886:847\u2013859","DOI":"10.1007\/978-3-319-13563-2_71"},{"key":"1630_CR43","volume-title":"Parameter setting in evolutionary algorithms","year":"2007","unstructured":"Lobo GF, Lima CF, Michalewicz Z (eds) (2007) Parameter setting in evolutionary algorithms. Springer, New York"},{"key":"1630_CR44","doi-asserted-by":"crossref","first-page":"4421","DOI":"10.1016\/j.ins.2008.07.031","volume":"178","author":"M Lozano","year":"2008","unstructured":"Lozano M, Herrera F, Cano JR (2008) Replacement strategies to preserve useful diversity in steady-state genetic algorithms. Inf Sci 178:4421\u20134433","journal-title":"Inf Sci"},{"key":"1630_CR45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"M Lozano","year":"2004","unstructured":"Lozano M, Herrera F, Krasnogor N, Molina D (2004) Real-coded memetic algorithms with crossover hill-climbing. Evolut Comput 12:273\u2013302","journal-title":"Evolut Comput"},{"key":"1630_CR46","first-page":"27","volume-title":"Parallel problem solving from nature 2","author":"SW Mahfoud","year":"1992","unstructured":"Mahfoud SW (1992) Crowding and preselection revised. In: Manner R, Manderick B (eds) Parallel problem solving from nature 2. Elsevier, Amsterdam, pp 27\u201336"},{"key":"1630_CR47","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/j.ins.2010.01.007","volume":"180","author":"R Mallipeddi","year":"2010","unstructured":"Mallipeddi R, Mallipeddi S, Suganthan PN (2010) Ensemble strategies with adaptive evolutionary programming. Inf Sci 180:1571\u20131581","journal-title":"Inf Sci"},{"key":"1630_CR48","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TEVC.2009.2033582","volume":"14","author":"R Mallipeddi","year":"2010","unstructured":"Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evolut Comput 14:561\u2013579","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR49","doi-asserted-by":"crossref","unstructured":"Matsui K (1999) New selection method to improve the population diversity in genetic algorithms. In: Proceedings of IEEE international conference on systems, man, and cybernetics, pp 625\u2013630","DOI":"10.1109\/ICSMC.1999.814164"},{"key":"1630_CR50","first-page":"409","volume-title":"Proceedings of the genetic and evolutionary computation conference GECCO-99","author":"OJ Mengshoel","year":"1999","unstructured":"Mengshoel OJ, Goldberg DE (1999) Probabilistic crowding: deterministic crowding with probabilistic replacement. In: Banzhaf W et al (eds) Proceedings of the genetic and evolutionary computation conference GECCO-99. Morgan Kaufmann Publishers, San Francisco, pp 409\u2013416"},{"key":"1630_CR51","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, New York","edition":"3"},{"key":"1630_CR52","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7:308\u2013313","journal-title":"Comput J"},{"key":"1630_CR53","unstructured":"Ono I, Kobayashi S (1997) A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: Proceedings of the 7th international conference on genetic algorithms, pp 246\u2013253"},{"key":"1630_CR54","unstructured":"Price K, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization, 1st edn. Springer, New York"},{"key":"1630_CR55","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evolut Comput 13:398\u2013417","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR56","first-page":"183","volume":"2","author":"NJ Radcliffe","year":"1991","unstructured":"Radcliffe NJ (1991) Equivalence class analysis of genetic algorithms. Complex Syst 2:183\u2013205","journal-title":"Complex Syst"},{"key":"1630_CR57","unstructured":"Satoh H, Yamamura M, Kobayashi S (1996) Minimal generation gap model for GAs considering both exploration and exploitation. In: Proceedings of 4th international conference on soft computing, pp 494\u2013497"},{"key":"1630_CR58","unstructured":"Schwefel H-P (1987) Collective phenomena in evolutionary systems. In: Checkland P, Kiss I (eds) problems of constancy and change: the complementarity of systems approaches to complexity, pp 1025\u20131033"},{"key":"1630_CR59","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1162\/EVCO_a_00006","volume":"18","author":"M Serpell","year":"2010","unstructured":"Serpell M, Smith JE (2010) Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Evolut Comput 18:491\u2013514","journal-title":"Evolut Comput"},{"key":"1630_CR60","first-page":"603","volume-title":"Proceedings of the genetic and evolutionary computation conference","author":"H Shimodaira","year":"1999","unstructured":"Shimodaira H (1999) A diversity control oriented genetic algorithm (DCGA): development and experimental results. Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, San Francisco, pp 603\u2013611"},{"key":"1630_CR61","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/ICEC.1996.542382","volume-title":"Proceedings of 1996 IEEE international conference on evolutionary computation","author":"J Smith","year":"1996","unstructured":"Smith J, Fogarty TC (1996) Self-adaptation of mutation rates in a steady state genetic algorithm. Proceedings of 1996 IEEE international conference on evolutionary computation. IEEE Press, Piscataway, pp 318\u2013323"},{"key":"1630_CR62","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04199-4","volume-title":"Evolutionary algorithms: the role of mutation and recombination","author":"WM Spears","year":"2000","unstructured":"Spears WM (2000) Evolutionary algorithms: the role of mutation and recombination. Springer, Berlin"},{"key":"1630_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2012.09.014","volume":"73","author":"EG Talbi","year":"2013","unstructured":"Talbi EG, Hasle G (2013) Metaheuristics on GPUs. J Parallel Distrib Comput 73:1\u20133","journal-title":"J Parallel Distrib Comput"},{"key":"1630_CR64","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang K, Peng F, Chen G, Yao X (2014) Population-based algorithm portfolios with automated constituent algorithms selection. Inf Sci 279:94\u2013104","journal-title":"Inf Sci"},{"key":"1630_CR65","doi-asserted-by":"crossref","unstructured":"Takahashi M, Kita H (2001) A crossover operator using independent component analysis for real-coded genetic algorithm. In: Proceedings of IEEE congress on evolutionary computation, pp 643\u2013649","DOI":"10.1109\/CEC.2001.934452"},{"key":"1630_CR66","doi-asserted-by":"crossref","first-page":"3356","DOI":"10.1016\/j.amc.2009.10.027","volume":"215","author":"MF Tasgetiren","year":"2010","unstructured":"Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl Math Comput 215:3356\u20133368","journal-title":"Appl Math Comput"},{"key":"1630_CR67","doi-asserted-by":"crossref","unstructured":"Thierens D, Goldberg DE (1994) Elitist recombination: an integrated selection recombination GA. In: Proceedings of the 1st IEEE conference on evolutionary computation, pp 152\u2013159","DOI":"10.1109\/ICEC.1994.349898"},{"key":"1630_CR68","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/106365603766646816","volume":"11","author":"A Toffolo","year":"2003","unstructured":"Toffolo A, Benini E (2003) Genetic diversity as an objective in multi-objective evolutionary algorithms. Evolut Comput 11:151\u2013167","journal-title":"Evolut Comput"},{"key":"1630_CR69","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10586-012-0208-9","volume":"16","author":"J Toutouh","year":"2013","unstructured":"Toutouh J, Nesmachnow S, Alba E (2013) Fast energy-aware OLSR routing in VANETs by means of a parallel evolutionary algorithm. Cluster Comput 16:435\u2013450","journal-title":"Cluster Comput"},{"key":"1630_CR70","unstructured":"Tsutsui S, Yamamura M, Higuchi T (1999) Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference, pp 657\u2013664"},{"key":"1630_CR71","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-45712-7_45","volume-title":"Proceedings of parallel problem solving from nature VII (PPSN-2002)","author":"RK Ursem","year":"2002","unstructured":"Ursem RK (2002) Diversity-guided evolutionary algorithms. Proceedings of parallel problem solving from nature VII (PPSN-2002). Springer, New York, pp 462\u2013471"},{"key":"1630_CR72","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.engappai.2009.03.010","volume":"22","author":"P Vasant","year":"2009","unstructured":"Vasant P, Barsoum N (2009) Hybrid genetic algorithms and line search method for industrial production planning with non-linear fitness function. Eng Appl Artif Intell 22:767\u2013777","journal-title":"Eng Appl Artif Intell"},{"key":"1630_CR73","doi-asserted-by":"crossref","unstructured":"Vasant P (2010) Innovative hybrid genetic algorithms and line search method for industrial production management. In: Chis M (ed) Evolutionary computation and optimization algorithms in software engineering: application and techniques, IGI Global, Hershey, PA, USA, pp 142\u2013160","DOI":"10.4018\/978-1-61520-809-8.ch008"},{"key":"1630_CR74","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/978-3-642-30504-7_30","volume":"38","author":"P Vasant","year":"2013","unstructured":"Vasant P (2013) Hybrid mesh adaptive direct search genetic algorithms and line search approaches for fuzzy optimization problems in production planning. Intell Syst Ref Libr 38:779\u2013799","journal-title":"Intell Syst Ref Libr"},{"key":"1630_CR75","doi-asserted-by":"crossref","unstructured":"Vavak F, Fogarty TC (1996) A comparative study of steady state and generational genetic algorithms. In: Proceedings of evolutionary computing: AISB Workshop, LNCS 1143, Springer, Berlin, Heidelberg","DOI":"10.1007\/BFb0032791"},{"key":"1630_CR76","unstructured":"Voigt HM, M\u00fchlenbein H, Cvetkovic D (1995) Fuzzy recombination for the breeder genetic algorithm. In: Eshelman L (ed) Proceedings of the 6th international conference on genetic algorithms, Morgan Kaufmann, San Francisco, pp 104\u2013111"},{"key":"1630_CR77","doi-asserted-by":"crossref","unstructured":"Wakunda J, Zell A (2000) Median-selection for parallel steady-state evolution strategies. In: Proceedings of the parallel problem solving from nature, PPSN VI, LNCS 1917, Springer, Berlin, Heidelberg, pp 405\u2013414","DOI":"10.1007\/3-540-45356-3_40"},{"key":"1630_CR78","doi-asserted-by":"crossref","unstructured":"Wiese K, Goodwin SD (1999) Convergence characteristics of keep-best reproduction. In: Proceedings of selected areas in cryptography, pp 312\u2013318","DOI":"10.1145\/298151.298363"},{"key":"1630_CR79","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorem for optimization. IEEE Trans Evolut Comput 1:67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR80","volume-title":"Foundations of genetic algorithms I","author":"AH Wright","year":"1991","unstructured":"Wright AH (1991) Genetic algorithms for real parameter optimization. In: Rawlins GJE (ed) Foundations of genetic algorithms I. Morgan Kaufmann, San Mateo"},{"key":"1630_CR81","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evolut Comput 3:82\u2013102","journal-title":"IEEE Trans Evolut Comput"},{"key":"1630_CR82","doi-asserted-by":"crossref","first-page":"2815","DOI":"10.1016\/j.ins.2010.04.008","volume":"180","author":"EL Yu","year":"2010","unstructured":"Yu EL, Suganthan PN (2010) Ensemble of niching algorithms. Inf Sci 180:2815\u20132833","journal-title":"Inf Sci"},{"key":"1630_CR83","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2012.09.004","volume":"9","author":"SZ Zhao","year":"2013","unstructured":"Zhao SZ, Suganthan PN (2013) Empirical investigations into the exponential crossover of differential evolutions. Swarm Evolut Comput 9:27\u201336","journal-title":"Swarm Evolut Comput"},{"key":"1630_CR84","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TEVC.2011.2166159","volume":"16","author":"SZ Zhao","year":"2012","unstructured":"Zhao SZ, Suganthan PN, Zhang Q (2012) Decomposition based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes. IEEE Trans Evolut Comput 16:442\u2013446","journal-title":"IEEE Trans Evolut Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1630-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1630-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:20:50Z","timestamp":1566429650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1630-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,19]]},"references-count":84,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["1630"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1630-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,19]]}}}