{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T19:27:02Z","timestamp":1784230022211,"version":"3.55.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-8191(03)00047-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"641-662","source":"Crossref","is-referenced-by-count":162,"title":["A parallel tabu search algorithm for solving the container loading problem"],"prefix":"10.1016","volume":"29","author":[{"given":"A","family":"Bortfeldt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H","family":"Gehring","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D","family":"Mack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00047-4_BIB1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","article-title":"Issues in the development of approaches to container loading","volume":"23","author":"Bischoff","year":"1995","journal-title":"Omega"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB2","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0377-2217(95)00031-K","article-title":"Loading pallets with non-identical items","volume":"84","author":"Bischoff","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB3","unstructured":"A. Bortfeldt, Informierte Graphensuchverfahren und genetische Algorithmen zur L\u00f6sung von Containerbeladeproblemen, Dissertation, Freie Universit\u00e4t, Berlin, Verlag Dr. K\u00f6ster, Berlin, 1995"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01539742","article-title":"Ein Tabu Search-Verfahren f\u00fcr Containerbeladeprobleme mit schwach heterogenem Kistenvorrat","volume":"20","author":"Bortfeldt","year":"1998","journal-title":"OR Spektrum"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","article-title":"A hybrid genetic algorithm for the container loading problem","volume":"131","author":"Bortfeldt","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","article-title":"Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements","volume":"17","author":"Crainic","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB7","series-title":"Cutting and Packing in Production and Distribution","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","article-title":"A genetic algorithm for solving the container loading problem","volume":"4","author":"Gehring","year":"1997","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB9","series-title":"Operations Research Proceedings 1998","first-page":"220","article-title":"Ein verteilt-paralleles Tabu Search-Verfahren f\u00fcr Containerbeladeprobleme mit schwach heterogenem Kistenvorrat","author":"Gehring","year":"1999"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","article-title":"A parallel genetic algorithm for solving the container loading problem","volume":"9","author":"Gehring","year":"2002","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB11","first-page":"35","article-title":"A parallel two-phase metaheuristic for routing problems with time windows","volume":"18","author":"Gehring","year":"2001","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB12","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"70","article-title":"Tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB13","unstructured":"T.H. Loh, A.Y.C. Nee, A packing algorithm for hexahedral boxes, in: Proceedings of the Conference of Industrial Automation, Singapore, 1992, pp. 115\u2013126"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0969-6016(94)90046-9","article-title":"An AND\/OR-graph approach to the container loading problem","volume":"1","author":"Morabito","year":"1994","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/00207549408956919","article-title":"Applying spatial representation techniques to the container packing problem","volume":"32","author":"Ngoi","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(02)00132-7","article-title":"Heuristics for the container loading problem","volume":"141","author":"Pisinger","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB18","series-title":"Operations Research Proceedings, 1991","first-page":"445","article-title":"Algorithms for the container loading problem","author":"Scheithauer","year":"1992"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB19","unstructured":"M. Sixt, Dreidimensionale Packprobleme. L\u00f6sungsverfahren basierend auf den Meta-Heuristiken Simulated Annealing und Tabu-Suche, Europ\u00e4ischer Verlag der Wissenschaften, Frankfurt am Main, 1996"},{"key":"10.1016\/S0167-8191(03)00047-4_BIB20","unstructured":"M. Toulouse, T.G. Crainic, M. Gendreau, Issues in designing parallel and distributed search algorithms for discrete optimization problems, Publication CRT-96-36, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Canada, 1996"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T22:20:02Z","timestamp":1553379602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167819103000474"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00047-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}