An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints

Operations Research

Volumn 62, Issue 5, 2014, Pages 1126-1141

  Côté, Jean Franҫois ^a   Gendreau, Michel ^a,b   Potvin, Jean Yves ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Branch and cut; Two dimensional packing; Unloading constraints; Vehicle routing

Indexed keywords

BENCHMARKING; INTEGER PROGRAMMING; NUMERICAL METHODS; VEHICLE ROUTING;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; DECOMPOSITION APPROACH; FEASIBILITY PROBLEM; INTEGER SOLUTIONS; NUMERICAL COMPARISON; PREPROCESSING TECHNIQUES; TWO-DIMENSIONAL PACKING;

UNLOADING;

EID: 84908275819     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2014.1307     Document Type: Article

References (26)

1. Alvarez-Valdes R, Parreño F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectrum 31(2):431-459.
2. Arahori Y, Imamichi T, Nagamochi H (2012) An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39(12):2991-3011.
3. Belov G, Rohling H (2013) LP bounds in an interval-graph algorithm for orthogonal-packing feasibility. Oper. Res. 61(2):483-497.
4. Bortfeldt A, Wäscher G (2013) Constraints in container loading - A state-of-the-art review. Eur. J. Oper. Res. 229(1):1-20.
5. Boschetti MA, Montaletti L (2010) An exact algorithm for the twodimensional strip-packing problem. Oper. Res. 58(6):1774-1791.
6. Caprara A, Monaci M (2009) Bidimensional packing by bilinear programming. Math. Programming 118(1):75-108.
7. Clautiaux F, Carlier J, Moukrim A (2007) A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3):1196-1211.
8. Clautiaux F, Jouglet A, Carlier J, Moukrim A (2008) A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3):944-959.
9. Codato G, Fischetti M (2006) Combinatorial Benders' cuts for mixedinteger linear programming. Oper. Res. 54(4):756-766.
10. Cordeau JF, Iori M, Ropke S, Vigo D (2007) Branch-and-cut-and-price for the capacitated vehicle routing problem with two-dimensional loading constraints. Presented at ROUTE 2007, Jekyll Island, Glynn County, GA, May 2007.
11. Côté JF, Iori M, Dell'Amico M (2014) Combinatorial Benders' cuts for the strip packing problem. Oper. Res. 62(3):643-661.
12. Duhamel C, Lacomme P, Quilliot A, Toussaint H (2011) A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3):617-640.
13. Fekete S, Schepers J (2004) A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29(2):353-368.
14. Fekete S, Schepers J, van der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3):569-587.
15. Fuellerer G, Doerner KF, Hartl RF, Iori M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput. Oper. Res. 36(3):655-673.
16. Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1):4-18.
17. Herz JC (1972) Recursive computational procedure for two-dimensional stock cutting. IBM J. Res. Development 16(5):462-469.
18. Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4-27.
19. Iori M, Salazar-González JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Sci. 41(2):253-264.
20. Kenmochi M, Imamichi T, Nonobe K, Yagiura M, Nagamochi H (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1):73-83.
21. Leung SCH, Zhang Z, Zhang D, Hua X, Lim MK (2013) A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur. J. Oper. Res. 225(2):199-210.
22. Martello S, Monaci M, Vigo D (2003) An exact approach to the strip-packing problem. INFORMS J. Comput. 15(3):310-319.
23. Mesyagutov M, Scheithauer G, Belov G (2012) LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39(10):2425-2438.
24. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455-472.
25. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 195(3):729-743.
26. Zemel E (1989) Easily computable facets of the knapsack polytope. Math. Oper. Res. 14(4):760-765.