{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:09Z","timestamp":1725456309919},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617495"},{"type":"electronic","value":"9783540706717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0032790","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:24:17Z","timestamp":1133400257000},"page":"286-296","source":"Crossref","is-referenced-by-count":2,"title":["Co-evolution of operator settings in genetic algorithms"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Tuson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"22_CR1","volume-title":"Optimal Mutation Rates In Genetic Search","author":"T. B\u00e4ck","year":"1993","unstructured":"T. B\u00e4ck. Optimal Mutation Rates In Genetic Search. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo: Morgan Kaufmann, February 1993."},{"key":"22_CR2","first-page":"2","volume-title":"A Survey of Evolution Strategies","author":"T. B\u00e4ck","year":"1991","unstructured":"T. B\u00e4ck, F. Hoffmeister, and H. P. Schwefel. A Survey of Evolution Strategies. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 2\u20139. San Mateo: Morgan Kaufmann, 1991."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"D. Corne, P. Ross, and H.-L. Fang. GA Research Note 7: Fast Practical Evolutionary Timetabling. Technical report, University of Edinburgh Department of Artificial Intelligence, 1994.","DOI":"10.1007\/3-540-58483-8_19"},{"volume-title":"Handbook of Genetic Algorithms","year":"1991","key":"22_CR4","unstructured":"L. Davis, editor. Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991."},{"key":"22_CR5","volume-title":"Foundations of Genetic Algorithms 2","author":"S. Forrest","year":"1993","unstructured":"S. Forrest and M. Mitchell. Relative Building Block Fitness and the Building Block Hypothesis. In L. Darrell Whitely, editor, Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann, 1993."},{"key":"22_CR6","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3:493\u2013530, 1989.","journal-title":"Complex Systems"},{"key":"22_CR7","unstructured":"R. Hinterding. Representation and Self-adaption in Genetic Algorithms. In Proceedings of the First Korea-Australia Joint Workshop on Evolutionary Computation, Sept 1995."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"J. Horn, D. E. Goldberg, and K. Deb. Long Path Problems. In Y. Davidor, H.-P. Schwefel, and R. M\u00e4nner, editors, Parallel Problem Solving from Nature, PPSN III, pages 149\u2013159. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58484-6_259"},{"key":"22_CR9","unstructured":"G. F. Mott. Optimising Flowshop Scheduling Through Adaptive Genetic Algorithms. Chemistry Part II Thesis, Oxford University, 1990."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C. R. Reeves","year":"1995","unstructured":"C. R. Reeves. A genetic algorithm for flowshop sequencing. Computers & Ops. Res., 22:5\u201313, 1995.","journal-title":"Computers & Ops. Res."},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"E. Taillard. Benchmarks for basic scheduling problems. European Journal of operations research, 64:278\u2013285, 1993.","journal-title":"European Journal of operations research"},{"key":"22_CR12","unstructured":"A. L. Tuson. Adapting Operator Probabilities In Genetic Algorithms. Unpublished M.Sc. thesis, Department of Artificial Intelligence, Univeristy of Edinburgh, 1995."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:21:59Z","timestamp":1586578919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617495","9783540706717"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0032790","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}