{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:06:43Z","timestamp":1778605603305,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T00:00:00Z","timestamp":1306454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10100-011-0204-9","type":"journal-article","created":{"date-parts":[[2011,5,26]],"date-time":"2011-05-26T11:15:21Z","timestamp":1306408521000},"page":"307-336","source":"Crossref","is-referenced-by-count":40,"title":["Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows"],"prefix":"10.1007","volume":"21","author":[{"given":"Selma","family":"Khebbache-Hadji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alice","family":"Yalaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Reghioui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,27]]},"reference":[{"key":"204_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez-Valdes R, Parreno F, Tamarit JM (2005) A GRASP algorithm for constrained two-dimensional non guillotine cutting problems. J Oper Res Soc 414\u2013425","DOI":"10.1057\/palgrave.jors.2601829"},{"key":"204_CR2","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"GB Alvarenga","year":"2007","unstructured":"Alvarenga GB, Mateus GR, Tomi G (2007) A genetic and set partitioning two-phase approch for the vehicle routing problem with time windows. Comput Oper Res 34: 1561\u20131584","journal-title":"Comput Oper Res"},{"key":"204_CR3","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes R, Parreno F, Tamarit JM (2007) A tabu search algorithm for two-dimensional non guillotine cutting problems. Eur J Oper Res 183: 1167\u20131182","journal-title":"Eur J Oper Res"},{"issue":"4","key":"204_CR4","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes R, Parreno F, Tamarit JM (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35(4): 1065\u20131083","journal-title":"Comput Oper Res"},{"issue":"6","key":"204_CR5","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1057\/palgrave.jors.2602393","volume":"59","author":"G Belov","year":"2008","unstructured":"Belov G, Scheithauer G, Mukhacheva EA (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59(6): 823\u2013832","journal-title":"J Oper Res Soc"},{"key":"204_CR6","unstructured":"Ben Messaoud S (2004) Caract\u00e9risation, mod\u00e9lisation et\u00a0algorithmes pour des probl\u00e8mes de d\u00e9coupe guillotine. PhD thesis, University of Technology of Troyes, France (in French)"},{"key":"204_CR7","first-page":"179","volume":"41","author":"J Berger","year":"2003","unstructured":"Berger J, Barkaoui M, Br\u00e4ysy O (2003) A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Inf Syst Oper Res 41: 179\u2013194","journal-title":"Inf Syst Oper Res"},{"key":"204_CR8","unstructured":"Blanton JL, Wainwright RL (1993) Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the fifth international conference on genetic algorithms. Morgan Kaufmann, San Francisco, pp 452\u2013459"},{"issue":"3","key":"204_CR9","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172(3): 814\u2013837","journal-title":"Eur J Oper Res"},{"key":"204_CR10","first-page":"27","volume":"1","author":"MA Boschetti","year":"2003","unstructured":"Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem Part I: new lower bounds for the oriented case. 4OR 1: 27\u201342","journal-title":"4OR"},{"key":"204_CR11","first-page":"137","volume":"1","author":"MA Boschetti","year":"2003","unstructured":"Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem, Part II: new lower and upper bounds. 4OR 1: 137\u2013147","journal-title":"4OR"},{"key":"204_CR12","first-page":"119","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005) Vehicle routing problem with time windows, part i: heuristics. INFORMS J Comput 39: 119\u2013139","journal-title":"INFORMS J Comput"},{"key":"204_CR13","first-page":"119","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005) Vehicle routing problem with time windows, part ii: metaheuristics. INFORMS J Comput 39: 119\u2013139","journal-title":"INFORMS J Comput"},{"issue":"4","key":"204_CR14","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"54","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 54(4): 655\u2013671","journal-title":"Oper Res"},{"issue":"3","key":"204_CR15","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2009","unstructured":"Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS J Comput 21(3): 505\u2013516","journal-title":"INFORMS J Comput"},{"key":"204_CR16","doi-asserted-by":"crossref","unstructured":"Chazelle B (1983) The bottom left bin packing heuristic: an efficient algorithm. IEEE Trans Comput, 697\u2013707","DOI":"10.1109\/TC.1983.1676307"},{"key":"204_CR17","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25: 30\u201340","journal-title":"Oper Res"},{"key":"204_CR18","unstructured":"Clautiaux F (2005) Bornes inf\u00e9rieures et m\u00e9thodes exactes pour le probl\u00e8me de bin-packing en deux dimensions avec orientations fixes. PhD Thesis, Universit\u00e9 de Technologie de Compi\u00e8gne"},{"key":"204_CR19","volume-title":"Practical nonparametric statistics","author":"WJ Conover","year":"1999","unstructured":"Conover WJ (1999) Practical nonparametric statistics. Wiley, New York"},{"key":"204_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S Fekete","year":"2001","unstructured":"Fekete S, Schepers J (2001) New classes of fast lower bounds for bin packing problems. Math Program 91: 11\u201331","journal-title":"Math Program"},{"key":"204_CR21","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S Fekete","year":"2004","unstructured":"Fekete S, Schepers J (2004) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60: 311\u2013329","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"204_CR22","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S Fekete","year":"2007","unstructured":"Fekete S, Schepers J, Vander Veen J (2007) Exact solution of the two dimensional finite bin packing problem. Oper Res 55(3): 569\u2013587","journal-title":"Oper Res"},{"key":"204_CR23","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","volume":"36","author":"G Fuellerer","year":"2009","unstructured":"Fuellerer G, Doerner KF, Hartl FH, Iori M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput Oper Res 36: 655\u2013673","journal-title":"Comput Oper Res"},{"key":"204_CR24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M Gendreau","year":"2007","unstructured":"Gendreau M, Iori M, Laporte G, Martello S (2007) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51: 4\u201318","journal-title":"Networks"},{"issue":"3","key":"204_CR25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-010-0144-6","volume":"8","author":"H Hashimoto","year":"2010","unstructured":"Hashimoto H, Yagiura M, Imahori S, Ibaraki T (2010) Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8(3): 221\u2013238","journal-title":"4OR"},{"key":"204_CR26","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18: 4\u201327","journal-title":"TOP"},{"key":"204_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori M, Salazar-Gonzalez JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transport Sci 41: 253\u2013264","journal-title":"Transport Sci"},{"key":"204_CR28","first-page":"164","volume":"2","author":"S Khebbache","year":"2008","unstructured":"Khebbache S, Prins C, Yalaoui A (2008) Iterated local search algorithm for the constrained two-dimensional non-guillotine cutting stock problem. J Ind Syst Eng 2: 164\u2013179","journal-title":"J Ind Syst Eng"},{"key":"204_CR29","first-page":"337","volume-title":"Local search in combinatorial optimization","author":"GAP Kindervater","year":"1997","unstructured":"Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: handling edge exchanges. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 337\u2013360"},{"key":"204_CR30","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G Kontoravdis","year":"1995","unstructured":"Kontoravdis G, Bard J (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7: 10\u201323","journal-title":"ORSA J Comput"},{"key":"204_CR31","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1051\/ro:2008021","volume":"42","author":"N Labadi","year":"2008","unstructured":"Labadi N, Prins C, Reghioui M (2008) A memetic algorithm for the vehicle routing problem with time windows. RAIRO Oper Res 42: 415\u2013431","journal-title":"RAIRO Oper Res"},{"key":"204_CR32","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11: 345\u2013357","journal-title":"INFORMS J Comput"},{"key":"204_CR33","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manage Sci 44: 388\u2013399","journal-title":"Manage Sci"},{"key":"204_CR34","first-page":"219","volume-title":"New ideas in optimization","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. In: Come D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 219\u2013234"},{"key":"204_CR35","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-8349-9777-7_11","volume-title":"Intelligent decision support","author":"A Moura","year":"2008","unstructured":"Moura A (2008) A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem. In: Bortfeldt A, Homberger J, Kopfer H, Pankratz G, Stangmeier R (eds) Intelligent decision support. Gabler, Wiesbaden, pp 187\u2013201"},{"key":"204_CR36","doi-asserted-by":"crossref","unstructured":"Moura A, Oliveira JF (2008) An integrated approach to the routing and loading problems. OR Spectrum, doi: 10.1007\/s00291-008-0129-4","DOI":"10.1007\/s00291-008-0129-4"},{"key":"204_CR37","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Sigurd MM (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. INFORMS J Comput 19: 36\u201351","journal-title":"INFORMS J Comput"},{"issue":"1","key":"204_CR38","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19(1): 36\u201351","journal-title":"INFORMS J Comput"},{"key":"204_CR39","first-page":"165","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin JY, Bengio S (1996) The vehicle routing with time windows Part II genetic search Informs. J Comput 8: 165\u2013172","journal-title":"J Comput"},{"key":"204_CR40","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46: 1433\u20131446","journal-title":"J Oper Res Soc"},{"key":"204_CR41","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31: 1985\u20132002","journal-title":"Comput Oper Res"},{"key":"204_CR42","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB-A travelling salesman problem library. ORSA J Comput 3: 376\u2013384","journal-title":"ORSA J Comput"},{"key":"204_CR43","doi-asserted-by":"crossref","unstructured":"Rochat Y, Taillard ED (1995) Probabilistic diversification algorithm for the vehicle routing problem. J Heuristics, 147\u2013167","DOI":"10.1007\/BF02430370"},{"key":"204_CR44","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"RA Russell","year":"1995","unstructured":"Russell RA (1995) Hybrid heuristics for the vehicle routing problem with time windows. Transport Sci 29: 156\u2013166","journal-title":"Transport Sci"},{"key":"204_CR45","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 window constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"204_CR46","first-page":"121","volume":"18","author":"KC Tan","year":"2001","unstructured":"Tan KC, Lee LH, Ou K (2001) Hybrid genetic algorithms in solving ehicle routing problems with time window constraints. Asia-Pacific J Oper Res 18: 121\u2013130","journal-title":"Asia-Pacific J Oper Res"},{"issue":"2","key":"204_CR47","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TITS.2009.2020187","volume":"10","author":"CD Tarantilis","year":"2009","unstructured":"Tarantilis CD, Zachariadis E, Kiranoudis CT (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three dimensional container-loading problem. IEEE Trans Intell Transport Syst 10(2): 255\u2013271","journal-title":"IEEE Trans Intell Transport Syst"},{"key":"204_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9780898718515.ch1","volume-title":"The vehicle routing problem, SIAM monographs on discrete mathematics and applications","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) An overview of vehicle routing problems. In: Toth P, Vigo D (eds) The vehicle routing problem, SIAM monographs on discrete mathematics and applications. Philadelphia, PA, pp 1\u201324"},{"key":"204_CR49","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"E Zachariadis","year":"2009","unstructured":"Zachariadis E, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195: 729\u2013743","journal-title":"Eur J Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-011-0204-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0204-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T06:28:35Z","timestamp":1560234515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-011-0204-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,27]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["204"],"URL":"https:\/\/doi.org\/10.1007\/s10100-011-0204-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,27]]}}}