Three-Dimensional Bin Packing and Mixed-Case Palletization

References

• Bettinelli A, Ceselli A, Righini G (2008) A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR 6(4):361–374.Google Scholar
• Bischoff EE, Ratcliff M (1995) Issues in the development of approaches to container loading. Omega 23(4):377–390.Google Scholar
• Bortfeldt A, Wäscher G (2013) Constraints in container loading – A state-of-the-art review. Eur. J. Oper. Res. 229(1):1–20.Google Scholar
• Boschetti MA (2004) New lower bounds for the three-dimensional finite bin packing problem. Discrete Appl. Math. 140(1):241–258.Google Scholar
• Chen C, Lee SM, Shen Q (1995) An analytical model for the container loading problem. Eur. J. Oper. Res. 80(1):68–76.Google Scholar
• Clautiaux F, Nguyen A, Brenaut J (2015) Model for the challenge renault/ESICUP: Version 1.3. Accessed October 20, 2016, http://challenge-esicup-2015.org/doc/modele_renault.pdf.Google Scholar
• Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. 20(3):368–384.Link, Google Scholar
• Crainic TG, Perboli G, Tadei R (2009) TS2PACK: A two-level Tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195(3):744–760.Google Scholar
• Cui YP, Zhou Y, Cui Y (2017) Triple-solution approach for the strip packing problem with two-staged patterns. J. Combin. Optim. 34(2):588–604.Google Scholar
• Delignette-Muller ML, Dutang C (2015) Fitdistrplus: An R package for fitting distributions. J. Statist. Software 64(4):1–34.Google Scholar
• Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J. Comput. 15(3):267–283.Link, Google Scholar
• Fekete SP, Schepers J, Van der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3):569–587.Link, Google Scholar
• Hifi M, Kacem I, Nègre S, Wu L (2010) A linear programming approach for the three-dimensional bin-packing problem. Electronic Notes Discrete Math. 36:993–1000.Google Scholar
• Junqueira L, Morabito R, Yamashita DS (2012) Three-dimensional container loading models with cargo stability and load bearing constraints. Comput. Oper. Res. 39(1):74–85.Google Scholar
• Jylänki J (2010) A thousand ways to pack the bin—A practical approach to two-dimensional rectangle bin packing. Accessed March 10, 2016, http://clb.demon.fi/files/RectangleBinPack.pdf.Google Scholar
• Lodi A, Martello S, Vigo D (2002) Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141(2):410–420.Google Scholar
• Lodi A, Martello S, Vigo D (2004) Models and bounds for two-dimensional level packing problems. J. Combin. Optim. 8(3):363–379.Google Scholar
• Martello S, Pisinger D, Vigo D (1998) Algorithm 864. Accessed March 30, 2017, http://www.diku.dk/pisinger/codes.html.Google Scholar
• Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper. Res. 48(2):256–267.Link, Google Scholar
• Martello S, Pisinger D, Vigo D, Boef ED, Korst J (2007) Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Software 33(1):Article No. 7.Google Scholar
• Paquay C, Schyns M, Limbourg S (2016) A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. Internat. Trans. Oper. Res. 23(1–2):187–213.Google Scholar
• Parreño F, Alvarez-Valdés R, Oliveira J, Tamarit JM (2010) A hybrid GRASP/VND algorithm for two-and three-dimensional bin packing. Ann. Oper. Res. 179(1):203–220.Google Scholar
• Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Wren A, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling (North-Holland, Amsterdam), 269–280.Google Scholar
• Toffolo TAM, Esprit E, Wauters T, Berghe GV (2017) A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur. J. Oper. Res. 257(2):526–538.Google Scholar
• Vance PH, Barnhart C, Johnson EL, Nemhauser GL (1994) Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3(2):111–130.Google Scholar
• Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur. J. Oper. Res. 202(2):347–355.Google Scholar
• Zhao X, Bennell JA, Bektaş T, Dowsland K (2016) A comparative review of 3D container loading algorithms. Internat. Trans. Oper. Res. 23(1–2):287–320.Google Scholar
• Zhu W, Lim A (2012) A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem. Eur. J. Oper. Res. 222(3):408–417.Google Scholar
• Zhu W, Huang W, Lim A (2012a) A prototype column generation strategy for the multiple container loading problem. Eur. J. Oper. Res. 223(1):27–39.Google Scholar
• Zhu W, Zhang Z, Oon WC, Lim A (2012b) Space defragmentation for packing problems. Eur. J. Oper. Res. 222(3):452–463.Google Scholar