Loading, unloading and premarshalling of stacks in storage areas: Survey and classification

Lehnfeld, Jana; Knust, Sigrid

doi:10.1016/j.ejor.2014.03.011

Cited by 151 publications

(89 citation statements)

References 69 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They minimize the number of relocations and the traveled crane distance. For a survey on the blocks relocation problem as well as related problems see Caserta, Schwarze, and Voß (2011) and Lehnfeld and Knust (2014).…”

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

“…However, no details about reshuffling rules for containers are provided. The most recent overview of loading, unloading and pre-marshalling problems is given in [31], which provides a classification and theoretical overview of a wide range of stowage problems.…”

Section: Literature Reviewmentioning

confidence: 99%

Solving the pre-marshalling problem to optimality with A* and IDA*

2016

View full text Add to dashboard Cite

We present a novel solution approach to the container pre-marshalling problem using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increases the number of pre-marshalling instances that can be solved to optimality. A* and IDA* are graph search algorithms that use heuristics combined with a complete graph search to find optimal solutions to problems. The container pre-marshalling problem is a key problem for container terminals seeking to reduce delays of inter-modal container transports. The goal of the container pre-marshalling problem is to find the minimal sequence of container movements to shuffle containers in a set of stacks such that the resulting stacks are arranged according to the time each container must leave the stacks. We evaluate our approach on three well-known datasets of pre-marshalling problem instances, solving over 500 previously unsolved instances to optimality, which is nearly twice as many instances as the current state-of-the-art method solves. e

show abstract

“…Storage loading problems appear in several practical applications, e.g., in the context of container terminals, container ships, warehouses or steel yards, see [33]. Especially container transportation plays a vital role in today's global economy.…”

Section: Introductionmentioning

confidence: 99%

“…For example, larger items are not allowed to be put on smaller ones, or items with a later departure time may not be stacked on items with an earlier departure time. For a survey and a classification scheme of such problems we refer to [33]. Complexity results for stacking problems taking into account a limited height of the stacks and stacking constraints are provided in [18].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robust storage loading problems with stacking and payload constraints

Goerigk

Knust

2016

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

We consider storage loading problems where items with uncertain weights have to be loaded into a storage area, taking into account stacking and payload constraints. Following the robust optimization paradigm, we propose strict and adjustable optimization models for finite and interval-based uncertainties. To solve these problems, exact decomposition and heuristic solution algorithms are developed. For strict robustness, we also propose a compact formulation based on a characterization of worst-case scenarios. Computational results for randomly generated data with up to 300 items are presented showing that the robustness concepts have different potential depending on the type of data being used.

show abstract

Loading, unloading and premarshalling of stacks in storage areas: Survey and classification

Cited by 151 publications

References 69 publications

An improved mathematical formulation for the blocks relocation problem

An improved mathematical formulation for the blocks relocation problem

Solving the pre-marshalling problem to optimality with A* and IDA*

Robust storage loading problems with stacking and payload constraints

Contact Info

Product

Resources

About