On the complexity of container stowage planning problems

DOI10.1016/J.DAM.2014.01.005MaRDI QIDQ2449077zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 6 May 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.01.005

zbMATH Keywords

computational complexitycontainer stowageliner shippingoverstowage

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Principles of combinatorial optimization applied to container-ship stowage planning
• A decomposition heuristics for the container ship stowage problem
• Container stowage planning: a methodology for generating computerised solutions
• Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts
• scientific article; zbMATH DE number 2144389
• Integer linear programming models for the containership stowage problem
• Container ship stowage problem complexity and connection to the coloring of circle graphs
• The terminal-oriented ship stowage planning problem

Cites work

• Container ship stowage problem complexity and connection to the coloring of circle graphs
• Container stowage planning: a methodology for generating computerised solutions
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2144389 (Why is no real title available?)
• Interval scheduling on identical machines
• The complexity of colouring circle graphs (extended abstract)

Cited in

(19)

• Stowage planning for container ships to reduce the number of shifts
• Container ship stowage problem complexity and connection to the coloring of circle graphs
• An exact algorithm for the unrestricted block relocation problem
• Towards real-time automated stowage planning -- optimizing constraint test ordering
• Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• Integer linear programming models for the containership stowage problem
• Matheuristics for slot planning of container vessel bays
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts
• Complexity results for storage loading problems with stacking constraints
• Robust storage loading problems with stacking and payload constraints
• Scheduling cranes at an indented berth
• A biased random-key genetic algorithm for the container pre-marshalling problem
• An asymptotically optimal algorithm for online stacking
• Cost minimizing planning of container inspection and repair in multiple facilities
• Uncertainty in maritime ship routing and scheduling: a literature review
• Approximate dynamic programming for container stacking
• Reconfiguring shortest paths in graphs

This page was built for publication: On the complexity of container stowage planning problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449077)