| 城市公共交通线网优化的图论模型与算法 |
| |
| 引用本文： | 杨超 李彬. 城市公共交通线网优化的图论模型与算法[J]. 同济大学学报(自然科学版), 1998, 26(3): 294-298 |
| |
| 作者姓名： | 杨超 李彬 |
| |
| 作者单位： | 同济大学道路与交通工程系!上海，200092，重庆市交通局!重庆，400042 |
| |
| 摘 要： | 用图论方法，以城市客流OD分布为基本依据，给出了城市公共交通线网优化的圈论模型，并对Kuhn－Munkres算法作了一些改进，使之适应双向约束条件，并提高了运算速度；文中还给出了改进算法正确性的数学证明．本模型可用于大、中城市公共交通线网的优化
|
| 关 键 词： | 公共交通线网 规划 优化 两分图 匹配 |
Graph Theory Model and Algorithm of Urban Public Transport Network's Optimization |
| |
| Yang Chao. Graph Theory Model and Algorithm of Urban Public Transport Network's Optimization[J]. Journal of Tongji University(Natural Science), 1998, 26(3): 294-298 |
| |
| Authors: | Yang Chao |
| |
| Abstract: | Based on urban passenger OD distribution, the theory of graph is used to establish the model of urban Public transport network's optimizing, the Kuhn - Munkres algorighm is improved to fit the restrictive condition of double directions, and its speed is also raised. The improved algorithm's carrectness is proved by mathemaical method. The model can be used to optimize and design public transport network for large and medium- sized cities. |
| |
| Keywords: | Public transport network Planning Optimizing Two-parted garph Match |
| 本文献已被 CNKI 维普 等数据库收录！ |
