Dynamic Graph Generation and an Asynchronous Parallel Bundle Method Motivated by Train Timetabling

Dynamic Graph Generation and an Asynchronous Parallel Bundle Method Motivated by Train Timetabling

Lagrangian relaxation is a successful solution approach for many combinatorial optimisation problems, one of them being the train timetabling problem (TTP). We model this problem using time expanded networks for the single train schedules and coupling constraints to enforce restrictions like station...

Full description

Bibliographic Details
Main Author: Fischer, Frank
Other Authors: TU Chemnitz, Fakultät für Mathematik
Format: Doctoral Thesis
Language:English
Published: Universitätsbibliothek Chemnitz 2013
Subjects:
Bündelverfahren
Netzwerke
Kürzeste Wege Probleme
Graphengenerierung
Fahrplanung
Lagrange Relaxation
Convex optimization
bundle methods
networks
shortest path problems
graph generation
timetabling
Lagrangian relaxation
ddc:510
Optimierung
Konvexe Optimierung
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-118358
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-118358
http://www.qucosa.de/fileadmin/data/qucosa/documents/11835/Dissertation_Frank_Fischer.pdf
http://www.qucosa.de/fileadmin/data/qucosa/documents/11835/signatur.txt.asc

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-118358
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-118358
http://www.qucosa.de/fileadmin/data/qucosa/documents/11835/Dissertation_Frank_Fischer.pdf
http://www.qucosa.de/fileadmin/data/qucosa/documents/11835/signatur.txt.asc

Similar Items