A Research on the Weighted Improvement of Dijkstra Algorithm in Optimal Path Calculation

DOI

10.2991/fmsmt-17.2017.33How to use a DOI?

Keywords

Safety Engineering; Dijkstra Algorithm; Improvement; Water Inrush Disaster; The Best Water Avoidance Path; Equivalent Path

Abstract

Dijkstra Algorithm is the shortest path algorithm from one vertex to others, which has solved many shortest path problems. However, in some engineering practice, the shortest path is not the best path, so that it needs to define a weight to illustrate the importance of the two nodes. Based on the best evacuation route when a mine is flooded, the traditional Dijkstra algorithm is improved in this paper. First, this paper interprets the Dijkstra Algorithm before improved, and uses it to calculate the mine shortest path to avoid water, then proposes a improvement method - introducing the concept of equivalent path and analyzing the influence factor and weight of equivalent path, then obtaining the conversion formula of the equivalent path and actual path. Instead of the actual path, the equivalent path can realize the adaptive improvement to the Dijkstra algorithm, so that it can realize the calculation on the best path to avoid water when the water inrush occurs.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Rongfu Wang
PY  - 2017/04
DA  - 2017/04
TI  - A Research on the Weighted Improvement of Dijkstra Algorithm in Optimal Path Calculation
BT  - Proceedings of the 2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology (FMSMT 2017)
PB  - Atlantis Press
SP  - 159
EP  - 163
SN  - 2352-5401
UR  - https://doi.org/10.2991/fmsmt-17.2017.33
DO  - 10.2991/fmsmt-17.2017.33
ID  - Wang2017/04
ER  -