A tree search procedure for the container pre-marshalling problem

Bortfeldt, Andreas; Förster, Florian

doi:10.1016/j.ejor.2011.10.005

Cited by 88 publications

(70 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This study extends the lower bound calculation introduced in Ref. [1]. Since the application of a movement to a bay is performed independently of one another, the for-loop in the procedure in FIGURE 3 (b) is parallelized when the collectPossibleMovements function returns more than one movement.…”

Section: Resultsmentioning

confidence: 79%

“…The seventh one shows the mean number of movements that is shown in Ref. [1]. The eighth one shows the difference between the value in the sixth column and that in the seventh one, i.e., the value in the seventh one minus that in the sixth one.…”

Section: Resultsmentioning

confidence: 99%

“…We do not achieve any fixed bay when we discard all XB moves in the manner described in Ref. [1] when BG moves or GG moves are feasible. A stochastic selection of movement is introduced in Ref.…”

Section: Motivation Of This Studymentioning

confidence: 99%

“…[1]. A container d. of is said to be fixed if also dly satisfies one of the following conditions: no ont has the lowest priority and is well-placed.…”

Section: Definitions Of Cpmp and Related Itemsmentioning

confidence: 99%

“…[1]. In the classification, all container movements belong to one of four classes, i.e., BG, GG, BB, and GB.…”

Section: Definitions Of Cpmp and Related Itemsmentioning

confidence: 99%

See 4 more Smart Citations

Search space reduction with multiset for effectively solving the container pre-marshalling problem

Koike

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

Abstract. The task of finding the minimum sequence of container movements that transforms an initial bay into a bay that does not require redundant relocations during an actual loading operation is referred to as the container pre-marshalling problem (CPMP). A majority of existing approaches focus only on improving computational efficiency through heuristics, which may not guarantee the optimality of obtained solutions. This paper discusses an efficient search method for obtaining optimal solutions of the CPMP. Unlike most existing approaches, which introduce heuristics for efficiency, this paper pursues an optimization method that preserves optimality without heuristics. Further, through experimental results, we demonstrate how the proposed approach surpasses heuristic approaches in both optimality and efficiency in large-scale problem instances.

show abstract

Section: Resultsmentioning

confidence: 79%

Section: Resultsmentioning

confidence: 99%

Section: Motivation Of This Studymentioning

confidence: 99%

“…[1]. A container d. of is said to be fixed if also dly satisfies one of the following conditions: no ont has the lowest priority and is well-placed.…”

Section: Definitions Of Cpmp and Related Itemsmentioning

confidence: 99%

“…[1]. In the classification, all container movements belong to one of four classes, i.e., BG, GG, BB, and GB.…”

Section: Definitions Of Cpmp and Related Itemsmentioning

confidence: 99%

See 3 more Smart Citations

Search space reduction with multiset for effectively solving the container pre-marshalling problem

Koike

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

show abstract

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

Boywitz

Boysen

Briskorn

2016

Naval Research Logistics

View full text Add to dashboard Cite

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016

show abstract

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

A tree search procedure for the container pre-marshalling problem

Cited by 88 publications

References 18 publications

Search space reduction with multiset for effectively solving the container pre-marshalling problem

Search space reduction with multiset for effectively solving the container pre-marshalling problem

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

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

Contact Info

Product

Resources

About