{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:38Z","timestamp":1725487658167},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540733225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73325-6_22","type":"book-chapter","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T00:05:23Z","timestamp":1184630723000},"page":"217-226","source":"Crossref","is-referenced-by-count":0,"title":["A Relation-Based Genetic Algorithm for Partitioning Problems with Applications"],"prefix":"10.1007","author":[{"given":"Jiah-Shing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao-Tang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang-Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1997","unstructured":"Appel, K., Haaken, W.: Every map is four-colourable I: discharging. Illinois J. Math\u00a021, 429\u2013490 (1997)","journal-title":"Illinois J. Math"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2004.08.024","volume":"18","author":"E.C. Brown","year":"2005","unstructured":"Brown, E.C., Sumichrast, R.T.: Evaluating performance advantages of grouping genetic algorithms. Engineering Applications of Artificial Intelligence\u00a018, 1\u201312 (2005)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"22_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/11941439_90","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"J.S. Chen","year":"2006","unstructured":"Chen, J.S., Lin, Y.T.: A Partitioned Portfolio Insurance Strategy by Relational Genetic Algorithm. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol.\u00a04304, pp. 857\u2013866. Springer, Heidelberg (2006)"},{"issue":"9","key":"22_CR4","doi-asserted-by":"publisher","first-page":"2565","DOI":"10.1080\/00207549608905045","volume":"34","author":"W-C. Chiang","year":"1996","unstructured":"Chiang, W-C., Kouvelis, P.: An improved tabu search heuristic for solving facility layout design problem. International Journal of Production Research\u00a034(9), 2565\u20132585 (1996)","journal-title":"International Journal of Production Research"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"Eiben, A.E., van der Hauw, J.K., van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. J. Heuristics\u00a04(1), 25\u201346 (1998)","journal-title":"J. Heuristics"},{"issue":"1,2","key":"22_CR6","first-page":"79","volume":"33","author":"E. Falkenauer","year":"1992","unstructured":"Falkenauer, E.: The Grouping Genetic Algorithms \u2013 Widening The Scope of The GAs. JORBEL?Belgian Journal of Operations Research, Statistics and Computer Science\u00a033(1,2), 79\u2013102 (1992)","journal-title":"JORBEL?Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"22_CR7","unstructured":"Garey, M. R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, USA (1979)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D. Johnson","year":"1991","unstructured":"Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research\u00a039(3), 378\u2013406 (1991)","journal-title":"Operations Research"},{"key":"22_CR9","first-page":"442","volume-title":"Proc. 4th Intnl. Conf. on Genetic Algorithms","author":"D.R. Jones","year":"1991","unstructured":"Jones, D.R., Beltramo, M.A.: Solving partitioning problems with genetic algorithms. In: Belew, K.R., Booker, L.B. (eds.) Proc. 4th Intnl. Conf. on Genetic Algorithms, pp. 442\u2013449. Morgan Kaufmann, San Francisco (1991)"},{"key":"22_CR10","unstructured":"Smith, D.: Bin Packing with Adaptive Search. In: Proceeding of an International Conference on Genetic Algorithms and Their Application, pp. 202\u2013206 (1985)"}],"container-title":["Lecture Notes in Computer Science","New Trends in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73325-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:13:32Z","timestamp":1605744812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73325-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733225"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73325-6_22","relation":{},"subject":[]}}