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

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

0.00 Avg rating0 Votes
Article ID: iaor201528992
Volume: 23
Issue: 1-2
Start Page Number: 215
End Page Number: 238
Publication Date: Jan 2016
Journal: International Transactions in Operational Research
Authors: , ,
Keywords: transportation: general, heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.