{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:25:02Z","timestamp":1759667102089},"reference-count":29,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0305-0548(01)00039-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"1641-1659","source":"Crossref","is-referenced-by-count":61,"title":["A new evolutionary approach to cutting stock problems with and without contiguity"],"prefix":"10.1016","volume":"29","author":[{"given":"Ko-Hsin","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00039-9_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB2","series-title":"Cutting and packing in production and distribution: a typology and bibliography","author":"Dyckhoff","year":"1992"},{"issue":"7","key":"10.1016\/S0305-0548(01)00039-9_BIB3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"One-dimensional cutting stock decision packing problems","volume":"43","author":"Sweeney","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB4","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/0305-0548(86)90077-8","article-title":"Near-optimal solutions to one-dimensional cutting stock problems","volume":"13","author":"Roodman","year":"1986","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(01)00039-9_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1057\/jors.1994.28","article-title":"The one dimensional cutting stock problem using two objectives","volume":"45","author":"Sinuany\u2013Stern","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB6","doi-asserted-by":"crossref","unstructured":"Hinterding R, Khan L. Genetic algorithms for cutting stock problems: with and without contiguity. In: Yao X, editor. Progress in evolutionary computation. Lecture notes in artificial intelligence, vol. 956. Berlin: Springer, 1995. p. 166\u201386.","DOI":"10.1007\/3-540-60154-6_54"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-2217(91)90222-H","article-title":"Heuristics for sequencing cutting patterns","volume":"55","author":"Yuen","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/05695557608975076","article-title":"Approaches to cutting stock problem","volume":"8","author":"Golden","year":"1976","journal-title":"AIIE Transaction"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB9","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0377-2217(80)90068-5","article-title":"The trim-loss and assortment problems: a survey","volume":"5","author":"Hinxman","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","article-title":"Cutting stock problems and solution procedures","volume":"54","author":"Haessler","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB11","series-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms.","author":"B\u00e4ck","year":"1996"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB12","series-title":"Genetic Algorithms in search, optimization, and machine learning.","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB13","series-title":"Evolutionary computation: toward a new philosophy of machine intelligence.","author":"Fogel","year":"1995"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB14","unstructured":"Prosser P. A hybrid genetic algorithm for pallet loading. In: Proceedings of the Eighth European Conference on Artificial Intelligence (ECAI-88), Aulander, NC: Pitman, 1988. p. 159\u201364."},{"key":"10.1016\/S0305-0548(01)00039-9_BIB15","unstructured":"Juliff K. A multi-chromosome genetic algorithm for pallet loading. In: Forrest S, editor. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA\u201993), San Mateo, CA, Los Altos: Morgan Kaufmann, 1993. p. 467\u201373."},{"key":"10.1016\/S0305-0548(01)00039-9_BIB16","unstructured":"Bilchev G. Evolutionary metaphors for the bin packing problem. In: Fogel L, Angeline P, B\u00e4ck T, editors. Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming, Cambridge, MA, Cambridge: MIT Press, 1996. p. 333\u201341."},{"key":"10.1016\/S0305-0548(01)00039-9_BIB17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02125404","article-title":"Hybrid genetic algorithms for bin-packing and related problems","volume":"63","author":"Reeves","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(01)00039-9_BIB18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","article-title":"A hybrid grouping genetic algorithm for bin-packing","volume":"2","author":"Falkenauer","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/01969729308961697","article-title":"Applying evolutionary programming to selected control problems","volume":"24","author":"Fogel","year":"1993","journal-title":"Cybernetics and Systems"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB20","doi-asserted-by":"crossref","unstructured":"Chellapilla K, Fogel D. Exploring self-adaptive methods to improve the efficiency of generating approximate solutions to traveling salesman problems using evolutionary programming. In: Angeline P, Reynolds R, McDonnell J, Eberhart R, editors. Evolutionary programming VI: Proceedings of the Sixth Annual Conference on Evolutionary Programming. Lecture notes in computer science, vol. 1213. Berlin: Springer, 1997. p. 361\u201371.","DOI":"10.1007\/BFb0014825"},{"issue":"11","key":"10.1016\/S0305-0548(01)00039-9_BIB21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(94)90100-7","article-title":"Applying evolutionary programming to selected control problems","volume":"27","author":"Fogel","year":"1994","journal-title":"Computers & Mathematics with Applications"},{"issue":"6","key":"10.1016\/S0305-0548(01)00039-9_BIB22","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1177\/003754979506400605","article-title":"A comparison of evolutionary programming and genetic algorithms on selected constrained optimization problems","volume":"64","author":"Fogel","year":"1995","journal-title":"Simulation"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/00207169108804011","article-title":"Simulated annealing with extended neighbourhood","volume":"40","author":"Yao","year":"1991","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB24","unstructured":"Yao X. Comparison of different neighbourhood sizes in simulated annealing. In: Leong P, Jabri M, editors. Proceedings of the Fourth Australian Conference on Neural Networks, Melbourne, Australia, 1993. p. 216\u201319."},{"key":"10.1016\/S0305-0548(01)00039-9_BIB25","unstructured":"Davis L, editor. Handbook of genetic algorithms, New York: Van Nostrand Reinhold, 1991."},{"key":"10.1016\/S0305-0548(01)00039-9_BIB26","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"A linear programming approach to the cutting stock problem\u2014Part II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB27","doi-asserted-by":"crossref","unstructured":"Yao X, editor. Evolutionary computation: theory and applications, Singapore: World Scientific Publ. Co. 1999.","DOI":"10.1142\/2792"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/01969729508927488","article-title":"Continuous evolutionary programming: analysis and experiments","volume":"26","author":"Fogel","year":"1995","journal-title":"Cybernetics and Systems"},{"key":"10.1016\/S0305-0548(01)00039-9_BIB29","doi-asserted-by":"crossref","unstructured":"Syswerda G. A study of reproduction in generational and steady state genetic algorithms. In: Rawlins GJE, editor. Foundations of Genetic Algorithms, San Mateo, CA, Los Altos: Morgan Kaufmann, 1991. p. 94\u2013101.","DOI":"10.1016\/B978-0-08-050684-5.50009-4"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:23:10Z","timestamp":1555118590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":29,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0305054801000399"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00039-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}