An efficient approach for the multi-pallet loading problem

Terno, Johannes; Scheithauer, Guntram; Sommerweiß, Uta; Riehme, Jan

doi:10.1016/s0377-2217(99)00263-5

Cited by 126 publications

(61 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several studies consider loading stability, including Bortfeldt and Gehring [2001], Bortfeldt et al [2003], and Terno et al [2000]. Other container factors have also been considered, such as orientation constraints [Gehring and Bortfeldt, 2002] and the grouping of boxes Takahara, 2005].…”

Section: Introductionmentioning

confidence: 99%

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Wang

Levy

2008

European Journal of Operational Research

View full text Add to dashboard Cite

(2008). A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach. European Journal of Operational Research, 191 (1) AbstractIncreasing fuel costs, post-911 security concerns, and economic globalization provide a strong incentive for container carriers to use available container space more efficiently, thereby minimizing the number of container trips and reducing socio-economic vulnerability. A heuristic algorithm based on a tertiary tree model is proposed to handle the container loading problem (CLP) with weakly heterogeneous boxes. A dynamic space decomposition method based on the tertiary tree structure is developed to partition the remaining container space after a block of homogeneous rectangular boxes is loaded into a container. This decomposition approach, together with an optimal-fitting sequencing and an inner-right-corner-occupying placement rule, permits a holistic loading strategy to pack a container. Comparative studies with existing algorithms and an illustrative example demonstrate the efficiency of this algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Wang

Levy

2008

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…This is the approach of Bischoff & Ratcliff [5] in their greedy algorithm and of Terno et al [47] in their branch and bound procedure.…”

Section: Horizontal Layer Building Approachmentioning

confidence: 99%

“…When the cargo is heavy, weight becomes a very restrictive condition, more so than the volume occupied by the boxes. Gehring & Bortfeldt [20], Bortfeldt et al [8], Terno et al [47], and Egeblad et al [14] are some of the authors who address this weight limit constraint.…”

Section: Container Constraintsmentioning

confidence: 99%

“…It is usual that the boxes to be packed differ in weight and also in their ability to withstand pressure from the weight resting on them. This constraint can limit the number of boxes a box can bear above it, as in Bischoff & Ratcliff [5] or can prohibit a particular type of product being placed on top of another type, as in Terno et al [47]. Nevertheless, the most usual load bearing constraint limits the weight which can be applied on top of every box.…”

Section: Item Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

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

“…The more the items are heterogeneous the more complex is the algorithm that calculates the pattern of each layer of the pallet (Wäscher et al, 2007). Not only the pallet needs to be stable, but also efficiently loaded (Terno et al, 1997), minimizing the free space between different items and different pallet layers (Kocjan and Holmström, 2008). Industrial solutions for sensors and actuators aiming at overcoming the needs of flexibility are available and mainly focused on the recognition and picking of non-identical items (RSW, Kuka Robotics, Qubiqa, Grenzebach Automation and Fimec Technologies).…”

Section: Introductionmentioning

confidence: 99%

Fast Deployable Autonomous Systems for Order Picking - How Small and Medium Size Enterprises Can Benefit from the Automation of the Picking Process

Bonini

Urru

Echelmeyer

2016

Proceedings of the 13th International Conference on Informatics in Control, Automation and Robotics

View full text Add to dashboard Cite

Abstract:The paper focuses on a recently introduced paradigm for the logistic process of picking, with respect to the man-to-goods and goods-to-man concept: the robot-to-goods. First the task and system architecture of the fast deployable autonomous commissioning system are described, then the economic efficiency of the system is analysed in a real business case scenario using a simplified method, which is explained and discussed. The clearly positive Net Present Value of the investment and the short Payback Period obtained in the business case prove how the robot-to-goods paradigm for the commissioning process, implemented through the automation of the forklift platform, is economically attractive for small and medium size enterprises.

show abstract

An efficient approach for the multi-pallet loading problem

Cited by 126 publications

References 17 publications

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

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

Fast Deployable Autonomous Systems for Order Picking - How Small and Medium Size Enterprises Can Benefit from the Automation of the Picking Process

Contact Info

Product

Resources

About