摘要
在详细分析工业厂区铁路网络特点的基础上,根据Gauss-Seidel迭代法思想,对Floyd算法进行了改进,解决了工业厂区铁路运输优化仿真分析中计算最短路径的核心问题。改进后算法的迭代次数由原来的n次下降到二次,有效降低了计算的复杂度。同时,将折返路径算法融入Floyd算法,很好地解决了铁路运输折返路径问题。
In this paper,an improved Floyd algorithm is proposed,based on GaussSeidel iteration thought and detailed analysis of the characteristics of industrial railway network.The improved Floyd algorithm successfully solved the key issue of the simulation optimization software,which is used to the industrial railway transportation.Using of Seidel iteration thought, the algorithms iteration number is decreased from n to two,which effectively reduced the computational complexity.At the same time,it is a very good solution to the problem of railway angular,because of the using of the railway angular algorithm.
出处
《土木建筑工程信息技术》
2013年第1期109-113,共5页
Journal of Information Technology in Civil Engineering and Architecture
基金
国家自然科学基金项目(51278400)
陕西省教育厅自然科学研究专项项目(11JK0944)
教育部虚拟现实开放实验室项目(MEOBNUEVRA200902)
关键词
FLOYD算法
算法改进
最短路径
工业厂区铁路运输
折返路径
Floyd’s Algorithm
Algorithm Improvement
Shortest Path
Industrial Railway Transportation
Return Path
