{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:19:41Z","timestamp":1737436781806,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406020"},{"type":"electronic","value":"9783540451051"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45105-6_98","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T16:49:42Z","timestamp":1188233382000},"page":"850-861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Genetic Algorithm for the Hexagonal Tortoise Problem"],"prefix":"10.1007","author":[{"given":"Heemahn","family":"Choe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Soon","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"98_CR1","volume-title":"Gusuryak (a reprint)","author":"S. J. Choi","year":"1983","unstructured":"S. J. Choi. Gusuryak (a reprint). Shungshin Womens University Press, Seoul, Korea, 1983."},{"issue":"7","key":"98_CR2","first-page":"68","volume":"14","author":"Y. H. Jun","year":"1999","unstructured":"Y. H. Jun. Mysteries of mathematics: The order of the universe hidden in numbers. Dong-A Science, 14(7):68\u201377, 1999.","journal-title":"Dong-A Science"},{"key":"98_CR3","unstructured":"S. K. Lee, D. I. Seo, and B. R. Moon. A hybrid genetic algorithm for optimal hexagonal tortoise problem. In Genetic and Evolutionary Computation Conference, page 689, 2002."},{"key":"98_CR4","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989."},{"key":"98_CR5","first-page":"109","volume":"2","author":"S. Forrest","year":"1993","unstructured":"S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms, volume 2, pages 109\u2013126. Morgan Kaufmann, 1993.","journal-title":"Foundations of Genetic Algorithms"},{"key":"98_CR6","first-page":"243","volume":"3","author":"J. Horn","year":"1995","unstructured":"J. Horn and D. E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms, volume 3, pages 243\u2013270. Morgan Kaufmann, 1995.","journal-title":"Foundations of Genetic Algorithms"},{"key":"98_CR7","unstructured":"T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Sixth International Conference on Genetic Algorithms, pages 184\u2013192. Morgan Kaufmann, 1995."},{"key":"98_CR8","unstructured":"E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997."},{"issue":"1","key":"98_CR9","first-page":"190","volume":"3","author":"F. Glover","year":"1977","unstructured":"F. Glover. Tabu search: Part I,. ORSA Journal of Computing, 3(1):190\u2013206, 1977.","journal-title":"ORSA Journal of Computing"},{"key":"98_CR10","unstructured":"H. R. Louren\u00e7o, O. C. Martin, and T. St\u00fctzle. Iterated local search. In F. W. Glover and G. Kochenberger, editors, Handbook of Metaheuristic, chapter 11. Kluwer Academic Publisher, 2002."},{"key":"98_CR11","first-page":"299","volume":"5","author":"O. Martin","year":"1991","unstructured":"O. Martin, S. W. Otto, and E. W. Felten. Large-step markov chains for the traveling salesman problem. Complex Systems, 5:299\u2013326, 1991.","journal-title":"Complex Systems"},{"key":"98_CR12","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer, 1992.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"98_CR13","doi-asserted-by":"crossref","unstructured":"A. Ghosh, S. Tsutsui, and T. Tanaka. Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals. In IEEE International Conference on Evolutionary Computation, pages 666\u2013671, 1998.","DOI":"10.1109\/ICEC.1998.700119"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2014 GECCO 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45105-6_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:46:52Z","timestamp":1737395212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45105-6_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406020","9783540451051"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45105-6_98","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"18 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}