Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14720
For citation please use:
Main Title: The Periodic Assignment Problem (PAP) May Be Solved Greedily
Author(s): Liebchen, Christian
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15947
http://dx.doi.org/10.14279/depositonce-14720
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Many public transportation companies operate their networks periodically. One major step in their planning process is to construct a periodic timetable for one abstract period, independently from times during the day. In this paper we show that we may evaluate a periodic timetable very quickly with the number of vehicles required to operate it. This is due to the fact that the Periodic Assignment Problem (PAP) can be solved by a greedy approach. It helps us, at least within a genetic algorithm, to cope with the quadratic objective function in the problem of finding a periodic timetable requiring as few vehicles as possible.
Subject(s): periodic assignments
periodic timetabling
vehicle scheduling in public transport
Issue Date: 2001
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90B20 Traffic problems
90B80 Discrete location and assignment
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2001, 716
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-716-2001.pdf
Format: Adobe PDF | Size: 212.04 kB
DownloadShow Preview
Thumbnail
Report-716-2001.ps.gz
Format: Unknown | Size: 81.67 kB
Download

Item Export Bar

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