| 城市公交最优路径选择的数学模型及其算法 |
| |
| 引用本文： | 王庆,潘荣英.城市公交最优路径选择的数学模型及其算法[J].苏州市职业大学学报,2014(4):58-61. |
| |
| 作者姓名： | 王庆 潘荣英 |
| |
| 作者单位： | 苏州市职业大学数理部,江苏苏州215104 |
| |
| 基金项目： | 苏州市职业大学研究性课题（SZDYKC-140901） |
| |
| 摘 要： | 通过对城市公交路径选择问题的分析,在常用的Dijkstra最短路径算法基础上进行改进,根据乘客的不同需求给出出行总距离最短、出行总费用最少、出行总时间最短的最优路径选择模型.综合考虑距离、时间、费用等多种因素给出的出行满意度最大的最优路径模型,同时以算例验证了模型和算法的合理性和实用性.
|
| 关 键 词： | 公交 Dijkstra算法 最优路径 |
On the Mathematical Models and Algorithms of Optimal Public Transport Lines |
| |
| WANG Qing,PAN Rong-ying.On the Mathematical Models and Algorithms of Optimal Public Transport Lines[J].Journal of Suzhou Vocational University,2014(4):58-61. |
| |
| Authors: | WANG Qing PAN Rong-ying |
| |
| Institution: | (Department of Mathematics and Physics, Suzhou Vocational University, Suzhou 215104, China) |
| |
| Abstract: | Through the analysis of city bus routes,this paper intends to improve the practice over the approach of Dijkstra by putting forward a mode in determining the shortest or optimal route in terms of distance,expenditure and time allowing for different requirements from the passengers. This mode and algorithm is proved to be rational and practical by numerical examples. |
| |
| Keywords: | public transport Dijkstra algorithms optimal route |
| 本文献已被 维普 等数据库收录！ |
