{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:09:28Z","timestamp":1725822568824},"publisher-location":"Berlin, Heidelberg","reference-count":111,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662435045"},{"type":"electronic","value":"9783662435052"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-43505-2_52","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T20:47:54Z","timestamp":1432846074000},"page":"1047-1060","source":"Crossref","is-referenced-by-count":2,"title":["Memetic and Hybrid Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Jhon Edgar","family":"Amaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Cotta Porras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio J.","family":"Fern\u00e1ndez Leiva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"52_CR1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"C. Blum, A. Roli: Metaheuristics in combinatorial optimization: Overview and conceptual comparison, ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"52_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. Macready: No free lunch theorems for optimization, IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"52_CR3","first-page":"113","volume":"3562","author":"J. Puchinger","year":"2005","unstructured":"J. Puchinger, G.R. Raidl: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification, Lect. Notes Comput. Sci. 3562, 113\u2013124 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"52_CR4","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TSMCB.2003.818432","volume":"34","author":"M. Milano","year":"2004","unstructured":"M. Milano, A. Roli: MAGMA: A multiagent architecture for metaheuristics, IEEE Trans. Syst. Man Cybern. Part B 34(2), 925\u2013941 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"1","key":"52_CR5","first-page":"5","volume":"5","author":"E.-G. Talbi","year":"2006","unstructured":"E.-G. Talbi, V. Bachelet: COSEARCH: A parallel cooperative metaheuristic, J. Math. Model, Algorithms 5(1), 5\u201322 (2006)","journal-title":"Algorithms"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume":"2079","author":"P. Cowling","year":"2001","unstructured":"P. Cowling, G. Kendall, E. Soubeiga: A hyperheuristic approach to scheduling a sales summit, Lect. Notes Comput. Sci. 2079, 176\u2013190 (2001)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and Multilevel Metaheuristics","author":"K. Chakhlevitch","year":"2008","unstructured":"K. Chakhlevitch, P.I. Cowling: Hyperheuristics: Recent developments. In: Adaptive and Multilevel Metaheuristics, Studies in Computational Intelligence, Vol. 136, ed. by C. Cotta, M. Sevaux, K. S\u00f6rensen (Springer, Berlin 2008) pp. 3\u201329"},{"key":"52_CR8","volume-title":"The Selfish Gene","author":"R. Dawkins","year":"1976","unstructured":"R. Dawkins: The Selfish Gene (Clarendon, Oxford 1976)"},{"key":"52_CR9","volume-title":"On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826","author":"P. Moscato","year":"1989","unstructured":"P. Moscato: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826 (California Institute of Technology, Pasadena 1989)"},{"unstructured":"R. Santana, C. Bielza, P. Larranaga: Network Measures for Re-using Problem Information in EDAs. Technical Report UPM-FI\/DIA\/2010-3 (Department of Artificial Intelligence, Faculty of Informatics, Technical University of Madrid 2010)","key":"52_CR10"},{"key":"52_CR11","first-page":"1558","volume-title":"Proc. 1999 Congr. Evol. Comput.","author":"C. Cotta","year":"1999","unstructured":"C. Cotta, E. Alba, J.M. Troya: Stochastic reverse hillclimbing and iterated local search, Proc. 1999 Congr. Evol. Comput. (IEEE Neural Network Council -- Evolutionary Programming Society -- Institution of Electrical Engineers, Washington 1999) pp. 1558\u20131565"},{"key":"52_CR12","first-page":"3","volume-title":"4th Int. Conf. Bioinspired Optim. Methods Appl. (BIOMA 2010)","author":"C. Blum","year":"2010","unstructured":"C. Blum, J. Puchinger, G. Raidl, A. Roli: A brief survey on hybrid metaheuristics, 4th Int. Conf. Bioinspired Optim. Methods Appl. (BIOMA 2010), ed. by B. Filipic, J. Silc (Ljubljana, Slovenia 2010) pp. 3\u201316"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.-G. Talbi","year":"2002","unstructured":"E.-G. Talbi: A taxonomy of hybrid metaheuristics, J. Heuristics 8, 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"key":"52_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/0471739383.ch15","volume-title":"Parallel Metaheuristics","author":"C. Cotta","year":"2005","unstructured":"C. Cotta, E.G. Talbi, E. Alba: Parallel hybrid metaheuristics. In: Parallel Metaheuristics, ed. by E. Alba (Wiley-Interscience, Hoboken 2005) pp. 347\u2013370"},{"key":"52_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11546245_4","volume":"3636","author":"M. El-Abd","year":"2005","unstructured":"M. El-Abd, M. Kamel: A taxonomy of cooperative search algorithms, Lect. Notes Comput. Sci. 3636, 32\u201341 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11890584_1","volume":"4030","author":"G. Raidl","year":"2006","unstructured":"G. Raidl: A unified view on hybrid metaheuristics, Lect. Notes Comput. Sci. 4030, 1\u201312 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"3","key":"52_CR17","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L. Jourdan","year":"2009","unstructured":"L. Jourdan, M. Basseur, E.-G. Talbi: Hybridizing exact methods and metaheuristics: A taxonomy, Eur. J. Oper. Res. 199(3), 620\u2013629 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR18","volume-title":"Handbook of Evolutionary Computation","author":"Z. Michalewicz","year":"1997","unstructured":"Z. Michalewicz: Decoders. In: Handbook of Evolutionary Computation, ed. by T. B\u00e4ck, D.B. Fogel, Z. Michalewicz (Institute of Physics Publishing and Oxford Univ. Press, Bristol 1997)"},{"key":"52_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"P.C. Chu, J.E. Beasley: A genetic algorithm for the multidimensional knapsack problem, J. Heuristics 4, 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R.H. Storer","year":"1992","unstructured":"R.H. Storer, S.D. Wu, R. Vaccari: New search spaces for sequencing problems with application to job-shop scheduling, Manag. Sci. 38, 1495\u20131509 (1992)","journal-title":"Manag. Sci."},{"key":"52_CR21","first-page":"251","volume-title":"Artificial Neural Nets and Genetic Algorithms 3","author":"C. Cotta","year":"1998","unstructured":"C. Cotta, J.M. Troya: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Artificial Neural Nets and Genetic Algorithms 3, ed. by G.D. Smith, N.C. Steele, R.F. Albrecht (Springer, Wien 1998) pp. 251\u2013255"},{"key":"52_CR22","volume-title":"Proc. 20th Inf. Oper. Res. Meet., Buenos Aires","author":"M.G. Norman","year":"1989","unstructured":"M.G. Norman, P. Moscato: A competitive and cooperative approach to complex combinatorial search, Proc. 20th Inf. Oper. Res. Meet., Buenos Aires (1989), pp. 3.15\u20133.29"},{"issue":"1","key":"52_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"S.W. Mahfoud","year":"1995","unstructured":"S.W. Mahfoud, D.E. Goldberg: Parallel recombinative simulated annealing: A genetic algorithm, Parallel Comput. 21(1), 1\u201328 (1995)","journal-title":"Parallel Comput."},{"key":"52_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurant","year":"1996","unstructured":"C. Fleurant, J.A. Ferland: Genetic and hybrid algorithms for graph coloring, Ann. Oper. Res. 63, 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"key":"52_CR25","first-page":"114","volume-title":"2nd IEEE Conf. Evol. Comput. ICEC'95","author":"H. Kim","year":"1995","unstructured":"H. Kim, Y. Hayashi, K. Nara: The performance of hybridized algorithm of genetic algorithm simulated annealing and Tabu search for thermal unit maintenance scheduling, 2nd IEEE Conf. Evol. Comput. ICEC'95 (Perth, Australia 1995) pp. 114\u2013119"},{"issue":"4","key":"52_CR26","first-page":"226","volume":"32","author":"J. Thiel","year":"1994","unstructured":"J. Thiel, S. Voss: Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms, INFOR 32(4), 226\u2013242 (1994)","journal-title":"INFOR"},{"key":"52_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"C.-F. Liaw","year":"2000","unstructured":"C.-F. Liaw: A hybrid genetic algorithm for the open shop scheduling problem, Eur. J. Oper. Res. 124, 28\u201342 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/347792.347801","volume":"4","author":"E.K. Burke","year":"1999","unstructured":"E.K. Burke, A.J. Smith: A memetic algorithm to schedule planned maintenance for the national grid, J. Exp. Algorithmics 4, 1\u201313 (1999)","journal-title":"J. Exp. Algorithmics"},{"issue":"4","key":"52_CR29","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1016\/j.asoc.2009.03.005","volume":"9","author":"J.E. Gallardo","year":"2009","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: Finding low autocorrelation binary sequences with memetic algorithms, Appl. Soft Comput. 9(4), 1252\u20131262 (2009)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"52_CR30","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/TMAG.2009.2012741","volume":"45","author":"F. Campelo","year":"2009","unstructured":"F. Campelo, F.G. Guimaraes, J.A. Ramirez, H. Igarashi: Hybrid estimation of distribution algorithm using local function approximations, IEEE Trans. Magn. 45(3), 1558\u20131561 (2009)","journal-title":"IEEE Trans. Magn."},{"issue":"2","key":"52_CR31","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.cor.2007.10.001","volume":"36","author":"M. Laguna","year":"2009","unstructured":"M. Laguna, A. Duarte, R. Mart: Hybridizing the cross-entropy method: An application to the max-cut problem, Comput. Oper. Res. 36(2), 487\u2013498 (2009)","journal-title":"Comput. Oper. Res."},{"key":"52_CR32","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10732-007-9049-8","volume":"14","author":"R. Santana","year":"2008","unstructured":"R. Santana, P. Larra\u00f1aga, J.A. Lozano: Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem, J. Heuristics 14, 519\u2013547 (2008)","journal-title":"J. Heuristics"},{"issue":"3","key":"52_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"P. Hansen, N. Mladenovi\u0107: Variable neighborhood search: Principles and applications, Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR34","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-32494-1_12","volume-title":"Towards a New Evolutionary Computation","author":"Q. Zhang","year":"2006","unstructured":"Q. Zhang, J. Sun, E. Tsang, J. Ford: Estimation of distribution algorithm with 2-opt local search for the quadratic assignment problem. In: Towards a New Evolutionary Computation, Studies in Fuzziness and Soft Computing, Vol. 192, ed. by J. Lozano, P. Larra\u00f1aga, I. Inza, E. Bengoetxea (Springer, Berlin, Heidelberg 2006) pp. 281\u2013292"},{"key":"52_CR35","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-24677-0_38","volume":"3029","author":"J.M. Pe\u00f1a","year":"2004","unstructured":"J.M. Pe\u00f1a, V. Robles, P. Larra\u00f1aga, V. Herves, F. Rosales, M.S. Prez: GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms, Lect. Notes Comput. Sci. 3029, 361\u2013371 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR36","first-page":"80","volume-title":"3rd Int. Conf. Nat. Comput. (ICNC 2007)","author":"Y. Zhou","year":"2007","unstructured":"Y. Zhou, J. Wang, J. Yin: A\u00a0discrete estimation of distribution particle swarm optimization for combinatorial optimization problems, 3rd Int. Conf. Nat. Comput. (ICNC 2007) (2007) pp. 80\u201384"},{"key":"52_CR37","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ins.2010.07.014","volume":"192","author":"C.W. Ahn","year":"2012","unstructured":"C.W. Ahn, J. An, J.-C. Yoo: Estimation of\u00a0particle swarm distribution algorithms: Combining the benefits of\u00a0PSO and\u00a0EDAs, Inf. Sci. 192, 109\u2013119 (2012)","journal-title":"Inf. Sci."},{"key":"52_CR38","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-7091-7535-4_73","volume-title":"Artificial Neural Nets and Genetic Algorithms 2","author":"C. Cotta","year":"1995","unstructured":"C. Cotta, J.F. Aldana, A.J. Nebro, J.M. Troya: Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP. In: Artificial Neural Nets and Genetic Algorithms 2, ed. by D.W. Pearson, N.C. Steele, R.F. Albrecht (Springer, Wien 1995) pp. 277\u2013280"},{"issue":"2","key":"52_CR39","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021934325079","volume":"18","author":"C. Cotta","year":"2003","unstructured":"C. Cotta, J.M. Troya: Embedding branch and bound within evolutionary algorithms, Appl. Intell. 18(2), 137\u2013153 (2003)","journal-title":"Appl. Intell."},{"key":"52_CR40","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-24652-7_17","volume":"3004","author":"J. Puchinger","year":"2004","unstructured":"J. Puchinger, G.R. Raidl, G. Koller: Solving a real-world glass cutting problem, Lect. Notes Comput. Sci. 3004, 165\u2013176 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR41","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-24650-3_11","volume":"3003","author":"K. Kostikas","year":"2004","unstructured":"K. Kostikas, C. Fragakis: Genetic programming applied to mixed integer programming, Lect. Notes Comput. Sci. 3003, 113\u2013124 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR42","first-page":"2317","volume-title":"6th Int. Conf. Evol. Comput. IEEE","author":"J. Denzinger","year":"1999","unstructured":"J. Denzinger, T. Offermann: On cooperation between evolutionary algorithms and other search paradigms, 6th Int. Conf. Evol. Comput. IEEE (1999) pp. 2317\u20132324"},{"key":"52_CR43","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11499305_3","volume":"3562","author":"J.E. Gallardo","year":"2005","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: Solving the multidimensional knapsack problem using an\u00a0evolutionary algorithm hybridized with branch and bound, Lect. Notes Comput. Sci. 3562, 21\u201330 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR44","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11844297_22","volume":"4193","author":"J.E. Gallardo","year":"2006","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: A multi-level memetic\/exact hybrid algorithm for the still life problem, Lect. Notes Comput. Sci. 4193, 212\u2013221 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"1","key":"52_CR45","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TSMCB.2006.883266","volume":"37","author":"J.E. Gallardo","year":"2007","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: On the hybridization of memetic algorithms with branch-and-bound techniques, IEEE Trans. Syst. Man Cybern. Part B 37(1), 77\u201383 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"52_CR46","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/9789812708892_0003","volume-title":"Analysis of Biological Data: A Soft Computing Approach","author":"J.E. Gallardo","year":"2007","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: Reconstructing phylogenies with memetic algorithms and branch-and-bound. In: Analysis of Biological Data: A Soft Computing Approach, ed. by S. Bandyopadhyay, U. Maulik, J.T.-L. Wang (World Scientific, Singapore 2007) pp. 59\u201384"},{"key":"52_CR47","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"P. Moscato: Memetic algorithms: A short introduction. In: New Ideas in Optimization, ed. by D. Corne, M. Dorigo, F. Glover (McGraw-Hill, Maidenhead 1999) pp. 219\u2013234"},{"key":"52_CR48","volume-title":"The Traveling Salesman. Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"G. Reinelt: The Traveling Salesman. Computational Solutions for TSP Applications (Springer, Berlin, Heidelberg 1994)"},{"key":"52_CR49","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/s001700200179","volume":"20","author":"W.-C. Yeh","year":"2002","unstructured":"W.-C. Yeh: A memetic algorithm of the $\\text{n}\/2\/$Flowshop\/\u03b1$F{}+\\beta C_{{\\max}}$ scheduling problem, Int. J. Adv. Manuf. Technol. 20, 464\u2013473 (2002)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"52_CR50","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00205-9","volume":"145","author":"R. Varela","year":"2003","unstructured":"R. Varela, J. Puente, C.R. Vela, A. G\u00f3mez: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks, Eur. J. Oper. Res. 145(1), 57\u201371 (2003)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"O.\u00a0Rossi-Doria, B.\u00a0Paechter: A\u00a0memetic algorithm for university course timetabling. In: Combinatorial Optimisation 2004 Book of Abstracts, Lancaster 2004, p.\u00a056, ed. by Lancaster University","key":"52_CR51"},{"key":"52_CR52","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-58484-6_252","volume":"866","author":"A.E. Eiben","year":"1994","unstructured":"A.E. Eiben, P.-E. Raue, Z. Ruttkay: Genetic algorithms with multi-parent recombination, Lect. Notes Comput. Sci. 866, 78\u201387 (1994)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR53","first-page":"284","volume-title":"Foundations of Genetic Algorithms I","author":"B.R. Fox","year":"1991","unstructured":"B.R. Fox, M.B. McMahon: Genetic operators for sequencing problems. In: Foundations of Genetic Algorithms I, ed. by G.J.E. Rawlins (Morgan Kaufmann, San Mateo 1991) pp. 284\u2013300"},{"key":"52_CR54","first-page":"221","volume-title":"Parallel Problem Solving From Nature II","author":"K. Mathias","year":"1992","unstructured":"K. Mathias, L.D. Whitley: Genetic operators, the fitness landscape and the traveling salesman problem. In: Parallel Problem Solving From Nature II, ed. by R. M\u00e4nner, B. Manderick (Elsevier Science B.V., Amsterdam 1992) pp. 221\u2013230"},{"key":"52_CR55","first-page":"154","volume-title":"Proc. 1st Int. Conf. Genet. Algorithms","author":"D.E. Goldberg","year":"1985","unstructured":"D.E. Goldberg, R. Lingle Jr.: Alleles, loci and the traveling salesman problem, Proc. 1st Int. Conf. Genet. Algorithms, ed. by J.J. Grefenstette (Lawrence Erlbaum Associates, Hillsdale 1985) pp. 154\u2013159"},{"issue":"1","key":"52_CR56","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1162\/evco.1998.6.1.25","volume":"6","author":"C. Cotta","year":"1998","unstructured":"C. Cotta, J.M. Troya: Genetic forma recombination in permutation flowshop problems, Evol. Comput. 6(1), 25\u201344 (1998)","journal-title":"Evol. Comput."},{"issue":"4","key":"52_CR57","first-page":"369","volume":"4","author":"Y. Davidor","year":"1990","unstructured":"Y. Davidor: Epistasis variance: Suitability of a representation to genetic algorithms, Complex Syst. 4(4), 369\u2013383 (1990)","journal-title":"Complex Syst."},{"key":"52_CR58","first-page":"23","volume-title":"Foundations of Genetic Algorithms I","author":"Y. Davidor","year":"1991","unstructured":"Y. Davidor: Epistasis variance: A viewpoint on GA-hardness. In: Foundations of Genetic Algorithms I, ed. by G.J.E. Rawlins (Morgan Kaufmann, San Mateo 1991) pp. 23\u201335"},{"key":"52_CR59","first-page":"51","volume-title":"Foundations of Genetic Algorithms III","author":"N.J. Radcliffe","year":"1994","unstructured":"N.J. Radcliffe, P.D. Surry: Fitness variance of formae and performance prediction. In: Foundations of Genetic Algorithms III, ed. by L.D. Whitley, M.D. Vose (Morgan Kaufmann, San Francisco 1994) pp. 51\u201372"},{"key":"52_CR60","first-page":"143","volume-title":"Proc. 4th Int. Conf. Genet. Algorithms","author":"B. Manderick","year":"1991","unstructured":"B. Manderick, M. de Weger, P. Spiessens: The genetic algorithm and the structure of the fitness landscape, Proc. 4th Int. Conf. Genet. Algorithms, ed. by R.K. Belew, L.B. Booker (Morgan Kaufmann, San Mateo 1991) pp. 143\u2013150"},{"key":"52_CR61","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-58484-6_251","volume":"866","author":"J. Dzubera","year":"1994","unstructured":"J. Dzubera, L.D. Whitley: Advanced correlation analysis of operators for the traveling salesman problem, Lect. Notes Comput. Sci. 866, 68\u201377 (1994)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR62","volume-title":"Artificial Intelligence Through Simulated Evolution","author":"L.J. Fogel","year":"1966","unstructured":"L.J. Fogel, A.J. Owens, M.J. Walsh: Artificial Intelligence Through Simulated Evolution (Wiley, New York 1966)"},{"key":"52_CR63","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-48584-1_1","volume-title":"Evolutionary Scheduling","author":"C. Cotta","year":"2007","unstructured":"C. Cotta, A.J. Fern\u00e1ndez: Memetic algorithms in planning, scheduling, and timetabling. In: Evolutionary Scheduling, Studies in Computational Intelligence, Vol. 49, ed. by K. Dahal, K.C. Tan, P.I. Cowling (Springer, Berlin, Heidelberg 2007) pp. 1\u201330"},{"key":"52_CR64","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C. O\u011fuz","year":"2005","unstructured":"C. O\u011fuz, M.F. Ercan: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, J. Sched. 8, 323\u2013351 (2005)","journal-title":"J. Sched."},{"key":"52_CR65","volume-title":"Handbook of Evolutionary Computation","author":"T. Ibaraki","year":"1997","unstructured":"T. Ibaraki: Combination with dynamic programming. In: Handbook of Evolutionary Computation, ed. by T. B\u00e4ck, D. Fogel, Z. Michalewicz (Oxford Univ. Press, New York 1997), pp. D3.4:1\u20132"},{"key":"52_CR66","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11730095_7","volume":"3906","author":"J.E. Gallardo","year":"2006","unstructured":"J.E. Gallardo, C. Cotta, A.J. Fern\u00e1ndez: A memetic algorithm with bucket elimination for the still life problem, Lect. Notes Comput. Sci. 3906, 73\u201385 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR67","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2003","unstructured":"P. Moscato, C. Cotta: A gentle introduction to memetic algorithms. In: Handbook of Metaheuristics, ed. by F. Glover, G. Kochenberger (Kluwer, Boston 2003) pp. 105\u2013144"},{"key":"52_CR68","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-39930-8_3","volume-title":"New Optimization Techniques in Engineering","author":"P. Moscato","year":"2004","unstructured":"P. Moscato, C. Cotta, A.S. Mendes: Memetic algorithms. In: New Optimization Techniques in Engineering, ed. by G.C. Onwubolu, B.V. Babu (Springer, Berlin, Heidelberg 2004) pp. 53\u201385"},{"key":"52_CR69","first-page":"450","volume-title":"Proc. 17th Int. Conf. Genet. Algorithms (ICGA)","author":"Y. Nagata","year":"1997","unstructured":"Y. Nagata, S. Kobayashi: Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem, Proc. 17th Int. Conf. Genet. Algorithms (ICGA), ed. by T. B\u00e4ck (Morgan Kaufmann, San Mateo 1997) pp. 450\u2013457"},{"key":"52_CR70","series-title":"Ph.D. Thesis","volume-title":"Evolutionary Algorithms, Fitness Landscapes and Search","author":"T.C. Jones","year":"1995","unstructured":"T.C. Jones: Evolutionary Algorithms, Fitness Landscapes and Search, Ph.D. Thesis (University of New Mexico, Albuquerque 1995)"},{"key":"52_CR71","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-23247-3_4","volume-title":"Handbook of Memetic Algorithms","author":"F. Neri","year":"2012","unstructured":"F. Neri, C. Cotta: A primer on memetic algorithms. In: Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379, ed. by F. Neri, C. Cotta, P. Moscato (Springer, Berlin, Heidelberg 2012) pp. 43\u201352"},{"key":"52_CR72","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F. Neri","year":"2012","unstructured":"F. Neri, C. Cotta: Memetic algorithms and memetic computing optimization: A literature review, Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"52_CR73","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-23247-3_5","volume-title":"Handbook of Memetic Algorithms","author":"D. Sudholt","year":"2012","unstructured":"D. Sudholt: Parametrization and balancing local and global search. In: Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379, ed. by F. Neri, C. Cotta, P. Moscato (Springer, Berlin, Heidelberg 2012) pp. 55\u201372"},{"key":"52_CR74","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/3-540-45712-7_74","volume":"2439","author":"N. Krasnogor","year":"2002","unstructured":"N. Krasnogor, B.P. Blackburne, E.K. Burke, J.D. Hirst: Multimeme algorithms for protein structure prediction, Lect. Notes Comput. Sci. 2439, 769\u2013778 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR75","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45712-7_52","volume":"2439","author":"J.E. Smith","year":"2002","unstructured":"J.E. Smith: Co-evolution of memetic algorithms: Initial investigations, Lect. Notes Comput. Sci. 2439, 537\u2013548 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"52_CR76","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/B:GENP.0000023687.41210.d7","volume":"5","author":"N. Krasnogor","year":"2004","unstructured":"N. Krasnogor: Self generating metaheuristics in bioinformatics: The proteins structure comparison case, Genet. Program. Evol. Mach. 5(2), 181\u2013201 (2004)","journal-title":"Genet. Program. Evol. Mach."},{"issue":"1","key":"52_CR77","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N. Krasnogor","year":"2004","unstructured":"N. Krasnogor, S.M. Gustafson: A study on the use of \u201cself-generation\u201d in memetic algorithms, Nat. Comput. 3(1), 53\u201376 (2004)","journal-title":"Nat. Comput."},{"issue":"1","key":"52_CR78","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TSMCB.2006.883273","volume":"37","author":"J.E. Smith","year":"2007","unstructured":"J.E. Smith: Coevolving memetic algorithms: A review and progress report, IEEE Trans. Syst. Man Cybern. Part B 37(1), 6\u201317 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"52_CR79","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1145\/1276958.1277219","volume-title":"GECCO '07: Proc. 9th Annu. Conf. Genet. Evol. Comput. Conf.","author":"J.E. Smith","year":"2007","unstructured":"J.E. Smith: Credit assignment in adaptive memetic algorithms, GECCO '07: Proc. 9th Annu. Conf. Genet. Evol. Comput. Conf., ed. by H. Lipson (2007) pp. 1412\u20131419"},{"issue":"2","key":"52_CR80","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"Y.-S. Ong","year":"2004","unstructured":"Y.-S. Ong, A.J. Keane: Meta-Lamarckian learning in memetic algorithms, IEEE Trans. Evol. Comput. 8(2), 99\u2013110 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"H.G. Cobb: An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments. Technical Report AIC-90-001 (Naval Research Laboratory, Washington, DC 1990)","key":"52_CR81","DOI":"10.21236\/ADA229159"},{"key":"52_CR82","first-page":"137","volume-title":"Parallel Problem Solving from Nature II","author":"J.J. Grefenstette","year":"1992","unstructured":"J.J. Grefenstette: Genetic algorithms for changing environments. In: Parallel Problem Solving from Nature II, ed. by R. M\u00e4nner, B. Manderick (Elsevier, Amsterdam 1992) pp. 137\u2013144"},{"key":"52_CR83","first-page":"265","volume-title":"Foundations of Genetic Algorithms I","author":"L.J. Eshelman","year":"1991","unstructured":"L.J. Eshelman: The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Foundations of Genetic Algorithms I, ed. by G.J.E. Rawlins (Morgan Kaufmann, San Mateo 1991) pp. 265\u2013283"},{"key":"52_CR84","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Methodology and Implementations in\u00a0C","author":"M. Laguna","year":"2003","unstructured":"M. Laguna, R. Marti: Scatter search. In: Methodology and Implementations in\u00a0C, Operations Research\/Computer Science Interfaces, Vol. 24, ed. by R. Sharda, S. Vo\u00df (Kluwer, Boston 2003)"},{"key":"52_CR85","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","volume":"151","author":"M. Sevaux","year":"2003","unstructured":"M. Sevaux, S. Dauz\u00e8re-P\u00e9r\u00e9s: Genetic algorithms to minimize the weighted number of late jobs on a single machine, Eur. J. Oper. Res. 151, 296\u2013306 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR86","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume":"1153","author":"E.K. Burke","year":"1996","unstructured":"E.K. Burke, J. Newall, R. Weare: A memetic algorithm for university exam timetabling, Lect. Notes Comput. Sci. 1153, 241\u2013250 (1996)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR87","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"P.M. Fran\u00e7a","year":"2005","unstructured":"P.M. Fran\u00e7a, J.N.D. Gupta, A.S. Mendes, P. Moscato, K.J. Veltnik: Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups, Comput. Ind. Eng. 48, 491\u2013506 (2005)","journal-title":"Comput. Ind. Eng."},{"key":"52_CR88","volume-title":"Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time","author":"M. Tomassini","year":"2005","unstructured":"M. Tomassini: Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Springer, New York 2005)"},{"issue":"5","key":"52_CR89","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1016\/j.cor.2004.09.011","volume":"33","author":"K. S\u00f6rensen","year":"2006","unstructured":"K. S\u00f6rensen, M. Sevaux: MA$|$PM: Memetic algorithms with population management, Comput. Oper. Res. 33(5), 1214\u20131225 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"52_CR90","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1162\/evco.2008.16.3.315","volume":"16","author":"O.J. Mengshoel","year":"2008","unstructured":"O.J. Mengshoel, D.E. Goldberg: The crowding approach to niching in genetic algorithms, Evol. Comput. 16(3), 315\u2013354 (2008)","journal-title":"Evol. Comput."},{"key":"52_CR91","first-page":"41","volume-title":"Proc. 2nd Int. Conf. Genet. Algorithms Genet. Algorithms Appl.","author":"D.E. Goldberg","year":"1987","unstructured":"D.E. Goldberg, J. Richardson: Genetic algorithms with sharing for multimodal function optimization, Proc. 2nd Int. Conf. Genet. Algorithms Genet. Algorithms Appl. (L. Erlbaum Associates, Hillsdale 1987) pp. 41\u201349"},{"issue":"2","key":"52_CR92","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"Y.-S. Ong","year":"2010","unstructured":"Y.-S. Ong, M.-H. Lim, X. Chen: Memetic computation \u2013 Past, present and future, IEEE Comput. Intell. Mag. 5(2), 24\u201331 (2010)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"52_CR93","first-page":"2379","volume-title":"IEEE Int. Conf. Syst. Man Cybern.","author":"M. Toulouse","year":"1998","unstructured":"M. Toulouse, T.G. Crainic, B. Sanso, K. Thulasiraman: Self-organization in cooperative Tabu search algorithms, IEEE Int. Conf. Syst. Man Cybern., Vol. 3 (1998) pp. 2379\u20132384"},{"issue":"1","key":"52_CR94","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.parco.2002.07.001","volume":"30","author":"M. Toulouse","year":"2004","unstructured":"M. Toulouse, T.G. Crainic, B. Sans: Systemic behavior of cooperative search algorithms, Parallel Comput. 30(1), 57\u201379 (2004)","journal-title":"Parallel Comput."},{"key":"52_CR95","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-92695-5_8","volume":"5313","author":"T.G. Crainic","year":"2008","unstructured":"T.G. Crainic, M. Toulouse: Explicit and emergent cooperation schemes for search algorithms, Lect. Notes Comput. Sci. 5313, 95\u2013109 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"52_CR96","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-48311-X_75","volume":"1685","author":"M. Toulouse","year":"1999","unstructured":"M. Toulouse, K. Thulasiraman, F. Glover: Multi-level cooperative search: A new paradigm for combinatorial optimization and an application to graph partitioning, Lect. Notes Comput. Sci. 1685, 533\u2013542 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"6","key":"52_CR97","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1023\/A:1020325926188","volume":"8","author":"T.G. Crainic","year":"2002","unstructured":"T.G. Crainic, M. Gendreau: Cooperative parallel tabu search for capacitated network design, J. Heuristics 8(6), 601\u2013627 (2002)","journal-title":"J. Heuristics"},{"key":"52_CR98","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"T.G. Crainic","year":"2004","unstructured":"T.G. Crainic, M. Gendreau, P. Hansen, N. Mladenovi\u0107: Cooperative parallel variable neighborhood search for the p-median, J. Heuristics 10, 293\u2013314 (2004)","journal-title":"J. Heuristics"},{"key":"52_CR99","doi-asserted-by":"publisher","first-page":"1849","DOI":"10.1016\/j.ins.2005.06.007","volume":"176","author":"D. Pelta","year":"2006","unstructured":"D. Pelta, C. Cruz, A. Sancho-Royo, J. Verdegay: Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization, Inf. Sci. 176, 1849\u20131868 (2006)","journal-title":"Inf. Sci."},{"issue":"1","key":"52_CR100","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.asoc.2007.12.007","volume":"9","author":"C. Cruz","year":"2009","unstructured":"C. Cruz, D. Pelta: Soft computing and cooperative strategies for optimization, Appl. Soft Comput. 9(1), 30\u201338 (2009)","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"52_CR101","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A. LeBouthillier","year":"2005","unstructured":"A. LeBouthillier, T.G. Crainic: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Comput. Oper. Res. 32(7), 1685\u20131708 (2005)","journal-title":"Comput. Oper. Res."},{"key":"52_CR102","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-16693-8_42","volume":"6421","author":"D. Barbucha","year":"2010","unstructured":"D. Barbucha: Synchronous vs. asynchronous cooperative approach to solving the vehicle routing problem, Lect. Notes Comput. Sci. 6421, 403\u2013412 (2010)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"52_CR103","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.amc.2005.08.045","volume":"175","author":"K.S. Leung","year":"2006","unstructured":"K.S. Leung, I. King, Y.B. Wong: A probabilistic cooperative-competitive hierarchical model for global optimization, Appl. Math. Comput. 175(2), 1092\u20131124 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"52_CR104","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S.T. Barnard","year":"1994","unstructured":"S.T. Barnard, H.D. Simon: Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurr. Pract. Exp. 6(2), 101\u2013117 (1994)","journal-title":"Concurr. Pract. Exp."},{"issue":"5","key":"52_CR105","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.50.5.862.373","volume":"50","author":"C. Walshaw","year":"2002","unstructured":"C. Walshaw: A multilevel approach to the travelling salesman problem, Oper. Res. 50(5), 862\u2013877 (2002)","journal-title":"Oper. Res."},{"key":"52_CR106","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.endm.2010.05.005","volume":"36","author":"L. Hulianytskyi","year":"2010","unstructured":"L. Hulianytskyi, S. Sirenko: Cooperative model-based metaheuristics, Electron. Notes Discret. Math. 36, 33\u201340 (2010)","journal-title":"Electron. Notes Discret. Math."},{"key":"52_CR107","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s12293-011-0059-6","volume":"3","author":"J. Amaya","year":"2011","unstructured":"J. Amaya, C. Cotta, A.J. Fern\u00e1ndez-Leiva: Memetic cooperative models for the tool switching problem, Memetic Comput. 3, 199\u2013216 (2011)","journal-title":"Memetic Comput."},{"key":"52_CR108","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-1-4419-1665-5_6","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2010","unstructured":"P. Moscato, C. Cotta: A modern introduction to memetic algorithms. In: Handbook of Metaheuristics, International Series in Operations Research and Management Science, Vol. 146, ed. by M. Gendreau, J.Y. Potvin (Springer, New York, Dordrecht, Heidelberg, London 2010) pp. 141\u2013183"},{"key":"52_CR109","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23247-3","volume-title":"Handbook of Memetic Algorithms","author":"F. Neri","year":"2012","unstructured":"F. Neri, C. Cotta, P. Moscato: Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379 (Springer, Berlin, Heidelberg 2012)"},{"key":"52_CR110","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-23247-3_6","volume-title":"Handbook of Memetic Algorithms","author":"J.-K. Hao","year":"2012","unstructured":"J.-K. Hao: Memetic algorithms in discrete optimization. In: Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379, ed. by F. Neri, C. Cotta, P. Moscato (Springer, Berlin, Heidelberg 2012) pp. 73\u201395"},{"key":"52_CR111","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-23247-3_7","volume-title":"Handbook of Memetic Algorithms","author":"P. Merz","year":"2012","unstructured":"P. Merz: Memetic algorithms and fitness landscapes in combinatorial optimization. In: Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379, ed. by F. Neri, C. Cotta, P. Moscato (Springer, Berlin, Heidelberg 2012) pp. 96\u2013122"}],"container-title":["Springer Handbook of Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43505-2_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T23:23:37Z","timestamp":1691709817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43505-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662435045","9783662435052"],"references-count":111,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43505-2_52","relation":{},"subject":[],"published":{"date-parts":[[2015]]}}}