On the complexity of container stowage planning problems

Tierney, Kevin; Pacino, Dario; Jensen, Rune Møller

doi:10.1016/j.dam.2014.01.005

Cited by 42 publications

(24 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As another example we refer to the following setting from [41]: In the hatch overstow problem, containers need to be loaded onto a ship with several hatches, where different areas of the ship have to be filled separately. In our setting, in the first stage we assign containers to subsets of stacks in the terminal (corresponding to the subareas on the ship).…”

Section: Adjustable Robustnessmentioning

confidence: 99%

Robust storage loading problems with stacking and payload constraints

Goerigk

Knust

2016

European Journal of Operational Research

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

Section: Adjustable Robustnessmentioning

confidence: 99%

Robust storage loading problems with stacking and payload constraints

Goerigk

Knust

2016

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Imai et al (2006) present a unified approach for addressing the route planning problem, from both the liner and the terminal manager point of view. We should note that, from a decision point of view, the stowage planning problem, often denoted as MBPP, is a NP hard optimization problem (Avriel et al, 2000;Tierney et al, 2014). For this reason, quite a large number of heuristics have been recently proposed in literature (see, e.g.…”

Section: Introductionmentioning

confidence: 99%

A shipping line stowage-planning procedure in the presence of hazardous containers

Ambrosino

Sciomachen

2018

Marit Econ Logist

View full text Add to dashboard Cite

This work addresses the stowage planning problem for containerships, known as the Master Bay Plan problem (MBPP), in the presence of hazardous containers. A novel procedure, based on the principles included in the International Maritime Dangerous Goods (IMDG) Code for stowing containers in liner services is presented. Further, shipping alliances are considered. Our aim is to assist the shipping line coordinator (SLC) to optimize the available space assigned to each alliance member. This is possible thanks to the proposed procedure that finds stowage solutions for ships with different structures, capacity and available sections for hazardous containers, and for companies having different stowage strategies. Our procedure can be implemented in a tool able to verify the stowage constraints and the segregation rules in case of hazardous cargo. Two simple real-life multi-port stowage plans involving hazardous containers are presented and analyzed to illustrate the proposed procedure.

show abstract

“…Solution approaches are divided between theoretical works, where a deeper understanding of specific optimisation challenges is sought (e.g. [10,5,12,3]), and applied approached where heuristic and decomposition methods aim at solving rich stowage planning problems that can be implemented in practice (i.e. [1,2,[6][7][8]).…”

Section: Introductionmentioning

confidence: 99%

Crane Intensity and Block Stowage Strategies in Stowage Planning

Pacino

2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

 Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

On the complexity of container stowage planning problems

Cited by 42 publications

References 4 publications

Robust storage loading problems with stacking and payload constraints

Robust storage loading problems with stacking and payload constraints

A shipping line stowage-planning procedure in the presence of hazardous containers

Crane Intensity and Block Stowage Strategies in Stowage Planning

Contact Info

Product

Resources

About