Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):

M. Prandtstetter, U. Ritzinger, P. Schmidt, M. Ruthmair:
"A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem";
Vortrag: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, Copenhagen; 08.04.2015 - 10.04.2015; in: "Evolutionary Computation in Combinatorial Optimization", Springer Verlag (Hrg.); LNCS 9026 (2015), ISBN: 978-3-319-16467-0; S. 36 - 47.

Kurzfassung englisch:
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.

"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)

Erstellt aus der Publikationsdatenbank des AIT Austrian Institute of Technology.