{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T08:13:20Z","timestamp":1769933600063,"version":"3.49.0"},"reference-count":33,"publisher":"Elsevier","isbn-type":[{"value":"9780080506845","type":"print"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/b978-0-08-050684-5.50023-9","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:14:54Z","timestamp":1404173694000},"page":"316-337","source":"Crossref","is-referenced-by-count":133,"title":["Evolution in Time and Space \u2013 The Parallel Genetic Algorithm"],"prefix":"10.1016","author":[{"given":"Heinz","family":"M\u00fchlenbein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib1","series-title":"A Connectionist Machine for Genetic Hillclimbing","author":"Ackley","year":"1987"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib2","series-title":"Simulated Annealing and Boltzmann Machines","author":"Aarts","year":"1989"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib3","unstructured":"J.P. Cohoon, S.U. Hedge, W.N. Martin, and D. Richards. Punctuated equilibria: A parallel genetic algorithm. In J.J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 148\u2013154. Morgan-Kaufman, 1987."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1086\/283003","article-title":"A pain in the torus: Some difficulties with models of isolation by distance","volume":"109","author":"Felsenstein","year":"1975","journal-title":"Amer. Natur."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1146\/annurev.ge.10.120176.001345","article-title":"The theoretical population genetics of variable selection and migration","volume":"10","author":"Felsenstein","year":"1976","journal-title":"Ann. Rev. Genet."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib6","series-title":"The Genetical Theory of Natural Selection","author":"Fisher","year":"1958"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib7","unstructured":"J.J. Grefenstette and J.E. Baker. How genetic algorithms work: A critical look at implicit parallelism. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 20\u201327. Morgan-Kaufmann, 1989."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib8","first-page":"415","article-title":"Messy genetic algorithms revisited: Studies in mixed size and scale","volume":"4","author":"Goldberg","year":"1990","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib9","unstructured":"M. Gr\u00f6tschel and O. Holland. Solution of large-scale symmetric traveling salesman problems. Technical report, Institut f. \u00d6konometrie und Operations Research, University of Bonn, Report No. 88506-OR, 1988."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Sciences"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib11","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib12","first-page":"493","article-title":"Messy genetic algorithms: Motivation, analysis, and first results","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib13","unstructured":"M. Gorges-Schleuter. Asparagos: An asynchronous parallel genetic optimization strategy. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 422\u2013427. Morgan-Kaufmann, 1989."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib14","unstructured":"M. Gorges-Schleuter. Genetic Algorithms and Population Structures \u2014 A Massively Parallel Algorithm. PhD thesis, University of Dortmund, 1991."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib15","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0096-3003(89)90096-9","article-title":"Searching nonlinear functions for high values","volume":"32","author":"Holland","year":"1989","journal-title":"Appl. Math. and Comp."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib17","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1051\/jphys:019850046080127700","article-title":"Configuration space analysis of travelling salesman problems","volume":"46","author":"Kirkpatrick","year":"1985","journal-title":"J.Physique"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib18","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell. Syst. Techn. Journ."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/opre.21.2.498","article-title":"An efficient heuristic for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-8191(87)90026-3","article-title":"New solutions to the mapping problem of parallel systems \u2014 the evolution approach","volume":"6","author":"M\u00fchlenbein","year":"1987","journal-title":"Parallel Computing"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","article-title":"Evolution algorithms in combinatorial optimization","volume":"7","author":"M\u00fchlenbein","year":"1988","journal-title":"Parallel Computing"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib22","unstructured":"B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithm. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 428\u2013433. Morgan-Kaufmann, 1989."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib23","article-title":"The parallel genetic algorithm as function optimizer","volume":"16","author":"M\u00fchlenbein","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib24","unstructured":"H. M\u00fchlenbein. Parallel genetic algorithm, population dynamics and combinatorial optimization. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 416\u2013421, San Mateo, 1989. Morgan Kaufmann."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib25","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1142\/S0129065789000414","article-title":"A new method for mapping optimization problems onto neural networks","volume":"1","author":"Peterson","year":"1989","journal-title":"Int. J. Neural Syst."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib26","series-title":"Evolutionsstrategie \u2014 Optimierung technischer Systeme nach Prinzipien der biologischen Information","author":"Rechenberg","year":"1973"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib27","series-title":"Numerical Optimization of Computer Models","author":"Schwefel","year":"1981"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib28","year":"1989"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib29","unstructured":"R. Tanese. Distributed genetic algorithm. In H. Schaffer, editor, 3rd Int. Conf. on Genetic Algorithms, pages 434\u2013440. Morgan-Kaufmann, 1989."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib30","series-title":"Parallel Problem Solving from Nature","article-title":"Improving tsp exchange heuristics by population genetics","author":"Ulder","year":"1991"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib31","series-title":"Parallel Problem Solving from Nature","article-title":"A parallel genetic algorithm for the graph partitioning problem","author":"von Laszewski","year":"1991"},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib32","unstructured":"S. Wright. The roles of mutation, inbreeding, crossbreeding and selection in evolution. In Proc. 6th Int. Congr. on Genetics, pages 356\u2013366, 1932."},{"key":"10.1016\/B978-0-08-050684-5.50023-9_bib33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528139008953723","article-title":"Genitor ii: a distributed genetic algorithm","volume":"2","author":"Whitley","year":"1990","journal-title":"J. Expt. Theor. Artif. Intell."}],"container-title":["Foundations of Genetic Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080506845500239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080506845500239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T09:25:31Z","timestamp":1538472331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780080506845500239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780080506845"],"references-count":33,"URL":"https:\/\/doi.org\/10.1016\/b978-0-08-050684-5.50023-9","relation":{},"ISSN":["1081-6593"],"issn-type":[{"value":"1081-6593","type":"print"}],"subject":[],"published":{"date-parts":[[1991]]}}}