Matheuristics for slot planning of container vessel bays

DOI10.1016/j.ejor.2019.09.042zbMath1431.90018OpenAlexW2975626844WikidataQ127189822 ScholiaQ127189822MaRDI QIDQ2286874

Rune Møller Jensen, Aleksandra Korach, Berit Dangaard Brouer

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.09.042

zbMATH Keywords

large neighbourhood searchmatheuristicsstowage planningOR in maritime industryslot planning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Integer linear programming models for the containership stowage problem ⋮ Joint optimization of container slot planning and truck scheduling for tandem quay cranes

Cites Work

• The terminal-oriented ship stowage planning problem
• A general heuristic for vehicle routing problems
• Container ship stowage problem complexity and connection to the coloring of circle graphs
• A constraint programming model for fast optimal stowage of container vessel bays
• On the complexity of container stowage planning problems
• A survey on matheuristics for routing problems
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• Container stowage planning: a methodology for generating computerised solutions
• The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem

This page was built for publication: Matheuristics for slot planning of container vessel bays