2013, 5(1): 109-113.
厂区铁路运输优化仿真关键技术的实现
西安建筑科技大学土木工程学院，西安 710055 |
Realization of Key Technology for Industrial Railway Transportation Optimization Simulation
College of Civil Engineering, Xi'an University of Architecture and Technology, Xi'an 710055, China |
引用本文:
王茹, 孙卫新, 唐三元. 厂区铁路运输优化仿真关键技术的实现[J]. 土木建筑工程信息技术,
2013, 5(1): 109-113.
Citation:
Wang Ru, Sun Weixin, Tang Sanyuan. Realization of Key Technology for Industrial Railway Transportation Optimization Simulation[J]. Journal of Information Technologyin Civil Engineering and Architecture,
2013, 5(1): 109-113.
摘要:在详细分析工业厂区铁路网络特点的基础上，根据Gauss-Seidel迭代法思想，对Floyd算法进行了改进，解决了工业厂区铁路运输优化仿真分析中计算最短路径的核心问题。改进后算法的迭代次数由原来的n次下降到二次，有效降低了计算的复杂度。同时，将折返路径算法融入Floyd算法，很好地解决了铁路运输折返路径问题。
Abstract: In this paper, an improved Floyd algorithm is proposed, based on Gauss-Seidel 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 algorithm's 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.
| [1] |
张敬. 厂区铁路设计阶段即时仿真基础问题研究[D]. 西安: 西安建筑科技大学, 2011. |
| [2] |
肖乾才, 李明奇, 郭文强.多链路权值增大的动态最短路径算法[J].计算机科学, 2012(04):114-117.doi: 10.3969/j.issn.1002-137X.2012.04.025 |
| [3] |
杨蔓. 最短路径算法在煤矿安全分区分析中的应用研究[D]. 西安: 西安科技大学, 2009. |
| [4] |
邢星星, 赵国兴, 方浩.基于GPU的全源最短路径算法[J].计算机科学, 2012(03):299-303.doi: 10.3969/j.issn.1002-137X.2012.03.069 |
| [5] |
龚劬, 廖武忠, 余维.基于图论的快速FCM图像分割算法[J].计算机工程, 2012(08):192-194.doi: 10.3969/j.issn.1000-3428.2012.08.063 |
| [6] |
Asghar A, Amir S.Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem[J].Applied Mathematics Letters.2012(8):1-5. |
| [7] |
杨艳. 最优化技术与可视化方法在家政信息管理系统的应用研究[D]. 西安科技大学, 2005. |
| [8] |
Christina G, Alexander S.Micro crack detection with Dijkstra's shortest path algorithm[J].Machine Vision & Applications.2012(3):589-601. |
| [9] |
张玉林, 程理民, 吴江.运筹学模型与方法教程[M].北京:清华大学出版社, 2000. |
| [10] |
钱迪颂.运筹学[M].北京:清华大学出版社, 2005. |
| [11] |
计量
- PDF下载量(18)
- 文章访问量(1128)
- HTML全文浏览量(917)
