{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:24Z","timestamp":1750307364662,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830605","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"657-664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem"],"prefix":"10.1145","author":[{"given":"Justin","family":"Benjamin","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bryant A.","family":"Julstrom","sequence":"additional","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026267.44673.ed"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"B\u00e4ck T.","year":"1996","unstructured":"T. B\u00e4ck . Evolutionary Algorithms in Theory and Practice . Oxford University Press , New York , 1996 . T. B\u00e4ck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996."},{"key":"e_1_3_2_1_3_1","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"Coffman J. E. G.","year":"1995","unstructured":"J. E. G. Coffman , M. R. Garey , and D. S. Johnson . Approximation algorithms for bin packing: a survey . In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems , chapter 2. PWS Publishing Company , Boston , 1995 . J. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2. PWS Publishing Company, Boston, 1995."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/954563"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"e_1_3_2_1_6_1","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractibility: A Guide to the Theory of NP-Completeness . W. H. Freeman , New York , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979."},{"key":"e_1_3_2_1_7_1","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D. E.","year":"1989","unstructured":"D. E. Goldberg . Genetic Algorithms in Search, Optimization, and Machine Learning . Addison-Wesley , Reading, MA , 1989 . D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645511.657095"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299783"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-7535-4_75"},{"key":"e_1_3_2_1_11_1","first-page":"224","volume-title":"Proceedings of the Second International Conference on Genetic Algorithms","author":"Oliver I. M.","year":"1987","unstructured":"I. M. Oliver , D. J. Smith , and J. R. C. Holland . A study of permutation crossover operators on the Traveling Salesman Problem. In J. J. Greffenstette, editor , Proceedings of the Second International Conference on Genetic Algorithms , pages 224 -- 230 . Lawrence Erlbaum , 1987 . I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the Traveling Salesman Problem. In J. J. Greffenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 224--230. Lawrence Erlbaum, 1987."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125404"},{"key":"e_1_3_2_1_13_1","first-page":"942","volume-title":"W. B. Langdon et al.","author":"Ross P.","year":"2002","unstructured":"P. Ross , S. Schulenburg , J. G. Mar\u00edn-Bl\u00e1zquez , and E. Hart . Hyper-heuristics: learning to combine simple heuristics in bin-packing problems . In W. B. Langdon et al. , editors, GECCO- 2002 : Proceedings of the Genetic and Evolutionary Computation Conference, pages 942 -- 948 , San Francisco, CA, 2002. Morgan Kaufman . P. Ross, S. Schulenburg, J. G. Mar\u00edn-Bl\u00e1zquez, and E. Hart. Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In W. B. Langdon et al., editors, GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 942--948, San Francisco, CA, 2002. Morgan Kaufman."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(96)00082-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645512.657238"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Portland Oregon USA","acronym":"GECCO '10"},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:39Z","timestamp":1750245759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":15,"alternative-id":["10.1145\/1830483.1830605","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830605","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}