Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14344
For citation please use:
Main Title: A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables
Author(s): Liebchen, Christian
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15571
http://dx.doi.org/10.14279/depositonce-14344
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider the problem of satisfying the maximum number of constraints of an instance of the Periodic Event Scheduling Problem (PESP). This is a key issue in periodic railway timetable construction, and has many other applications, e.g. for traffic light scheduling.
Subject(s): periodic railway timetable optimization
approximation
Issue Date: 2005
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 05C90 Applications
05C15 Coloring of graphs and hypergraphs
90B20 Traffic problems
90C27 Combinatorial optimization
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2005, 06
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-006-2005.pdf
Format: Adobe PDF | Size: 485.93 kB
DownloadShow Preview
Thumbnail
Report-006-2005.ps.gz
Format: Unknown | Size: 798.94 kB
Download

Item Export Bar

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