An improvement of the shortest path algorithm based on Dijkstra algorithm

2010 ◽  
Author(s):  
Ji-Xian Xiao ◽  
Fang-Ling Lu
Keyword(s):  
Shortest Path ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm

Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

Application of Shortest-Path Algorithm in Embedded GIS System

2013 ◽  
Vol 663 ◽  
pp. 626-631
Author(s):  
Hong Xia Sun ◽  
Zheng Zhang
Keyword(s):  
Network Analysis ◽  
Emergency Response ◽  
Shortest Path ◽  
Program Implementation ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Emergency Response System ◽  
Gps Navigation ◽  
Embedded Gis ◽  
Gis System

The shortest-path is an important issue in GIS network analysis, and its implementation in embedded systems has already been used widely in the mobile-device-based GPS navigation and city emergency response system fields. Based on our analysis and verification of the Dijkstra algorithm’s application to road network analysis, we presented in detail the design and program implementation of the Dijkstra algorithm and its flow chart. In this paper, the shortest-path example based on Dijkstra algorithm，which was developed in the MapXmobile5.0 and EVC4.0 environment, has been applied to embedded GIS system successfully. The comparison between the results from the program and manually obtained results has shown the Dijkstra algorithm’s feasibility and accuracy.

scholarly journals An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 421
Author(s):  
Mina Asaduzzaman ◽  
Tan Kim Geok ◽  
Ferdous Hossain ◽  
Shohel Sayeed ◽  
Azlan Abdaziz ◽  
...  
Keyword(s):  
Shortest Path ◽  
Real World ◽  
Indoor Environment ◽  
Minimum Weight ◽  
Single Source ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Real World Data ◽  
Minimal Weight ◽  
Multiple Item

The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially in supermarkets, warehouses, libraries, etc. However, when it is used for multiple item searches, its weight becomes higher as it searches only the shortest path between the single sources to each destination item separately. If the conventional Dijkstra algorithm is modified to multi-destination mode then the weight is decreased, but the output path is not considered as the real shortest path among multiple destinations items. Our proposed algorithm is more efficient for finding the shortest path among multiple destination items with minimum weight, compared to the single source single destination and modified multi-destinations of Dijkstra’s algorithm. In this research, our proposed method has been validated by real-world data as well as by simulated random solutions. Our advancement is more applicable in indoor environment applications based on multiple items or destinations searching.

scholarly journals Smart ambulance using IoT for blood transfer facilities

2021 ◽  
Vol 22 (1) ◽  
pp. 97
Author(s):  
Mohamed A. Torad ◽  
Yahia H. Hossamel-din
Keyword(s):  
Shortest Path ◽  
Blood Type ◽  
Android Application ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Blood Types ◽  
Injured Person

<span>In case of an accident occurrence, ambulance try to transport wounded and injured people to the nearest hospital, but if the injured persons need an urgent blood transfer, the emergency reception (ER) can check the availability of the needed blood type and quantity. If it is available, the emergency reception accepts the injured person, but if it is not available, the reception reroutes the ambulance to the nearest hospital which have the required blood type and quantity. So, a system created that save that wasted time to save injured people life as possible.  So, we create a system that save that wasted time to save injured people life as possible. So, the main contribution in this paper is selecting and determining the nearest hospital that own the proper blood types to save injurjed people lives using dijkstra algorithm. In this study, we use an android application at the ambulance which permit the paramedic to login and select the required blood type and quantity needed after determining the injured person’s blood type and the android application automatically determine the nearest hospital using the best shortest path algorithm (SPA) after checking the database and generate a pin code for the paramedic to deliver it with injured person to the ER and get the needed blood. This process will consequently decrease the used blood quantity from the database.</span>

Motorcycle-Security using Position Searching Algorithm Based on Hybrid Fuzzy-Dijkstra

2016 ◽  
Vol 3 (2) ◽  
pp. 468 ◽  
Author(s):  
Rofiq Mubarok ◽  
Dwi Verdy Firmansyah ◽  
Dheny Haryanto ◽  
Noor Pratama Apriyanto ◽  
Umniyatul Mahmudah ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Decision Making ◽  
Shortest Path ◽  
Search Algorithm ◽  
Safety System ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Position Information ◽  
Motorcycle Safety ◽  
Artificial Intelligence Algorithm

<strong>Motorcycle safety system has been provided by the manufacturer in the form of a handlebar lock and electrical key equipped with alarms. Keys provided by the manufacturers sometimes fail in securing a motorcycle. In addition the safety system does not provide position information of the stolen motorcycle to the owner. With these problems, the paper presents safety locked motorcycle equipped with artificial intelligence algorithms. Artificial intelligence algorithm is used to find and detect the location of the motorcycle using the shortest path algorithm. This paper applies search algorithm using Dijkstra algorithm where the algorithm is used to make the decision to get the location of the motorcycle. By using the algorithm, the location of the motorcycle can be detected but it is not able to find the shortest path needed. Therefore, this paper describes the modification of Dijkstra algorithm by adding a Fuzzy algorithm that is used for the weight values in decision making, so that it can pursue to find the shortest path.</strong>

An Efficient Constrained Shortest Path Algorithm for Traffic Navigation

2011 ◽  
Vol 356-360 ◽  
pp. 2880-2885
Author(s):  
Zong Hui Wang ◽  
Shu Su Shi ◽  
Li Cheng Yu ◽  
Wen Zhi Chen
Keyword(s):  
Shortest Path ◽  
Navigation System ◽  
Road Network ◽  
Prototype System ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
A Algorithm ◽  
The Road ◽  
Low Efficiency ◽  
Key Techniques

FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of the key techniques of a traffic navigation system. Since classical Dijkstra algorithm and heuristic A* algorithm cannot support some constrained conditions in practice, and existing algorithms supporting constraints require the road network to be modified ahead and have low efficiency. The paper studies the model of road network, and analyzes two types of constraints, one-way street and intersection turning prohibitions, then proposes the constrained A* algorithm and gives the Heuristic function. Finally, the paper tests and analyzes the algorithm, and evaluation performance of the prototype system which employs it. The result shows that the algorithm’s efficiency is fairly good.

scholarly journals Dijkstra Algorithm Application: Shortest Distance between Buildings

2018 ◽  
Vol 7 (4.10) ◽  
pp. 974 ◽  
Author(s):  
G. Deepa ◽  
Priyank Kumar ◽  
A. Manimaran ◽  
K. Rajakumar ◽  
V. Krishnamoorthy
Keyword(s):  
Shortest Path ◽  
Engineering Calculation ◽  
Destination Node ◽  
Efficiency Improvement ◽  
Storage Space ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Basic Concepts

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve. 

Sign in / Sign up

Export Citation Format

Share Document