Skip to main navigation Skip to search Skip to main content

Mathematical programming models for scheduling locks in sequence

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

34 Downloads (Pure)

Abstract

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.

Original languageEnglish
Title of host publication14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014 : September 11, 2014, Wroclaw, Poland
EditorsS. Funke, M. Mihalak
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages92-106
Number of pages15
ISBN (Electronic)978-3-939897-75-0
DOIs
Publication statusPublished - 1 Sept 2014
Externally publishedYes
Event14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2014) - Wroclaw, Poland
Duration: 11 Sept 2014 → 11 Sept 2014
Conference number: 14

Publication series

NameOpenAccess Series in Informatics (OASIcs)
Volume42
ISSN (Print)2190-6807

Conference

Conference14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2014)
Abbreviated titleATMOS 2014
Country/TerritoryPoland
CityWroclaw
Period11/09/14 → 11/09/14

Keywords

  • Inland Waterways
  • Lock Scheduling
  • Mixed Integer Programming

Fingerprint

Dive into the research topics of 'Mathematical programming models for scheduling locks in sequence'. Together they form a unique fingerprint.

Cite this