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

Jin, Bo; Zhu, Wenbin; Lim, Andrew

doi:10.1016/j.ejor.2014.07.038

Cited by 85 publications

(38 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Caserta, Schwarze, and Voß (2012) prove that the blocks relocation problem with and without Assumption A1 is NP-hard. Several heuristic solution approaches exist which are mainly based on branch and bound procedures or tree search (Caserta, Schwarze, & Voß, 2009;Caserta, Voß, & Sniedovich, 2011;Forster & Bortfeldt, 2012;Jin, Zhu, & Lim, 2015;Jovanovic & Voß, 2014;Kim & Hong, 2006;Rei & Pedroso, 2012;Ünlüyurt & Aydin, 2012;Wu, Hernández, & Ting, 2010;Zhang, Guo, Zhu, Lim, & Cheang, 2010;Zhu, Qin, Lim, & Zhang, 2012).…”

Section: Introductionmentioning

confidence: 99%

An improved mathematical formulation for the blocks relocation problem

Zehendner

Caserta

Feillet

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

An improved mathematical formulation for the blocks relocation problem

Zehendner

Caserta

Feillet

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

“…The size of the look-ahead tree would increase exponentially as the search depth increases, so it is impossible to explore the whole search space [14]. To overcome this drawback, we impose limitation both on the depth of the tree search and on the number of children generated for each branch node.…”

Section: Methodsmentioning

confidence: 99%

“…Therefore, look-ahead algorithm method becomes one of method which could apply to the truck dispatch problem in open pit mine area. This method has been widely used for utilization of container relocation problem by Jin, Zhu, & Lim [14] and Zhu & Lim [15]. Look-ahead method aims to take into account and react to changes in real-time systems [16].…”

Section: Methodsmentioning

confidence: 99%

“…To overcome this drawback, we impose limitation both on the depth of the tree search and on the number of children generated for each branch node. So there are only a limited few combinations to be inspected on the look-ahead tree, to be able to build a search tree consisting of branches that are very promising in the hope of leading to a highquality solution [14].…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Simulation–optimization Truck Dispatch Problem Using Look – Ahead Algorithm in Open Pit Mines

Fadin¹

2017

GEOMATE

View full text Add to dashboard Cite

ABSTRACT:Material transportation in open-pit mines area contributes to 50% of the operating costs. Therefore, efficiency on the material transportation, specifically in truck dispatching problem needs to be done in order to get the best dispatching rules for the allocation of trucks and loaders. This research uses look-ahead algorithm approach as a new method to solve truck dispatch problem in open-pit mines area. The proposed approach was developed by simulation and optimization model in solving the truck dispatch problem using real data-situation. The dispatching result aims to answer the question where and when should a truck go so that could maximize the number of production and provide significant operating cost savings to the mining industry. This study uses a discrete event simulation to test several scenarios methods of truck dispatch, including LP-Gap, the percentage of LP-Gap, multi-stage algorithm and look-ahead algorithm. The results of the research shows that the look-ahead algorithm scenario gives the highest result with the number of production, productivity of loaders, productivity of trucks with block and without block; 43,533 ton, 64.44%, 80.53% and 63.47%.

show abstract

“…Their modeling approach in the parameter setting has inspired the mathematical model in our work. Jin, Zhu, and Lim () extend their previous work (Jin, Lim, & Zhu, ) and present an improved greedy look‐ahead heuristic to find an optimized operation plan for the crane with the least number of container relocations. They also investigate iterative deepening A * algorithms using new lower bound measures and heuristics.…”

Section: Introductionmentioning

confidence: 98%

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

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

Cited by 85 publications

References 19 publications

An improved mathematical formulation for the blocks relocation problem

An improved mathematical formulation for the blocks relocation problem

Simulation–optimization Truck Dispatch Problem Using Look – Ahead Algorithm in Open Pit Mines

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

Contact Info

Product

Resources

About