期刊名称：Journal of Systemics, Cybernetics and Informatics
印刷版ISSN：1690-4532
电子版ISSN：1690-4524
出版年度：2018
卷号：16
期号：3
页码：5-8
出版社：International Institute of Informatics and Cybernetics
摘要：Vehicle scheduling problem addresses the task of assigning vehicles
to cover all trips in a timetable. Minimum number m of
vehicles is determined by the number of trips in the peak hours
of demand (highest density of trips). In this paper, we propose
an approach to detect the minimal set of trips (critical trips), such
that omitting them allows to use only m – k vehicles. Results
of the algorithm can be used also for increasing the efficiency of
the vehicle scheduling problem, which leads to additional cost
savings for the transport company. The algorithm was used for
public transport vehicle scheduling in several cities within the
Czech Republic and the solution stepped up the efficiency by up
to 2%.
