Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
From MaRDI portal
Publication:1734831
Recommendations
Cites work
- A combinatorial Benders' decomposition for the lock scheduling problem
- An exact decomposition approach for the real-time train dispatching problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Integrated maritime fleet deployment and speed optimization: case study from RoRo shipping
- On- and offline scheduling of bidirectional traffic
- Railway track allocation: Models and methods
- Sequence independent lifting in mixed integer programming
- Ship traffic optimization for the Kiel Canal
- Simulation of alternative approaches to relieving congestion at locks in a river transportion system
- The lockmaster's problem
- Timetabling optimization of a mixed double- and single-tracked railway network
- Transit vessel scheduling
Cited in
(7)- Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
- Scheduling ships movements within a canal harbor
- An Optimal Scheduling System for the Welland Canal
- On- and offline scheduling of bidirectional traffic
- Transit vessel scheduling
- Ship traffic optimization for the Kiel Canal
- Scheduling of waterways with tide and passing box
This page was built for publication: Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734831)