The Periodic Assignment Problem (PAP) May Be Solved Greedily
| dc.contributor.author | Liebchen, Christian | |
| dc.date.accessioned | 2021-12-17T10:17:12Z | |
| dc.date.available | 2021-12-17T10:17:12Z | |
| dc.date.issued | 2001 | |
| dc.description.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. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15947 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14720 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | periodic assignments | en |
| dc.subject.other | periodic timetabling | en |
| dc.subject.other | vehicle scheduling in public transport | en |
| dc.title | The Periodic Assignment Problem (PAP) May Be Solved Greedily | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2001, 716 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
| tub.subject.msc2000 | 90B20 Traffic problems | en |
| tub.subject.msc2000 | 90B80 Discrete location and assignment | en |