首页 | 本学科首页   官方微博 | 高级检索  
     

厂区铁路运输优化仿真关键技术的实现
引用本文:王茹, 孙卫新, 唐三元. 厂区铁路运输优化仿真关键技术的实现[J]. 土木建筑工程信息技术,2013, 5(1): 109-113.
作者姓名:王茹  孙卫新  唐三元
作者单位:西安建筑科技大学土木工程学院,西安 710055
基金项目:国家自然科学基金项目(51278400);陕西省教育厅自然科学研究专项项目(11JK0944);教育部虚拟现实开放实验室项目(MEOBNUEVRA200902)
摘    要:在详细分析工业厂区铁路网络特点的基础上,根据Gauss-Seidel迭代法思想,对Floyd算法进行了改进,解决了工业厂区铁路运输优化仿真分析中计算最短路径的核心问题。改进后算法的迭代次数由原来的n次下降到二次,有效降低了计算的复杂度。同时,将折返路径算法融入Floyd算法,很好地解决了铁路运输折返路径问题。

关 键 词:Floyd算法   算法改进   最短路径   工业厂区铁路运输   折返路径

Realization of Key Technology for Industrial Railway Transportation Optimization Simulation
Wang Ru, Sun Weixin, Tang Sanyuan. Realization of Key Technology for Industrial Railway Transportation Optimization Simulation[J]. Journal of Information Technology in Civil Engineering and Architecture, 2013, 5(1): 109-113
Authors:Wang Ru   Sun Weixin   Tang Sanyuan
Affiliation:College of Civil Engineering, Xi'an University of Architecture and Technology, Xi'an 710055, China
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.
Keywords:Floyd's Algorithm   Algorithm Improvement   Shortest Path   Industrial Railway Transportation   Return Path
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号