Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14306
For citation please use:
Main Title: Performance of Algorithms for Periodic Timetable Optimization
Author(s): Liebchen, Christian
Proksch, Mark
Wagner, Frank H.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15533
http://dx.doi.org/10.14279/depositonce-14306
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: During the last 15 years, there have been proposed many solution methods for the important task of constructing periodic timetables for public transportation companies. We first point out the importance of an objective function, where we observe that in particular a linear objective function turns out to be a good compromise between essential practical requirements and computational tractability. Then, we enter into a detailed empirical analysis of various Mixed Integer Programming procedures - such using nodes variables and such using arcs variables - genetic algorithms, simulated annealing and constraint programming. To our knowledge, this is the first comparison of five conceptually different solution approaches.
Subject(s): periodic timetabling
mixed-integer programming
local search procedures
constraint programming
Issue Date: 2004
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90-08 Computational methods
90C11 Mixed integer programming
90C59 Approximation methods and heuristics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2004, 21
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-021-2004.pdf
Format: Adobe PDF | Size: 549.71 kB
DownloadShow Preview
Thumbnail
Report-021-2004.ps.gz
Format: Unknown | Size: 595.37 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.