城市公交最优路径选择的数学模型及其算法

摘要

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.%通过对城市公交路径选择问题的分析，在常用的Dijkstra最短路径算法基础上进行改进，根据乘客的不同需求给出出行总距离最短、出行总费用最少、出行总时间最短的最优路径选择模型。综合考虑距离、时间、费用等多种因素给出的出行满意度最大的最优路径模型，同时以算例验证了模型和算法的合理性和实用性。