LINDO Procedure for Dijkstra's Algorithm for Shortest Paths in Traffic Planning

机译：Dijkstra的Lindo程序，用于交通规划中最短路径的算法

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Dijkstra's algorithm is usually used to calculate the shortest path (the shortest travel time or the shortest distance or the minimum cost) in traffic planning. But the calculation of Dijkstra's algorithm is complex. The calculation is very complex when the road network is more than 30 nodes. The LINDO procedure for Dijkstra's algorithm is simple and practicable. The LINDO procedure is given in this paper. To evaluate the LINDO procedure of our proposed, we experiment a number of test problems. The computational results are compared with the results before optimization and show that the effectiveness and applicability of the proposed procedure.

机译：Dijkstra的算法通常用于计算交通规划中最短路径（最短的旅行时间或最短距离或最低成本）。但Dijkstra算法的计算很复杂。当道路网络超过30个节点时，计算非常复杂。 Dijkstra算法的LINDO程序简单且切实可行。本文给出了LINDO程序。为了评估我们提出的LINDO程序，我们试验了一些测试问题。将计算结果与优化前的结果进行比较，并表明所提出的程序的有效性和适用性。

著录项

来源
《International conference on information technology and industrial engineering》|2010年||共4页
会议地点
作者
Miao Xiaokun; Jin Hui;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类信息与知识传播;
关键词
traffic planning; shortest path; Dijkstra's algorithm; LINDO procedure;

机译：交通规划;最短路径;dijkstra的算法;lindo程序;

相似文献

外文文献
中文文献
专利

1. Designing and Implementing Shortest and Fastest Paths; A Comparison of Bellman-Ford algorithm, A*, and Dijkstra’s algorithms [J] . Al Bager A. Al Bager. R, Al Samani A. Ahmed International Journal of Computer Trends and Technology . 2021,第5期

机译：设计和实施最短和最快的路径; Bellman-Ford算法，A *和Dijkstra算法的比较
2. Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm [J] . Dilip Kumar Adhwarjee International journal of mathematics in operational research . 2018,第2期

机译：通过Adhwarjee算法找到最短路径，并将此强大方法与Dijkstra算法进行比较
3. Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms [J] . Arm Pradhan, Mahinthakumar Journal of Computing in Civil Engineering . 2013,第3期

机译：使用并行Floyd-Warshall和并行Dijkstra算法寻找大型运输网络的全对最短路径
4. LINDO Procedure for Dijkstra's Algorithm for Shortest Paths in Traffic Planning [C] . Miao Xiaokun, Jin Hui ITIE 2010;International conference on information technology and industrial engineering . 2010

机译：用于交通规划中最短路径的Dijkstra算法的LINDO过程
5. PLANNING SHORTEST PATHS (COMPUTATIONAL GEOMETRY, MOTION PLANNING, VISIBILITY GRAPHS, DIJKSTRA'S ALGORITHM, VORONOI DIAGRAMS). [D] . MITCHELL, JOSEPH S. B. 1986

机译：规划最短路径（计算几何，运动规划，可见性图，迪克斯特拉算法，沃罗尼图）。
6. Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model [O] . Haitao Wei, Shusheng Zhang, Xiaohui He 2021

机译：基于单向道路网络模型的动态禁区最短路径算法
7. DIJKSTRA-BASED ALGORITHMS FOR THE SHORTEST PATH PROBLEM WITH EDGES OF NEGATIVE LENGTH [O] . Akira Nakayama, Tsutomu Anazawa 2013

机译：基于Dijkstra的算法，用于负面长度边缘的最短路径问题

LINDO Procedure for Dijkstra's Algorithm for Shortest Paths in Traffic Planning

摘要

著录项

相似文献

相关主题

期刊订阅