direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Logo der TU Berlin

Inhalt des Dokuments

Preprint 716-2001

Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)

The Periodic Assignment Problem (PAP) May Be Solved Greedily
primary: 90C27 Combinatorial optimization
secondary: 90B20 Traffic problems
90B80 Discrete location and assignment
Periodic assignments, periodic timetabling, vehicle scheduling in public transport
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.
Download as [PDF] [ps.gz]
Title: Source

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe