TY - JOUR
T1 - Optimizing fuel consumption on inland waterway networks: Local Search Heuristic for Lock Scheduling
AU - Golak, Julian Arthur Pawel
AU - Defryn, Christof
AU - Grigoriev, Alexander
N1 - The authors make use of real-life Automatic Identification System (AIS) data from the period 2 January 2019 – 31 March 2019, split in instances that cover a single day on the river around the connection point between the Rhine and the Amsterdam Rhine Canal. In total, there are 84 observation days/instances.
PY - 2022/6
Y1 - 2022/6
N2 - Fuel consumption and CO2 emission are among the main criteria to assess the environmental and economical impact of vessels on inland waterways. Both criteria, however, are directly affected by the vessels' sailing speed. In this paper, we present a mathematical programming formulation of the speed optimization problem, which aims at minimizing the aggregated fuel consumption on an inland waterway network. The network can consist of multiple river segments, connected by a set of locks, without restrictions on the configuration. To allow scalability towards realistic waterway networks, we also propose a local-search based heuristic to optimize the speed for individual vessels. We evaluate the effectiveness of the heuristic by comparing it to solving the exact mathematical programming formulation. For all computational experiments, we make use of real AIS data from a section of the Dutch river network. We observe that the heuristic is able to construct a high quality solution in realistic problem settings within reasonable amount of computation time.
AB - Fuel consumption and CO2 emission are among the main criteria to assess the environmental and economical impact of vessels on inland waterways. Both criteria, however, are directly affected by the vessels' sailing speed. In this paper, we present a mathematical programming formulation of the speed optimization problem, which aims at minimizing the aggregated fuel consumption on an inland waterway network. The network can consist of multiple river segments, connected by a set of locks, without restrictions on the configuration. To allow scalability towards realistic waterway networks, we also propose a local-search based heuristic to optimize the speed for individual vessels. We evaluate the effectiveness of the heuristic by comparing it to solving the exact mathematical programming formulation. For all computational experiments, we make use of real AIS data from a section of the Dutch river network. We observe that the heuristic is able to construct a high quality solution in realistic problem settings within reasonable amount of computation time.
KW - AIS Data
KW - Inland Waterway Operations
KW - Local Search Heuristic
KW - Mixed-Integer Programming
KW - SYSTEM
KW - Mixed-Integer programming
KW - MODELS
KW - CONTAINER
KW - Inland waterway operations
KW - Local search heuristic
U2 - 10.1016/j.omega.2021.102580
DO - 10.1016/j.omega.2021.102580
M3 - Article
SN - 0305-0483
VL - 109
JO - Omega-International Journal of Management Science
JF - Omega-International Journal of Management Science
M1 - 102580
ER -