We investigate the scheduling of series of consecutive locks. This setting occurs naturally along canals and waterways. We describe a problem that generalizes different models that have been studied in literature. Our contribution is to (i) provide two distinct mathematical programming formulations, and compare them empirically, (ii) show how these models allow for minimizing emission by having the speed of a ship as a decision variable, (iii) to compare, on realistic instances, the optimum solution found by solving the models with the outcome of a decentralized heuristic.
@InProceedings{passchyn_et_al:OASIcs.ATMOS.2014.92, author = {Passchyn, Ward and Briskorn, Dirk and Spieksma, Frits C.R.}, title = {{Mathematical programming models for scheduling locks in sequence}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {92--106}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.92}, URN = {urn:nbn:de:0030-drops-47553}, doi = {10.4230/OASIcs.ATMOS.2014.92}, annote = {Keywords: Mixed Integer Programming, Inland Waterways, Lock Scheduling} }
Feedback for Dagstuhl Publishing