{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:58:39Z","timestamp":1772823519769,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0377-2217(02)00218-7","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T16:31:35Z","timestamp":1038846695000},"page":"530-542","source":"Crossref","is-referenced-by-count":82,"title":["Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem"],"prefix":"10.1016","volume":"145","author":[{"given":"T.W","family":"Leung","sequence":"first","affiliation":[]},{"given":"Chi Kin","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Marvin D","family":"Troutt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00218-7_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","article-title":"An exact two-dimensional non-guillotine cutting tree search procedure","volume":"33","author":"Beasley","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0375-9601(87)90149-6","article-title":"Boltzmann and Darwin strategies in complex optimization","volume":"125","author":"Boseniuk","year":"1987","journal-title":"Physics Letters A"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB3","series-title":"Proceedings of the 3rd International Conference in Industrial Engineering, Montreal, Canada","first-page":"1281","article-title":"A modified genetic algorithm for the joint replenishment problem","author":"Chan","year":"1999"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","article-title":"An exact algorithm for general, orthogonal two-dimensional knapsack problems","volume":"83","author":"Christofides","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB5","series-title":"Evolutionary Algorithms in Engineering Applications","author":"Dasgupta","year":"1997"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)90195-S","article-title":"Some experiments with simulated annealing techniques for packing problems","volume":"68","author":"Dowsland","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB7","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1057\/jors.1996.60","article-title":"Genetic algorithms \u2013 a tool for OR?","volume":"47","author":"Dowsland","year":"1996","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/S0377-2217(02)00218-7_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","article-title":"Genetic algorithms and tabu search: Hybrids for optimization","volume":"22","author":"Glover","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB9","series-title":"Genetic Algorithms","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB10","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","article-title":"An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem","volume":"128","author":"Hopper","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"10.1016\/S0377-2217(02)00218-7_BIB12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0895-7177(92)90108-W","article-title":"Genetic algorithms and very fast simulated reannealing: A comparison","volume":"16","author":"Ingber","year":"1992","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","article-title":"On genetic algorithms for the packing of polygons","volume":"88","author":"Jakobs","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1018928017332","article-title":"New directions in genetic algorithm theory","volume":"75","author":"Koehler","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00218-7_BIB16","first-page":"299","article-title":"A genetic algorithm with disruptive selection","volume":"26","author":"Kuo","year":"1996","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"10.1016\/S0377-2217(02)00218-7_BIB17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","article-title":"Developing a simulated annealing algorithm for the cutting stock problem","volume":"32","author":"Lai","year":"1997","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB18","unstructured":"Leung, T.W., Chan, C.K., Troutt, M., 2000. Comparison of meta-heuristics for the two dimensional orthogonal packing problem. Working Paper, Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong"},{"issue":"6","key":"10.1016\/S0377-2217(02)00218-7_BIB19","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1109\/21.257766","article-title":"Applying the genetic approach to simulated annealing in solving some NP-hard problems","volume":"23","author":"Lin","year":"1993","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","article-title":"Parallel recombinative simulated annealing: A genetic algorithm","volume":"21","author":"Mahfoud","year":"1995","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB21","series-title":"Genetic Algorithms for VLSI Design, Layout and Test Automation","author":"Mazumder","year":"1999"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB22","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculation by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"The Journal of Chemical Physics"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB23","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","article-title":"Metaheuristics: A bibliography","volume":"63","author":"Osman","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00218-7_BIB24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0305-0548(98)80006-3","article-title":"Solution for constrained guillotine cutting problem by simulated annealing","volume":"25","author":"Parada","year":"1998","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00218-7_BIB25","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","article-title":"Convergence properties of canonical genetic algorithms","volume":"5","author":"Rudolph","year":"1994","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB26","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1080\/07408179308964305","article-title":"Three dimensional palletization of mixed box sizes","volume":"25","author":"Tsai","year":"1993","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB27","doi-asserted-by":"crossref","unstructured":"Thierens, D., Goldberg, D.E., 1994. Elitist recombination: An integrated selection recombination GA. In: Proceedings of the First IEEE Conference on Evolutionary Computation ICEC\u201994","DOI":"10.1109\/ICEC.1994.349898"},{"key":"10.1016\/S0377-2217(02)00218-7_BIB28","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","article-title":"An effective hybrid optimization strategy for job\u2013shop scheduling problems","volume":"28","author":"Wang","year":"2001","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00218-7_BIB29","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T14:25:18Z","timestamp":1556029518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0377221702002187"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00218-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}