Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching

DOI10.1016/j.endm.2014.11.031zbMath1362.90257OpenAlexW1966308005MaRDI QIDQ2631277

Roberto Maja, Maurizio Bruglieri, Eliane Gerzelj, Andrea Guenzani, Rodrigo de Alvarenga Rosa

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.031

zbMATH Keywords

matheuristicgranite block maritime transportationport yard optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Routing problems with loading constraints
• Three-dimensional bin packing problem with variable bin height
• Loading plates with non-identical items
• An analytical model for the container loading problem
• Local branching
• Constraints in container loading -- a state-of-the-art review
• Variable neighborhood search and local branching
• Guided Local Search for the Three-Dimensional Bin-Packing Problem

This page was built for publication: Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching