• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Information and Computer Technologies >A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path
【24h】

A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path

机译：修改的Dijkstra算法，用于解决最大负载路径的问题

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

摘要

Path optimization is especially useful for improving freight efficiency, and the problem of finding the maximum load path is an important issue in path optimization. Although the problem of finding the shortest path is similar to the problem of finding the maximum load path, the Dijkstra's algorithm for solving the problem of finding the shortest path is not suitable for solving the problem of finding the maximum load path. In this paper, the Dijkstra's algorithm for solving the problem of finding the shortest path is introduced, and the Dijkstra's algorithm is modified to solve the problem of finding the maximum load path. Finally, the running process of the modified Dijkstra's algorithm is described by an example.
机译：路径优化对于提高运费尤其有用，并且找到最大负载路径的问题是路径优化中的一个重要问题。尽管查找最短路径的问题类似于找到最大负载路径的问题，但是解决最短路径的问题的Dijkstra的算法不适合解决找到最大负载路径的问题。在本文中，介绍了求解查找最短路径的问题的Dijkstra算法，并修改了Dijkstra算法以解决找到最大负载路径的问题。最后，通过示例描述了修改的Dijkstra算法的运行过程。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号