TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)2001

COGA 5-Wheel

Page Content

to Navigation

Preprints 2001

The Periodic Assignment Problem (PAP) May Be Solved Greedily
Citation key Report-716-2001
Author Christian Liebchen
Year 2001
Number 716
Institution Technische Universität Berlin, Institut für Mathematik
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.
Bibtex Type of Publication Preprint
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe