{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:14:10Z","timestamp":1778249650218,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650782","type":"print"},{"value":"9783540496724","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056880","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:49:17Z","timestamp":1154306957000},"page":"378-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["UEGO, an abstract niching technique for global optimization"],"prefix":"10.1007","author":[{"given":"M\u00e1rk","family":"Jelasity","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"37_CR1","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms","year":"1997","unstructured":"Thomas B\u00e4ck, editor. Proceedings of the Seventh International Conference on Genetic Algorithms, San Francisco, California, 1997. Morgan Kaufmann."},{"issue":"2","key":"37_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1162\/evco.1993.1.2.101","volume":"1","author":"D. Beasley","year":"1993","unstructured":"D. Beasley, D. R. Bull, and R. R. Martin. A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2):101\u2013125, 1993.","journal-title":"Evolutionary Computation"},{"key":"37_CR3","unstructured":"K. Deb. Genetic algorithms in multimodal function optimization. TCGA report no. 89002, The University of Alabama, Dept. of Engineering mechanics, 1989."},{"key":"37_CR4","unstructured":"K. Deb and David E. Goldberg. An investegation of niche and species formation in genetic function optimization. In J. D. Schaffer, editor, The Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"A. E. Eiben and J. K. van der Hauw. Graph coloring with adaptive genetic algorithms. Journal of Heuristics, 4(1), 1998.","DOI":"10.1023\/A:1009638304510"},{"key":"37_CR6","unstructured":"J. J. Grefenstette. Genesis: A system for using genetic search procedures. In Proceedings of the 1984 Conference on Intelligent Systems and Machines, pages 161\u2013165, 1984."},{"key":"37_CR7","first-page":"505","volume-title":"Effectiveness of genetic local search algorithms","author":"H. Ishibuchi","year":"1997","unstructured":"Hisao Ishibuchi, Tadahiko Murata, and Shigemitsu Tomioka. Effectiveness of genetic local search algorithms. In B\u00e4ck [1], pages 505\u2013512."},{"key":"37_CR8","first-page":"89","volume-title":"A wave analysis of the subset sum problem","author":"M. Jelasity","year":"1997","unstructured":"M\u00e1rk Jelasity. A wave analysis of the subset sum problem. In B\u00e4ck [1], pages 89\u201396."},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(97)00071-4","volume":"99","author":"M. Jelasity","year":"1998","unstructured":"M\u00e1rk Jelasity and J\u00f3zsef Dombi. GAS, a concept on modeling species in genetic algorithms. Artificial Intelligence, 99(1):1\u201319, 1998.","journal-title":"Artificial Intelligence"},{"key":"37_CR10","unstructured":"A. Juels and M. Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical report, UC Berkeley, 1994."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"S. Khuri, T. B\u00e4ck, and J. Heitk\u00f6tter. An evolutionary approach to combinatorial optimization problems. In The Proceedings of CSC'94, 1993.","DOI":"10.1145\/197530.197558"},{"key":"37_CR12","unstructured":"M. Mitchell, J. H. Holland, and S. Forrest. When will a genetic algorithm outper-form hillclimbing? In J. D. Cowan et al., editors, Advances in Neural Information Processing Systems 6. Morgan Kaufmann, 1994."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Mutsunori Yagiura and Toshihide Ibaraki. Genetic and local search algorithms as robust and simple optimization tools. In Ibrahim H. Osman and James P. Kelly, editors, Meta-Heuristics: Theory and Application, pages 63\u201382. Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4613-1361-8_5"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:34:57Z","timestamp":1778247297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0056880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0056880","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"3 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}