{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T23:44:05Z","timestamp":1772495045026,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T00:00:00Z","timestamp":1204675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00291-008-0129-4","type":"journal-article","created":{"date-parts":[[2008,3,4]],"date-time":"2008-03-04T10:00:06Z","timestamp":1204624806000},"page":"775-800","source":"Crossref","is-referenced-by-count":103,"title":["An integrated approach to the vehicle routing and container loading problems"],"prefix":"10.1007","volume":"31","author":[{"given":"Ana","family":"Moura","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,5]]},"reference":[{"issue":"4","key":"129_CR1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/trsc.1030.0049","volume":"38","author":"R Bent","year":"2004","unstructured":"Bent R, Van Hentenryck P (2004) A two-stage hybrid local search for the vehicle routing problem with time windows. Transpor Sci 38(4): 515\u2013530","journal-title":"Transpor Sci"},{"issue":"3","key":"129_CR2","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.ejor.2004.04.037","volume":"168","author":"EE Bischoff","year":"2006","unstructured":"Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168(3): 952\u2013966","journal-title":"Eur J Oper Res"},{"key":"129_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega\u2014Int J Manag Sci 23: 377\u2013390","journal-title":"Omega\u2014Int J Manag Sci"},{"key":"129_CR4","first-page":"237","volume":"20","author":"A Bortfeldt","year":"1998","unstructured":"Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spektrum 20: 237\u2013250","journal-title":"OR Spektrum"},{"key":"129_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131: 143\u2013161","journal-title":"Eur J Oper Res"},{"key":"129_CR6","doi-asserted-by":"crossref","unstructured":"Bortfeldt A, Gehring H, Mack D (2002) A parallel tabu search algorithm for solving the container loading problem. Working Paper, Diskussionsbeitr\u00e4ge des Fachbereichs Wirtschaftswissenschaft der Fern Universit\u00e4t Hagen","DOI":"10.1016\/S0167-8191(03)00047-4"},{"issue":"4","key":"129_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy O (2003) A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows. Informs J Computing 15(4): 347\u2013368","journal-title":"Informs J Computing"},{"issue":"3","key":"129_CR8","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/S0377-2217(03)00435-1","volume":"159","author":"O Br\u00e4ysy","year":"2004","unstructured":"Br\u00e4ysy O, Hasle G, Dullaert W (2004) A multi-start local search algorithm for the vehicle routing problem with time windows. Eur J Oper Res 159(3): 586\u2013605","journal-title":"Eur J Oper Res"},{"issue":"4","key":"129_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs F, Cordeau JF, Laporte G (2007) Variable neigborhood search for the pickup and delivery travelling Salesman Problem with LIFO loading. INFORMS J Comput 19(4): 618\u2013632","journal-title":"INFORMS J Comput"},{"key":"129_CR10","doi-asserted-by":"crossref","unstructured":"Czech ZJ, Czarnas P (2002) A parallel simulated annealing for the vehicle routing problem with time windows. In: Vajda I, Podhorszki (eds) Proceedings of the 10th Euromicro workshop on parallel distributed and network-based processing, Canary Islands, Spain, 9\u201311 Janvary 2002, pp 376\u2013383","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"129_CR11","first-page":"35","volume":"18","author":"H Gehring","year":"2001","unstructured":"Gehring H, Homberger J (2001) Parallelization of a two phase metaheuristic for routing problems with time windows. Asia-Pacific J Oper Res 18: 35\u201347","journal-title":"Asia-Pacific J Oper Res"},{"key":"129_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H Gehring","year":"2002","unstructured":"Gehring H, Bortfeldt A (2002) A parallel genetic algorithm for solving the container loading problem. Int Trans Oper Res 9: 497\u2013511","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"129_CR13","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"9","author":"M Gendreau","year":"2006","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2006) A tabu search algorithm for a routing and container loading problem. Trans Sci 9(3): 342\u2013350","journal-title":"Trans Sci"},{"key":"129_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"JA George","year":"1980","unstructured":"George JA, Robinson DF (1980) A heuristic for packing boxes into a container. Comput Oper Res 7: 147\u2013156","journal-title":"Comput Oper Res"},{"issue":"2","key":"129_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"MI Iori","year":"2007","unstructured":"Iori MI, Salazar Gonzalez JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two dimensional loading constraints. Transport Sci 41(2): 253\u2013264","journal-title":"Transport Sci"},{"issue":"4","key":"129_CR16","first-page":"50","volume":"20","author":"A Moura","year":"2005","unstructured":"Moura A, Oliveira JF (2005) A GRASP approach to the Container Loading Problem. IEEE Intell Syst\u2014Spec Issue Metaheuristic Methods Transport Logistics (July\/August) 20(4): 50\u201357","journal-title":"IEEE Intell Syst\u2014Spec Issue Metaheuristic Methods Transport Logistics (July\/August)"},{"issue":"1","key":"129_CR17","first-page":"45","volume":"24","author":"A Moura","year":"2004","unstructured":"Moura A, Oliveira JF (2004) Uma heur\u00edstica composta para a determina\u00e7\u00e3o de rotas para ve\u00edculos em problemas com janelas temporais e entregas e recolhas. Investiga\u00e7\u00e3o Operacional 24(1): 45\u201362","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"129_CR18","unstructured":"Petersen HL (2006) Heuristic solution approaches to the double TSP with multiple stacks. Technical report, Technical University of Denmark"},{"key":"129_CR19","first-page":"168","volume-title":"Handbook of applied optimization","author":"MGC Resende","year":"2002","unstructured":"Resende MGC, Pitsoulis LS (2002) Greedy randomized adaptive search procedures. In: Resende MGC, Pitsoulis LS(eds) Handbook of applied optimization. Oxford University Press, New York, pp 168\u2013181"},{"key":"129_CR20","unstructured":"Sixt M (1996) Dreidimensionale Packprobleme: Losungsverfahren basierend auf den Mate-Heuristiken Simulated Annealing und Tabu-Suche. Peter Lang, Frankfurt and Main, ISBN 3-631-30193-6"},{"key":"129_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time windows constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"129_CR22","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, ISBN 0-89871-579-2","DOI":"10.1137\/1.9780898718515"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-008-0129-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-008-0129-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-008-0129-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T05:51:14Z","timestamp":1630821074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-008-0129-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,5]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s00291-008-0129-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,5]]}}}