A supply model for public transit services

A supply model for public transit services
复制标题

DOI:
10.1016/0191-2615(80)90039-9
复制
发表时间:
1980-03
影响因子:
6.8
通讯作者:
S. Scheele
S. Scheele
中科院分区:
工程技术1区
文献类型:
--
作者:
S. Scheele

文献摘要

被引文献

相似文献

假设给定一个公交网络,也就是说,我们给定一个街道网络,在这个网络上已经建立了某些公交线路。请给出公共汽车的总数。进一步假设公共汽车运输的总需求以起点-目的地矩阵的边际总和的形式给出,即给定从某些起点旅行的总需求以及到某些目的地旅行的总需求。问题:确定完整的出行模式,并决定在各条线路上使用哪些公交车频率。线性规划问题的形式是一个复合最小化问题。该模型的最大特点是明确考虑了公交线路的容量约束,并考虑了公交线路的频率对不同区域之间的出行分配的影响,并给出了求解该问题的迭代算法。该算法收敛于平稳点。该方案采用了交通规划中的组合分配-分配问题的分解算法,并在林雪平镇(80,000居民)的公交网络上进行了测试。该模型建议采取某些行动,这些行动与巴士运营商实际采取的行动一致。
Assume that a bus network is given, i.e. we are given a network of streets on which certain bus lines have been set up. Let the total number of buses be given. Assume furthermore that the total demand for bus transportation is given in the form of the marginal totals of an origin-destination matrix, i.e. the total demand for travelfromcertain origins as well as the total demand for traveltocertain destinations is given.Problem: Determine the complete travel pattern and decide which bus frequencies to use on the various lines.The problem is formulated as a non-linear programming problem in the form of a compound minimization problem. The most interesting features are that the model explicitly takes into account capacity constraints on the buses, and that the distribution of trips between different zone is influenced by the frequencies of the bus lines.An iterative algorithm to solve this problem is developed. The algorithm converges to stationary points. This scheme employs as a component an algorithm for the combined distribution- assignment problem in traffic planning which is developed by using decomposition.The model has been tested on the bus network in the town of Linköping (80,000 inhabitants). The model suggests certain actions which are in agreement with the actions actually taken by the bus operator.