2013•Shaanxi CoalRequires access

Design of optimal escape route based on GIS

XU Yong-gang

Abstract

The paper analyzed the shortcomings of solving actual shortest path problems using Dijkstra algorithm in GIS,proposed the improved Dijkstra algorithm that using path planning function of GIS and binary heap data structure to implement optimization algorithm of priority queue.The example showed that the improved Dijkstra algorithm is improved than the original algorithm in time efficiency.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dijkstra's algorithm, Pathfinding, Shortest path problem, Computer science, Priority queue, Heap (data structure), Yen's algorithm, Algorithm