A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem

Matthias Prandtstetter (Vortragende:r), Ulrike Maria Ritzinger, Peter Schmidt, Mario Ruthmair

Publikation: Beitrag in Buch oder TagungsbandVortrag mit Beitrag in TagungsbandBegutachtung

Abstract

We investigate a so far not examined problem called the In- terdependent Lock Scheduling Problem. A Variable Neighborhood Search approach is proposed for nding lock schedules along the Austrian part of the Danube River in order to minimize the overall ship travel times. In computational experiments the performance of our approach is assessed and compared to real-world ship trajectories. Notable improvements can be achieved. In addition, the number of (empty) lockages can be signi cantly reduced when taking them into account during optimization without loosing too much of quality in travel time optimization.
OriginalspracheEnglisch
TitelEvolutionary Computation in Combinatorial Optimization
Seiten36-47
Seitenumfang12
DOIs
PublikationsstatusVeröffentlicht - 2015
VeranstaltungEvolutionary Computation in Combinatorial Optimization, EvoCOP 2015 -
Dauer: 8 Apr. 201510 Apr. 2015

Konferenz

KonferenzEvolutionary Computation in Combinatorial Optimization, EvoCOP 2015
Zeitraum8/04/1510/04/15

Research Field

  • Ehemaliges Research Field - Mobility Systems

Fingerprint

Untersuchen Sie die Forschungsthemen von „A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem“. Zusammen bilden sie einen einzigartigen Fingerprint.

Diese Publikation zitieren