The planning of on-demand services requires the formation of vehicle schedules consisting of service trips and empty trips. This paper presents an algorithm for building vehicle schedules that uses time-dependent demand matrices (= service trips) as input and determines time-dependent empty trip matrices and the number of required vehicles as a result. The presented approach is intended for long-term, strategic transport planning. For this purpose, it provides planners with an estimate of vehicle fleet size and distance travelled by on-demand services. The algorithm can be applied to integer and non-integer demand matrices and is therefore particularly suitable for macroscopic travel demand models. Two case studies illustrate potential applications of the algorithm and feature that on-demand services can be considered in macroscopic travel demand models.

按需服务的规划需要形成由服务行程和空行程组成的车辆时间表。本文提出了一种用于构建车辆调度的算法，该算法使用与时间相关的需求矩阵（= 服务行程）作为输入，并由此确定与时间相关的空行程矩阵和所需车辆的数量。所提出的方法旨在用于长期的战略运输规划。为此，它为规划人员提供了对车队规模和按需服务行驶距离的估计。该算法可应用于整数和非整数需求矩阵，因此特别适用于宏观出行需求模型。