首页> 外文会议>IEEE International Conference on Consumer Electronics- Taiwan >On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm
【24h】

On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm

机译:用Dijkstra算法研究煤炭运输网络中的最短路径问题

获取原文

摘要

In this paper, we consider the shortest problem in the coal transportation network of the thermal power plant. The assumed coal transportation network connects a dedicate ship uploaders for the power plant to each coal-fired generators. We analyze the features of existing coal transportation network and construct the minimum spanning tree. To meet the practical use, the operation modes of transportation paths along with their equipment are considered. Finally, we proposed the shortest path routing algorithm and conclude the results.
机译:在本文中,我们考虑了火力发电厂煤炭运输网络中最短的问题。假设的煤炭运输网络将发电厂的专用船舶上传器连接到每个燃煤发电机。我们分析了现有煤炭运输网络的特征,并构建了最小生成树。为了满足实际使用,考虑了运输路径及其设备的操作方式。最后,我们提出了最短路径路由算法并得出结论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号