Three-dimensional container loading models with cargo stability and load bearing constraints

Junqueira, Leonardo; Morábito, Reinaldo; Yamashita, Denise Sato

doi:10.1016/j.cor.2010.07.017

Cited by 153 publications

(105 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…"), allowing 90 o rotations of items on the horizontal plane, as in Haessler & Talbot [25], and Iori & Martello [28]. Nevertheless, sometimes only one orientation is allowed and boxes cannot be rotated, as in Morabito & Arenales [37] and Junqueira et al [31]. Conversely, in some cases all six possible orientations are permitted and boxes can rotate freely, as in Parreño et al [40] and Ratcliff & Bischoff [44].…”

Section: Item Constraintsmentioning

confidence: 96%

“…Nevertheless, the most usual load bearing constraint limits the weight which can be applied on top of every box. Some recent examples are the papers by Bischoff [3], Christensen & Rousoe [12], Junqueira et al [31], and Alonso et al [1].…”

Section: Item Constraintsmentioning

confidence: 99%

“…If this percentage is 100%, we speak of full support (Bortfeldt & Gehring [7], Araujo & Armentano [2], Fanslau & Bortfeldt [17], Ngoi et al [39]). Lower percentages correspond to partial support (Jin et al [29], Junqueira et al [31]). …”

Section: Load Constraintsmentioning

confidence: 99%

“…In any case, the CLP is an NP-hard problem because the NP-hard one-dimensional knapsack problem can be transformed into it. As a consequence, few exact algorithms have been proposed to solve the problem (Fekete et al [18], Martello et al [35], Junqueira et al [31]). In contrast, there are many heuristic and metaheuristic procedures based…”

Section: Adding Realistic Constraints To the Basic Container Loading mentioning

confidence: 99%

“…Full horizontal stability means that each box is either adjacent to other boxes or to the container wall on all its sides ( [29], [31]). Bischoff & Ratcliff [5] and Eley [15] evaluate the lateral support of the load by the percentage of boxes that are not in contact with other boxes or a container wall.…”

Section: Load Constraintsmentioning

confidence: 99%

See 4 more Smart Citations

A Grasp Algorithm for the Container Loading Problem With Multi-Drop Constraints

2015

View full text Add to dashboard Cite

ABSTRACT. This paper studies a variant of the container loading problem in which to the classical geometric constraints of packing problems we add other conditions appearing in practical problems, the multidrop constraints. When adding multi-drop constraints, we demand that the relevant boxes must be available, without rearranging others, when each drop-off point is reached. We present first a review of the different types of multi-drop constraints that appear in literature. Then we propose a GRASP algorithm that solves the different types of multi-drop constraints and also includes other types of realistic constraints such as full support of the boxes and load bearing strength. The computational results validate the proposed algorithm, which outperforms the existing procedures dealing with multi-drop conditions and is also able to obtain good results for more standard versions of the container loading problem.

show abstract