Citation: Wang Ru, Sun Weixin, Tang Sanyuan. Realization of Key Technology for Industrial Railway Transportation Optimization Simulation. Journal of Information Technologyin Civil Engineering and Architecture, 2013, 5(1): 109-113.
2013, 5(1): 109-113.
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 |
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] |
Metrics
- PDF Downloads(21)
- Abstract views(1292)
- HTML views(1089)