{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:08:22Z","timestamp":1778256502317,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540584841","type":"print"},{"value":"9783540490012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58484-6_252","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:26:56Z","timestamp":1330255616000},"page":"78-87","source":"Crossref","is-referenced-by-count":200,"title":["Genetic algorithms with multi-parent recombination"],"prefix":"10.1007","author":[{"given":"A. E.","family":"Eiben","sequence":"first","affiliation":[]},{"given":"P. -E.","family":"Rau\u00e9","sequence":"additional","affiliation":[]},{"given":"Zs.","family":"Ruttkay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T.-B. B\u00e4ck","year":"1993","unstructured":"T.-B. B\u00e4ck and H.-P. Schwefel, An Overview of Evolutionary Algorithms for parameter Optimization, Journal of Evolutionary Computation 1(1), 1993, pp. 1\u201323.","journal-title":"Journal of Evolutionary Computation"},{"key":"8_CR2","unstructured":"P. Cheeseman, B. Kenefsky and W.M. Taylor, Where the really hard problems are, Proc. of IJCAI-91, 1991, pp. 331\u2013337."},{"key":"8_CR3","unstructured":"A.L. Corcoran and R.L. Wainwright, LibGA: A User Friendly Workbench for Order-Based Genetic Algorithm Research, Proc. of Applied Computing: Sates of the Art and Practice, 1993, pp. 111\u2013117."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Y. Davidor, Epistasis Variance: A View-point on GA-Hardness, Proc. of FOGA-90, 1991, pp. 23\u201335.","DOI":"10.1016\/B978-0-08-050684-5.50005-7"},{"key":"8_CR5","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991."},{"key":"8_CR6","unstructured":"A.E. Eiben, A Method for Designing Decision Support Systems for Operational Planning, PhD Thesis, Eindhoven University of Technology, 1991."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A.E. Eiben, P.-E. Rau\u00e9 and Zs. Ruttkay, Solving Constraint Satisfaction Problems Using Genetic Algorithms, proceedings of the 1st IEEE World Conference on Computational Intelligence, to appear in 1994.","DOI":"10.1109\/ICEC.1994.350002"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"A.E. Eiben, P-E., Rau\u00e9, Zs. Ruttkay, GA-easy and GA-hard Constraint Satisfaction Problems, Proc. of the ECAI'94 Workshop on Constraint Processing, LNCS Series, Springer-Verlag, to appear in August, 1994.","DOI":"10.1007\/3-540-59479-5_30"},{"key":"8_CR9","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989."},{"key":"8_CR10","unstructured":"J. Grefenstette, R. Gopal, B. Rosmaita and D. Van Gucht, Genetic Algorithms for the Travelling Salesman Problem, Proc. of ICGA-85, 1985, pp.160\u2013168."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1992.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"8_CR12","unstructured":"H. M\u00fchlenbein, Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, Proc. of ICGA-89, 1989, pp. 416\u2013421."},{"key":"8_CR13","unstructured":"I.M. Oliver, D.J. Smith and J.R.C. Holland, A study of permutation crossover operators on the travelling salesman problem, Proc. of ICGA-87, 1987, pp. 224\u2013230."},{"key":"8_CR14","unstructured":"G. Seront and H. Bersini, In Search of a Good Evolution-Optimization Crossover, Proc. of PPSN 2, 1992, pp. 479\u2013488."},{"key":"8_CR15","first-page":"350","volume-title":"Handbook of Genetic Algorithms","author":"D. Whitley","year":"1991","unstructured":"D. Whitley, T. Starkweather and D. Shaner, The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination, In: [DavL91],, pp. 350\u2013372."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58484-6_252.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:10Z","timestamp":1605630130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58484-6_252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584841","9783540490012"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58484-6_252","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}