Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic

DOI10.1016/j.cor.2019.02.015zbMath1458.90332OpenAlexW2919491341WikidataQ128277520 ScholiaQ128277520MaRDI QIDQ1734831

Kjetil Fagerholt, Frank Meisel

Publication date: 27 March 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.02.015

zbMATH Keywords

schedulingmixed integer programsmatheuristicKiel Canaltwo-way ship traffic

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

Scheduling of waterways with tide and passing box ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

Cites Work

• The lockmaster's problem
• A combinatorial Benders' decomposition for the lock scheduling problem
• Integrated maritime fleet deployment and speed optimization: case study from RoRo shipping
• Timetabling optimization of a mixed double- and single-tracked railway network
• Railway track allocation: Models and methods
• Sequence independent lifting in mixed integer programming
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Simulation of alternative approaches to relieving congestion at locks in a river transportion system
• On- and Offline Scheduling of Bidirectional Traffic
• Transit vessel scheduling
• Ship Traffic Optimization for the Kiel Canal