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. 

scholarly journals A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

2020 ◽  
Vol 16 (1) ◽  
pp. 65-70
Author(s):  
Siti Lestari Lestari ◽  
Ardiansyah Ardiansyah ◽  
Angelina Puput Giovani ◽  
Desy Dwijayanti
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Shortest Path ◽  
Rapid Development ◽  
Residential Area ◽  
Daily Activities ◽  
Dijkstra Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

scholarly journals Shortest Path Search Futsal Field Location With Dijkstra Algorithm

2018 ◽  
Vol 12 (2) ◽  
pp. 161 ◽  
Author(s):  
Delpiah Wahyuningsih ◽  
Erzal Syahreza
Keyword(s):  
Shortest Path ◽  
Destination Node ◽  
Dijkstra Algorithm ◽  
Initial Node ◽  
Shortest Route ◽  
Path Search ◽  
Surrounding Areas ◽  
The City ◽  
Shortest Path Search

Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.

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.

Improvement A* Algorithm Based on Dynamic Consistency Assumption

2011 ◽  
Vol 97-98 ◽  
pp. 883-887
Author(s):  
Liang Zou ◽  
Zi Zhang ◽  
Ling Xiang Zhu
Keyword(s):  
Lower Bound ◽  
Shortest Path ◽  
Dynamic Networks ◽  
Shortest Paths ◽  
Dynamic Consistency ◽  
Destination Node ◽  
Shortest Path Algorithm ◽  
A Algorithm ◽  
Dynamic Form

Efficient dynamic shortest path algorithm in static networks plays an important role in ITS. To solve this problem, this paper brings forward the dynamic form of Consistency Assumption and Dynamic A* algorithm (A* algorithm based on dynamic lower bound, DA* algorithm) based on dynamic lower bound. DA* algorithm and the dynamic form of Consistency Assumption are described in detail. It is proved that DA* algorithm can solve one origin node to one destination node shortest paths problem in dynamic networks, if DA* algorithm’s dynamic lower bound satisfies the dynamic form of Consistency Assumption.

scholarly journals Simulation study of power aware routing algorithms in multi-hop networks

2021 ◽  
Author(s):  
Kalaimagal Balasubramaniam
Keyword(s):  
Programming Language ◽  
Shortest Path ◽  
Simulation Study ◽  
Routing Algorithms ◽  
Destination Node ◽  
Shortest Path Algorithm ◽  
Java Programming Language ◽  
Java Programming

In a multi-hop network, the connection between an arbitrary source and destination node can be established using intermediate nodes. This project discusses the existing power aware routing algorithms, MHC, MTPR, and MBCR, which are used to minimize the delay, power and nodal over-utilization. The project also presents two newly proposed algorithms, MWBCR and MTP-WBCR which are simulated in a tool based on Dijkstra's shortest path algorithm, to evaluate the performance using Java programming language.

scholarly journals Data Security and Shortest Path Finding in IOT

2019 ◽  
pp. 551-557
Author(s):  
W. Winfredruby ◽  
S Sivagurunathan
Keyword(s):  
Shortest Path ◽  
Humidity Sensor ◽  
Shortest Paths ◽  
Data Access ◽  
Destination Node ◽  
Network Congestion ◽  
Shortest Path Algorithm ◽  
Sensor Applications ◽  
Encryption And Decryption ◽  
The Internet Of Things

Nowadays with the rapid growth of the smart city and the internet of things applications are difficult to connect the data access center, to meet service requirements with low latency and high quality while sending and receiving data access requests. At the same time, lower security performance occurred. In temperature and humidity sensor applications we approach a cryptography technique to protect data. It is an ASCII values-based technique which uses some numerical calculation to perform encryption and decryption. Then the use of the shortest path algorithm we find an entire possible path using current node detail and the destination node is sent by the source node to the neighbourhood nodes. Neighbourhood node receives the detail and checks the destination node. In case, the neighbourhood node is not the destination, it appends its detail along with the received details and sends to its neighbourhood nodes and the process continues till reaching the destination. By calculating the link delay between the two nodes. We can find the delay time taken from source to destination. At last we display the entire possible shortest paths and secure data. It is useful when network congestion occurs. In this paper, we also overcome this problem.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

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.

Sign in / Sign up

Export Citation Format

Share Document