Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem

Zweers, Bernard G.; Bhulai, Sandjai; Mei, Rob van der

doi:10.1016/j.ejor.2019.11.067

Cited by 16 publications

(16 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this heuristic, we need a method to estimate the number of relocation moves for a given bay. We use the rule-based method presented in Zweers et al (2020) to obtain the estimation. The idea behind this estimation method is to use three rules to estimate the expected number of relocation moves for a single container.…”

Section: Solution Methodsmentioning

confidence: 99%

“…The concept of pre-processing a container bay to reduce the number of relocation moves was first introduced by Zweers et al (2020). In this paper, the weighted sum of pre-processing moves and expected relocation moves is minimized and with that it generalizes both the SCRP and the CPMP:…”

Section: Literature Reviewmentioning

confidence: 99%

“…We have decided to make a few assumptions to keep the SCRPCPP tractable while respecting the current practice at container terminals as much as possible. The assumptions are the same as the ones made in Zweers et al (2020). In this section, we explain why these assumptions are realistic and what kind of problems arise if they are relaxed.…”

Section: Assumptionsmentioning

confidence: 99%

“…Nevertheless, if two pre-processing moves are allowed, this container will be moved. If more than two pre-processing moves are allowed for the bay of Figure Figure 2: Layout of a bay with five stacks that have a maximum height of four containers (Zweers et al, 2020).…”

Section: Running Examplementioning

confidence: 99%

“…There are in total S 2 possible combinations, but we only consider combinations of stacks for which fewer pre-processing moves were needed than the available pre-processing moves. For all these combinations, the remaining number of relocation moves are calculated using the rule-based estimation method presented in Zweers et al (2020). This rulebased estimation method produces fast and rather accurate predictions for the number of relocation moves for a bay.…”

Section: Phase 3: Selectionmentioning

confidence: 99%

See 4 more Smart Citations

Pre-processing a container yard under limited available time

Zweers

Bhulai

Mei

2020

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

To pick up a container from a container terminal, other containers may need to be relocated to other positions. In practice, these relocation moves are usually done when it is busy at a terminal. However, if the crane is idle for some amount of time, it may be more efficient to execute some pre-processing moves to reduce the number of future relocation moves. In this paper, we propose a model for optimal pre-processing moves if the available time is limited. We develop a heuristic to produce fast solutions for this new optimization problem. This heuristic consists out of multiple phases and for each phase, two different approaches are possible, and thus, the heuristic produces multiple solutions. Besides that, an optimal branch-and-bound algorithm is presented. Third, we propose another heuristic in which the remaining relocation moves are estimated in a sub-optimal way in the branch-and-bound method. This algorithm is not guaranteed to find the optimal solution, but its running time is faster than the optimal branch-and-bound method. Finally, we give an integer linear program that can be used to extend these solutions for a single bay of containers to a complete yard of containers.

show abstract

Section: Solution Methodsmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Assumptionsmentioning

confidence: 99%

Section: Running Examplementioning

confidence: 99%

Section: Phase 3: Selectionmentioning

confidence: 99%

See 3 more Smart Citations