The Lockmaster's Problem
Inland waterways form a natural network infrastructure with capacity for more traffic. Transportation by ship is widely promoted as it is a reliable, efficient and environmental friendly way of transport. Nevertheless, locks managing the water level on waterways and within harbours sometimes constitute bottlenecks for transportation over water. The lockmaster's problem concerns the optimal strategy for operating such a lock. In the lockmaster's problem we are given a lock, a set of upstream-bound ships and another set of ships travelling in the opposite direction. We are given the arrival times of the ships and a constant lockage time; the goal is to minimize total waiting time of the ships. In this paper, a dynamic programming algorithm is proposed that solves the lockmaster's problem in polynomial time. This algorithm can also be used to solve a single batching machine scheduling problem more efficiently than the current algorithms from the literature do. We extend the algorithm so that it can be applied in realistic settings, taking into account capacity, ship-dependent handling times, weights and water usage. In addition, we compare the performance of this new exact algorithm with the performance of some (straightforward) heuristics in a computational study
Year of publication: |
2016
|
---|---|
Authors: | Passchyn, Ward |
Other Persons: | Coene, Sofie (contributor) ; Briskorn, Dirk (contributor) ; Hurink, Johann (contributor) ; Spieksma, Frits (contributor) ; Vanden Berghe, Greet (contributor) |
Publisher: |
[2016]: [S.l.] : SSRN |
Saved in:
freely available
Extent: | 1 Online-Ressource (39 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments December 2015 erstellt |
Other identifiers: | 10.2139/ssrn.2710579 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013002217
Saved in favorites
Similar items by person
-
Passchyn, Ward, (2016)
-
Passchyn, Ward, (2019)
-
Passchyn, Ward, (2016)
- More ...