A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

[1]  Ana Moura,et al.  An integrated approach to the vehicle routing and container loading problems , 2009, OR Spectr..

[2]  Reinaldo Morabito,et al.  MIP-based approaches for the container loading problem with multi-drop constraints , 2012, Ann. Oper. Res..

[3]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[4]  Amit Bhattacharya,et al.  Occupational Ergonomics : Theory and Applications, Second Edition , 2012 .

[5]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..

[6]  X. D. Chen,et al.  An Optimization Model for the Vehicle Routing Problem in Multi-product Frozen Food Delivery , 2014 .

[7]  Søren Gram Christensen,et al.  Container loading with multi-drop constraints , 2009, Int. Trans. Oper. Res..

[8]  Eric Haines,et al.  Point in Polygon Strategies , 1994, Graphics Gems.

[9]  Reinaldo Morabito,et al.  An optimization model for the vehicle routing problem with practical three-dimensional loading constraints , 2013, Int. Trans. Oper. Res..

[10]  Herbert Edelsbrunner,et al.  On the Intersection of Orthogonal Objects , 1981, Inf. Process. Lett..

[11]  D. Mack,et al.  A parallel hybrid local search algorithm for the container loading problem , 2004 .

[12]  Michel Gendreau,et al.  A Tabu Search Algorithm for a Routing and Container Loading Problem , 2006, Transp. Sci..

[13]  Miomir Vukobratovic,et al.  Zero-Moment Point - Thirty Five Years of its Life , 2004, Int. J. Humanoid Robotics.

[14]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[15]  Chun-Cheng Lin,et al.  On the Three-Dimensional Container Packing Problem under Home Delivery Service , 2011, Asia Pac. J. Oper. Res..

[16]  Stig Nordbeck,et al.  Computer cartography point-in-polygon programs , 1967 .

[17]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[18]  Sara Ceschia,et al.  Local search for a multi-drop multi-container loading problem , 2013, J. Heuristics.

[19]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[20]  Ramón Alvarez-Valdés,et al.  A Maximal-Space Algorithm for the Container Loading Problem , 2008, INFORMS J. Comput..

[21]  Emmanouil E. Zachariadis,et al.  A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem , 2009, IEEE Transactions on Intelligent Transportation Systems.

[22]  Norman I. Badler,et al.  Special problems in human movement simulation , 1980, SIGGRAPH '80.

[23]  Jin-Ling Lin,et al.  A Study of Optimal System for Multiple-Constraint Multiple-Container Packing Problems , 2006, IEA/AIE.

[24]  Bryan Kok Ann Ngoi,et al.  Applying spatial representation techniques to the container packing problem , 1994 .

[25]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[26]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[27]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[28]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[29]  Guenther Fuellerer,et al.  Metaheuristics for vehicle routing problems with three-dimensional loading constraints , 2010, Eur. J. Oper. Res..

[30]  Wenbin Zhu,et al.  A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem , 2012, Eur. J. Oper. Res..

[31]  Eberhard E. Bischoff,et al.  Weight distribution considerations in container loading , 1999, Eur. J. Oper. Res..

[32]  W. B. Dowsland,et al.  Practical Considerations of the Pallet-Loading Problem , 1985 .

[33]  Nelson Maculan,et al.  A greedy search for the three‐dimensional bin packing problem: the packing static stability case , 2003 .

[34]  Mauricio G. C. Resende,et al.  A parallel multi-population biased random-key genetic algorithm for a container loading problem , 2012, Comput. Oper. Res..

[35]  Donald R. Chand,et al.  An Algorithm for Convex Polytopes , 1970, JACM.

[36]  T. S. Mruthyunjaya,et al.  A computational geometry approach for determination of boundary of workspaces of planar manipulators with arbitrary topology , 1999 .