摘要
以城市交通优化问题为例,研究了网络交通优化问题的数学模型。在已有Floyd算法的基础上提出了改进的Floyd算法,该算法能够有效地解决多权网络交通优化问题。以北京市公交为例,建立了多权交通网,讨论了从出发点A站到目的地B站的最优路线查询问题,运用Floyd算法建立该问题的数学模型。通过实例应用,进一步证明了该算法和模型的可行性和合理性。
Urban traffic optimization problem is put forward and the network traffic optimization mathematical model is studied.The paper proposes the improvement on Floyd algorithm.The algorithm can effectively solve the network traffic optimization problem.Finally,with Beijing traffic as an example,this paper sets up a multi-weight traffic network.The optimal route is discussed from the point station A to the destination station B.At the same time,it establishs the mathematical model of the problem through Floyd algorithm.Further,it proves the feasibility and rationality of the model and the algorithm by an application example.
出处
《武汉工业学院学报》
CAS
2011年第3期37-42,共6页
Journal of Wuhan Polytechnic University
基金
国家自然科学基金资助项目（60574041）
关键词
最优线路
赋权有向图
FLOYD算法
多权交通网
交通优化
best routes
empowering directed graph
Floyd algorithm
multi-weight traffic network
traffic optimization
