{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T07:16:31Z","timestamp":1756192591684},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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\/bfb0032786","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:17Z","timestamp":1133418257000},"page":"223-235","source":"Crossref","is-referenced-by-count":2,"title":["The Royal Road functions: description, intent and experimentation"],"prefix":"10.1007","author":[{"given":"R. J.","family":"Quick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. J.","family":"Rayward-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. D.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Dan Adler. Genetic algorithms and simulated annealing: A marriage proposal. In IEEL International conference on neural networks, 1993.","DOI":"10.1109\/ICNN.1993.298712"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"J.F Dockx, K. Lutsko. Survival of the fittest in Alaska. In The Fourth International Workshop Artificial Intelligence and Statistics. Fort Lauderdale, 1993.","DOI":"10.1007\/978-1-4612-2660-4_47"},{"key":"18_CR3","unstructured":"Kathryn A. Dowsland. Simulated annealing. In Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, 1993."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Gunter Dueck and Tobias Scheuer. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. In Journal of Computational Physics, 1989.","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Stephanie Forrest and Melanie Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms-2. Fort Lauderdale, 1993.","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"18_CR6","unstructured":"David E. Goldburg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., 1989."},{"key":"18_CR7","unstructured":"David E. Goldburg. A note on boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. In Complex Systems, 1990."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"John J. Grefenstette. Deception considered harmful. In Foundations of Genetic Algorithms-2. Morgan Kaufmann, 1993.","DOI":"10.21236\/ADA294072"},{"key":"18_CR9","unstructured":"John H. Holland. Royal road functions. In Internet Genetic Algorithms Digest, 7\u223622. Massachusetts Insitue of Technology, 1993."},{"key":"18_CR10","unstructured":"Melanie Mitchell John H. Holland and Stephanie Forrest. The royal road for genetic algorithms: Fitness landscapes and G.A. performance. In Proceedings of the First European Conference on Artificial Life. Massachusetts Insitue of Technology, 1992."},{"key":"18_CR11","unstructured":"Terry Jones. A description of Hollands's Royal Road function. Massachusetts Institute of Technology, 1995."},{"key":"18_CR12","unstructured":"John H. Holland Melanie Mitchell and Stephanie Forrest. When will a genetic algorithm outperform hill climbing ? In Advances in Neural Information Processing Systems 6. Morgan Kaufmann, 1993."},{"key":"18_CR13","unstructured":"George D. Smith. Economic applications of genetic algorithms. In Applications of Modern Heuristic Methods, edited V.J. Rayward-Smith, Alfred Waller, 1995."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:19Z","timestamp":1586593339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617495","9783540706717"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0032786","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}