A heuristic approach to the three dimensional cargo loading problem

Han, Ching Ping; Knott, Kenneth; Egbelu, Pl J.

doi:10.1016/0360-8352(86)90059-8

Cited by 5 publications

(6 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Han et al. () construct an L‐shape pattern by placing boxes along the base and one vertical edge of the container. George () designs a heuristic to solve the same problem of identical boxes.…”

Section: Placement Heuristicsmentioning

confidence: 99%

A comparative review of 3D container loading algorithms

Zhao

Bennell

Bektaş

et al. 2014

Int Trans Operational Res

125

View full text Add to dashboard Cite

Three-dimensional cutting and packing problems have a range of important applications and are of particular relevance to the transportation of cargo in the form of container loading problems. Recent years have seen a marked increase in the number of papers examining a variant of the container loading problem ranging from largely theoretical to implementations that focus on meeting the many critical real-world constraints. In this paper, we review the literature focusing on the solution methodologies employed by researchers, with the aim of providing insight into some of the critical algorithmic design issues. In addition, we provide an extensive comparison of algorithm performance across the benchmark literature.

show abstract

Section: Placement Heuristicsmentioning

confidence: 99%

A comparative review of 3D container loading algorithms

Zhao

Bennell

Bektaş

et al. 2014

Int Trans Operational Res

125

View full text Add to dashboard Cite

show abstract

“…The general pallet-packing problem can be viewed as a twodimensional cutting stock problem [3,4]. The three-dimensional packing problem most frequently consists in finding efficient positioning patterns of identical (rectangular or cylindrical) objects on a rectangular base (pallet), where the vertical orientation of the objects is determined by practical constraints [5,6,7,8].…”

Section: Review Of the Packing Problemmentioning

confidence: 99%

Optimization model for part nesting for packing problem

Osman

2013

2013 IEEE International Conference on Industrial Engineering and Engineering Management

View full text Add to dashboard Cite

The problem of packing cylindrical parts into rectangular is complex and involves issues relating to geometry, and heterogeneity in the parts and in their nesting requirements. Presently, putting parts within the internal diameter of another part is accomplished ingenuity by operators who are unable to decide on the best nesting that maximizes the number of parts being nested. This paper addresses the nesting of parts within one another as subproblem. We describe the development of integer LP model that resembles the transportation problem for nesting of cylindrical parts into rectangular. The model considers rules that need to be followed in part nesting.

show abstract

“…It also tries to fill the blank spaces trapped between the layers by a "flexible width" idea so as to increase the volume utilisation. Han et al (1989) used a combination of heuristics and backwards dynamic programming to pack boxes of identical shape and size. The objective of their approach was to maximise the number of boxes packed by maximising the edge length utilisation of each layer.…”

Section: Heuristic Algorithmsmentioning

confidence: 99%

Constraint‐based spatial representation technique for the container packing problem

Chua

Narayanan²,

Loh³

1998

Integrated Manufacturing Systems

View full text Add to dashboard Cite

The spatial representation technique is an efficient method for packing boxes into a container; however, it has a limitation in dealing with constraints. For practical applications, there are however limitations when dealing with constraints. These constraints provide flexibility for the user to decide which boxes should be placed first. After imposing the initial conditions, the optimisation packing algorithm based on the spatial representation technique ensures that the boxes remaining in the item list are packed as efficiently as possible into the container. The packing plan is then generated during the run time to provide visualisation of the result of actual packing sequences. It also simultaneously outputs a graphical file to the Autocad software for printing and detailed study. The program can be implemented under either the DOS platform or the Windows platform on an IBM PC. The performance is evaluated using data from another algorithm. The results confirm that the enhanced algorithm can manage the user‐specified constraints with good volume utilisation.

show abstract

A heuristic approach to the three dimensional cargo loading problem

Cited by 5 publications

References 1 publication

A comparative review of 3D container loading algorithms

A comparative review of 3D container loading algorithms

Optimization model for part nesting for packing problem

Constraint‐based spatial representation technique for the container packing problem

Contact Info

Product

Resources

About