{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:42Z","timestamp":1725518442670},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_113","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T07:50:04Z","timestamp":1221292204000},"page":"1140-1149","source":"Crossref","is-referenced-by-count":5,"title":["A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"\u00dclker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emin Erkan","family":"Korkmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"113_CR1","doi-asserted-by":"crossref","unstructured":"Backofen, R., Will, S.: Excluding symmetries in constraint-based search. Principles and Practice of Constraint Programming, 73\u201387 (1999)","DOI":"10.1007\/978-3-540-48085-3_6"},{"key":"113_CR2","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey., 46\u201393 (1997)"},{"key":"113_CR3","first-page":"148","volume-title":"KR 1996: Principles of Knowledge Representation and Reasoning","author":"J. Crawford","year":"1996","unstructured":"Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Aiello, L.C., Doyle, J., Shapiro, S. (eds.) KR 1996: Principles of Knowledge Representation and Reasoning, pp. 148\u2013159. Morgan Kaufmann, San Francisco (1996)"},{"key":"113_CR4","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"113_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74450-4_1","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"G. Dosa","year":"2007","unstructured":"Dosa, G.: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD ( I ) \u2264 11\/9 OPT ( I ). In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 1\u201311. Springer, Heidelberg (2007)"},{"key":"113_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30076-2_22","volume-title":"Data Warehousing and Knowledge Discovery","author":"J. Du","year":"2004","unstructured":"Du, J., Korkmaz, E., Alhajj, R., Barker, K.: Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2004. LNCS, vol.\u00a03181, Springer, Heidelberg (2004)"},{"key":"113_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristics"},{"key":"113_CR8","volume-title":"Genetic Algorithms and Grouping Problems","author":"E. Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley and Sons, Chichester (1998)"},{"key":"113_CR9","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proc. of the IEEE 1992 Int. Conf. on Robotics and Automation, Nice, France, pp. 1186\u20131192 (1992)","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"113_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search, part 1. ORSA Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"key":"113_CR11","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"113_CR12","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)"},{"issue":"4598","key":"113_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"113_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.3233\/IDA-2006-10205","volume":"10","author":"E.E. Korkmaz","year":"2006","unstructured":"Korkmaz, E.E., Du, J., Alhajj, R., Barker, K.: Combining advantages of new chromosome representation scheme and multi-objective genetic algorithms for better clustering. Intelligent Data Analysis\u00a010(2), 163\u2013182 (2006)","journal-title":"Intelligent Data Analysis"},{"issue":"1","key":"113_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematic\u00a028(1), 59\u201370 (1990)","journal-title":"Discrete Applied Mathematic"},{"key":"113_CR16","series-title":"LNCS","first-page":"85","volume-title":"PATAT 2006","author":"E. Ozcan","year":"2007","unstructured":"Ozcan, E.: Memes, Self-generation and Nurse Rostering. In: PATAT 2006. LNCS, vol.\u00a03867, pp. 85\u2013104. Springer, Heidelberg (2007)"},{"key":"113_CR17","unstructured":"Ozcan, E., Alkan, A.: A Memetic Algorithm for Solving a Timetabling Problem: An Incremental Strategy. In: Baptiste, P., Kendall, G., Kordon, A.M., Sourd, F. (eds.) Proc. of the 3rd Multidisciplinary Int. Conf. On Scheduling: Theory and Applications, pp. 394\u2013401 (2007)"},{"issue":"1","key":"113_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E. Ozcan","year":"2008","unstructured":"Ozcan, E., Bilgin, B., Korkmaz, E.E.: A Comprehensive Analysis of Hyper-heuristics. Intelligent Data Analysis\u00a012(1), 3\u201323 (2008)","journal-title":"Intelligent Data Analysis"},{"issue":"1","key":"113_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10766-006-0026-x","volume":"35","author":"E. Ozcan","year":"2007","unstructured":"Ozcan, E., Onbasioglu, E.: Memetic Algorithms for Parallel Code Optimization. International Journal of Parallel Programming\u00a035(1), 33\u201361 (2007)","journal-title":"International Journal of Parallel Programming"},{"key":"113_CR20","unstructured":"Radcliffe, N.J.: Formal analysis and random respectful recombination. In: Belew, R.K., Booker, L.B. (eds.) Proc. of the 4th Int. Conf. on GAs, pp. 222\u2013229 (1991)"},{"key":"113_CR21","unstructured":"Ulker, O., Ozcan, E., Korkmaz, E.E.: Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling. In: Proc. of the 6th Int. Conf. on the Practice and Theory of Automated Timetabling, pp. 303\u2013319 (2006)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:28:36Z","timestamp":1557779316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_113","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}