文章基本信息

标题：A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable
本地全文：下载
作者：Ralf Bornd{\"o}rfer ; Marika Karbstein ; Christian Liebchen 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：65
页码：1-15
DOI：10.4230/OASIcs.ATMOS.2018.16
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We consider the following planning problem in public transportation: Given a periodic timetable, how many vehicles are required to operate it? In [Julius Paetzold et al., 2017], for this sequential approach, it is proposed to first expand the periodic timetable over time, and then answer the above question by solving a flow-based aperiodic optimization problem. In this contribution we propose to keep the compact periodic representation of the timetable and simply solve a particular perfect matching problem. For practical networks, it is very much likely that the matching problem decomposes into several connected components. Our key observation is that there is no need to change any turnaround decision for the vehicles of a line during the day, as long as the timetable stays exactly the same.
关键词：Vehicle Scheduling; Periodic Timetabling; Bipartite Matching