• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ICCCI 2010;International conference on computer and computational intelligence >Application of Electronic map-based Modified Dijkstra's algorithm in Railway Planning
【24h】

Application of Electronic map-based Modified Dijkstra's algorithm in Railway Planning

机译：基于电子地图的改进Dijkstra算法在铁路规划中的应用

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

As an efficient, convenient and green transportation mode, urban rail transport is bound to become increasingly popular in China. However, heavy upfront investment and long construction period make railway capital-intensive. How to determine the best rail network has large theoretical and practical significance. This study illustrated the potential of Electronic map and Dijkstra's algorithm in addressing the site path planning issues with multiple objectives. In this paper, Electronic map (E-Map) was first used to solve the railway planning problem. C++ language was applied to achieve modified Dijkstra's algorithm based on E-Map. This method basically solves the line selection problem in railway planning.
机译：作为一种高效，便捷，绿色的交通方式，城市轨道交通必将在中国日益流行。但是，大量的前期投资和较长的建设期使铁路资本密集。如何确定最佳的铁路网具有重大的理论和实践意义。这项研究说明了电子地图和Dijkstra算法在解决具有多个目标的站点路径规划问题方面的潜力。本文首先使用电子地图（E-Map）来解决铁路规划问题。应用C ++语言实现了基于E-Map的改进的Dijkstra算法。该方法从根本上解决了铁路规划中的选线问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号