{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:39:31Z","timestamp":1725539971384},"publisher-location":"London","reference-count":18,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848829824"},{"type":"electronic","value":"9781848829831"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-84882-983-1_19","type":"book-chapter","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T16:58:27Z","timestamp":1256662707000},"page":"263-276","source":"Crossref","is-referenced-by-count":1,"title":["On the Structure of a Best Possible Crossover Selection Strategy in Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"L\u00e4ssig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl Heinz","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,19]]},"reference":[{"key":"19_CR1","unstructured":"S. Boettcher and A. G. Percus. Extremal Optimization: Methods derived from Co-Evolution. In GECCO-99, Proceedings of the Genetic and Evolutionary Computation Conference, pages 825\u2013832, Orlando, Florida, July 1999."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0951-8320(00)00109-5","volume":"72","author":"P. G. Busacca","year":"2001","unstructured":"P. G. Busacca, M. Marseguerra, and E. Zio. Multiobjective Optimization by Genetic Algorithms: Application to Safety Systems. Reliability Engineering & System Safety, 72(1):59\u201374, April 2001.","journal-title":"Reliability Engineering & System Safety"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"M. Chakraborty and U. K. Chakraborty. An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms. In Proceedings of the International Conference on Information, Communications and Signal Processing, pages 407\u2013411, Singapore, September 1997.","DOI":"10.1109\/ICICS.1997.647128"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1162\/evco.1996.4.2.133","volume":"4","author":"U. K. Chakraborty","year":"1997","unstructured":"U. K. Chakraborty, K. Deb, and M. Chakraborty. Analysis of Selection Algorithms: A Markov Chain Approach. Evolutionary Computation, 4(2):133\u2013167, 1997.","journal-title":"Evolutionary Computation"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics, 90:161\u2013175, 1990.","journal-title":"Journal of Computational Physics"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1006\/jcph.2001.6975","volume":"176","author":"A. Franz","year":"2002","unstructured":"A. Franz and K. H. Hoffmann. Optimal Annealing Schedules for a Modified Tsallis Statistics. Jounal of Computational Physics, 176(1):196\u2013204, February 2002.","journal-title":"Jounal of Computational Physics"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0893-9659(02)00140-4","volume":"16","author":"A. Franz","year":"2003","unstructured":"A. Franz and K. H. Hoffmann. Threshold Accepting as Limit Case for a Modified Tsallis Statistics. Applied Mathematics Letters, 16(1):27\u201331, January 2003.","journal-title":"Applied Mathematics Letters"},{"issue":"23","key":"19_CR8","doi-asserted-by":"publisher","first-page":"5219","DOI":"10.1103\/PhysRevLett.86.5219","volume":"86","author":"A. Franz","year":"2001","unstructured":"A. Franz, K. H. Hoffmann, and P. Salamon. Best Possible Strategy for Finding Ground States. Physical Review Letters, 86(23):5219\u20135222, June 2001.","journal-title":"Physical Review Letters"},{"key":"19_CR9","first-page":"945","volume-title":"Theoretical Analysis of Diversity Mechanisms for Global Exploration","author":"T. Friedrich","year":"2008","unstructured":"T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt. Theoretical Analysis of Diversity Mechanisms for Global Exploration. In Interational Genetic and Evolutionary Computation Conference 2008, pages 945\u2013952, Atlanta, Georgia, July 2008. ACM Press."},{"key":"19_CR10","first-page":"953","volume-title":"Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions","author":"E. Happ","year":"2008","unstructured":"E. Happ, D. Johannsen, C. Klein, and F. Neumann. Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions. In Interational Genetic and Evolutionary Computation Conference 2008, pages 953\u2013960, Atlanta, Georgia, July 2008. ACM Press."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"046704","DOI":"10.1103\/PhysRevE.70.046704","volume":"70","author":"K. H. Hoffmann","year":"2004","unstructured":"K. H. Hoffmann, F. Heilmann, and P. Salamon. Fitness Threshold Accepting over Extremal Optimization Ranks. Physical Review E, 70(4):046704, October 2004.","journal-title":"Physical Review E"},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1093\/bioinformatics\/btg027","volume":"19","author":"S. Kikuchi","year":"2003","unstructured":"S. Kikuchi, D. Tominaga, M. Arita, K. Takahashi, and M. Tomita. Dynamic Modeling of Genetic Networks Using Genetic Algorithm and S-System. Bioinformatics, 19(5):643\u2013650, 2003.","journal-title":"Bioinformatics"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"4598","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. Galatt, and M. Vecchi. Optimization by simulated annealing. Science, 4598:671\u2013680, 1983.","journal-title":"Science"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1111\/j.1467-9574.2007.00357.x","volume":"61","author":"A. Kolen","year":"2007","unstructured":"A. Kolen. A Genetic Algorithm for the Partial Binary Constraint Satisfaction Problem: an Application to a Frequency Assignment Problem. Statistica Neerlandica, 61(1):4\u201315, February 2007.","journal-title":"Statistica Neerlandica"},{"key":"19_CR15","first-page":"2181","volume-title":"Threshold Selecting: Best Possible Probability Distribution for Crossover Selection in Genetic Algorithms","author":"J. L\u00e4ssig","year":"2008","unstructured":"J. L\u00e4ssig, K. H. Hoffmann, and M. En\u0103achescu. Threshold Selecting: Best Possible Probability Distribution for Crossover Selection in Genetic Algorithms. In Interational Genetic and Evolutionary Computation Conference 2008, pages 2181\u20132185, Atlanta, Georgia, July 2008. ACM Press."},{"key":"19_CR16","first-page":"1","volume-title":"Foundations of Genetic Algorithms: 9th International Workshop","author":"A. Moraglio","year":"2007","unstructured":"A. Moraglio and R. Poli. Inbreeding Properties of Geometric Crossover and Non-geometric Recombinations. In C. R. Stephens, M. Toussaint, D. Whitley, and P. F. Stadler, editors, Foundations of Genetic Algorithms: 9th International Workshop, pages 1\u201314, Mexico City, Mexico, June 2007. Springer Berlin."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H. M\u00fchlenbein","year":"1993","unstructured":"H. M\u00fchlenbein and D. Schlierkamp-Voosen. Predictive Models for the Breeder Genetic Algorithm. Evolutionary Computation, 1(1):25\u201349, 1993.","journal-title":"Evolutionary Computation"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"D. Srinivasan and L. Rachmawati. An Efficient Multi-objective Evolutionary Algorithm with Steady-State Replacement Model. In Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 715\u2013722, Seattle, Washington, USA, July 2006.","DOI":"10.1145\/1143997.1144122"}],"container-title":["Research and Development in Intelligent Systems XXVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84882-983-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T22:23:27Z","timestamp":1619907807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84882-983-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,19]]},"ISBN":["9781848829824","9781848829831"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-84882-983-1_19","relation":{},"subject":[],"published":{"date-parts":[[2009,10,19]]}}}