Heuristic algorithms for container pre-marshalling problems

Huang, Shan-Huen; Lin, Tsan-Hwan

doi:10.1016/j.cie.2011.08.010

Cited by 58 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, by converting the current yard layout into an ideal layout, no unproductive container moves or reshufflings on the yard will be necessary during actual loading operations. This concept is known as re-marshalling (Kim and Bae 1998;Lee and Hsu 2007;Hirashima 2009;Lee and Chao 2009;Yu , Cheng, and Ting 2009;Choon et al 2010;Bortfeldt and Forster 2012;Huang and Lin 2012) and a simplified illustration is given in Figure 2.…”

Section: Introductionmentioning

confidence: 98%

Simulation for performance evaluation of the housekeeping process

Legato¹,

Mazza²,

Trunfio³

2012

Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC)

View full text Add to dashboard Cite

The literature on the optimization of container terminal logistics has recently focused on space assignment and equipment management within the yard sub-system. Yet, to our knowledge, no models have been proposed for housekeeping, i.e. the process according to which a container is moved from one yard position to another during its stay in the terminal's storage area. Housekeeping has only been addressed as a conceptual choice lying behind yard operating rules when dealing with empirical investigations for intelligent yard stacking. Here we propose a queuing-based representation of the current housekeeping process in a real container terminal and solve it by discrete-event simulation to i) assess the efficiency of the housekeeping operations under unforeseen events or process disturbances and ii) estimate the related productivity and waiting phenomena which, in turn, affect the vessel turn-around time. Sample results returned by the simulator are presented to illustrate possible usage via scenario analysis.

show abstract

Section: Introductionmentioning

confidence: 98%

Simulation for performance evaluation of the housekeeping process

Legato¹,

Mazza²,

Trunfio³

2012

Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC)

View full text Add to dashboard Cite

show abstract

“…In the CPMP-B, an initial layout and a final layout are both given, and the objective is to minimize the number of rehandles in transforming the initial layout to the final layout. Lee and Hsu (2007) provided an integer programming formulation for both types of the CPMP as a multi-commodity flow problem, and Huang and Lin (2012) proposed heuristic algorithms for both types of the CPMP. Metaheuristics have also been investigated for the CPMP, such as neighborhood search (Lee & Chao, 2009), corridor method (Caserta & Voß, 2009b), lowest priority first heuristic (Expósito-Izquierdo, Melián-Batista, & Moreno-Vega, 2012) and tree search (Bortfeldt & Forster, 2012).…”

Section: Introductionmentioning

confidence: 99%

Solving the container relocation problem by an improved greedy look-ahead heuristic

Jin

Zhu

Lim

2015

European Journal of Operational Research

View full text Add to dashboard Cite

“…Expósito-Izquierdo, Melián-Batista, and Moreno-Vega (2012) propose a multistart heuristic to minimize the number of rehandles, which is more efficient compared with that of Lee and Chao (2009). Huang and Lin (2012) and Wang, Jin, and Lim (2015) solve the variants of the CPMP using heuristic algorithms. Apart from heuristics, Lee and Hsu (2007) also develop an IP model to tackle the CPMP.…”

Section: Introductionmentioning

confidence: 99%

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

Zhu

Guo

et al. 2019

Naval Research Logistics

View full text Add to dashboard Cite

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.

show abstract

Heuristic algorithms for container pre-marshalling problems

Cited by 58 publications

References 9 publications

Simulation for performance evaluation of the housekeeping process

Simulation for performance evaluation of the housekeeping process

Solving the container relocation problem by an improved greedy look-ahead heuristic

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

Contact Info

Product

Resources

About