An Efficient Approach for the Three-Dimensional Container Packing Problem With Practical Constraints

Jin, Zhihong; Ohno, Katsuhisa; Du, Junhua

doi:10.1142/s0217595904000254

Cited by 31 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Recent years have witnessed significant advances in algorithm development for handling CLPs [Eley, 2002;Pisinger, 2002], and increased attention is now focused on intelligent algorithms, such as genetic algorithms [Gehring and Bortfeldt, 1997;Bortfeldt and Gehring, 2001], simulated annealing [Jin et al, 2004], and tabu search algorithms [Bortfeldt et al, 2003]. Furthermore, researchers have begun paying more attention to additional practical constraints.…”

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

“…In their scenario, the size of the containers was fixed. Another work by Jin, Ohno & Du (2002) [6] looked into solving the container-packing problem with additional practical constraints such as loading stability, the rotation of items around the height axis, and the fixed loading (unloading) orders. None of these works relate to computation of container sizes.…”

Section: Literature Reviewmentioning

confidence: 99%

Reducing Carbon Emission through Container Shipment Consolidation and Optimization

Laik¹,

Tan²

2019

JTTE

View full text Add to dashboard Cite

Human's impact on earth through global warming is more or less an accepted fact. Ocean freight is estimated to contribute 4-5% of global carbon emissions. Many manufacturing companies that transfer ship goods through full container loads found themselves under-utilizing the containers and resulting in higher carbon footprint per volume shipment. One of the reasons is the choice of non-ideal container sizes for their shipments. In this paper, we first provide an Integer Programming model to minimize the companies' shipping carbon footprints by selecting the ideal container sizes appropriate for their shipment volumes. Secondly, we proposed a strategy to minimize the carbon footprint by consolidating the shipments in the same country from multiple domestic locations at a port of loading by road freight, before the international sea shipment. A mixed-Integer Programming model has been developed to determine if one should ship each shipment separately or have shipments consolidated first before being shipped. Consolidation fills up the containers more efficiently that reduces the overall carbon footprint. Computational results using real-world data indicates a significant 13.4% reduction carbon emission when selecting the optimal combinations of different sizes of containers and an additional 12.1% reduction in carbon emission when shipment consolidation is applied.

show abstract

“…The SCLP is instead a well-studied problem (see, e.g., Bischoff and Ratcliff [3], Lim et al [19], Jin et al [16], Araujo and Armentano [1], Fanslau and Bortfeldt [10], and Junqueira et al [17]), where the real constraints that we are also facing received an increased attention. According to the survey by Bortfeldt and Wäscher [7], at least 13.9% of the container loading literature deals with weight limit, while weight distribution is considered by 12.1% of the papers.…”

Section: Previous Workmentioning

confidence: 99%

“…Constraint (16) impose that the sum of the angular momenta of the layers on the front axle does not exceed the available capacity Q 1 multiplied by the distance between the axes (δ 2 − δ 1 ) (refer to Figure 1). Constraint (17) impose the same restriction on the back axle of the truck.…”

Section: Axle Weight Constraintsmentioning

confidence: 99%

Mathematical models for multicontainer loading problems

Alonso

Álvarez-Valdés

Iori

et al. 2017

Omega

View full text Add to dashboard Cite

An Efficient Approach for the Three-Dimensional Container Packing Problem With Practical Constraints

Cited by 31 publications

References 19 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

Reducing Carbon Emission through Container Shipment Consolidation and Optimization

Mathematical models for multicontainer loading problems

Contact Info

Product

Resources

About