Finding Shortest Path Basing on Dijkstra's Algorithm For Baghdad Universities by using Geographic Information System Applications

2017 ◽  
Author(s):  
Roaa Ebada Saeed ◽  
Amer Saleem Elameer ◽  
Rafah Shahab Alhamdani
Keyword(s):  
Information System ◽  
Geographic Information System ◽  
Shortest Path ◽  
Geographic Information ◽  
Dijkstra’S Algorithm ◽  
Dijkstra's Algorithm

scholarly journals PERANCANGAN GEOGRAPHIC INFORMATION SYSTEM UNTUK TRACKING DAN ROUTING MENGGUNAKAN ALGORITMA DIJKSTRA PADA KENDARAAN ANGKUTAN UMUM

Foristek ◽  
2019 ◽  
Vol 9 (2) ◽  
Author(s):  
Muh. Aristo Indrajaya
Keyword(s):  
Information System ◽  
Geographic Information System ◽  
Public Transportation ◽  
Search Algorithm ◽  
Geographic Information ◽  
Transportation Systems ◽  
Traffic Density ◽  
Dijkstra’S Algorithm ◽  
Transport Services ◽  
Dijkstra's Algorithm

The ability to do tracking and routing of a motorized vehicle is very useful in everyday life, such as security on private vehicles, public transportation systems, mass transportation fleet management and others. In this study, we designed a Geographic Information System (GIS) application that will be applied to public transport services. This system will in real time track the position of each vehicle (taxi) and be able to perform automatic service for every taxi request by the customer. Dijkstra's algorithm is a graph search algorithm that solves the shortest path problem that originates from one node for a graph where the weight of the node must not be negative. The analysis is done by examining the node with the smallest weight and inserting it into the set of solutions with the initial search for the origin node requiring knowledge of all paths and weights. Dijkstra's algorithm which is applied to this system will function to find the most suitable taxi for customers by using distance parameters and traffic density levels as the weight value.

scholarly journals Journey to Crime Using Dijkstra’s Algorithm

2017 ◽  
Vol 1 (1) ◽  
pp. 1-14
Author(s):  
J. O. Olusina ◽  
J. B. Olaleye
Keyword(s):  
Information Systems ◽  
Geographic Information Systems ◽  
Shortest Path ◽  
Geographic Information ◽  
Service Area ◽  
Dijkstra’S Algorithm ◽  
Crime Mapping ◽  
Cost Matrix ◽  
Dijkstra's Algorithm ◽  
Journey To Crime

This paper describes some benefits of crime mapping in a Geographic Information Systems (G.I.S.) environment. The underlining principle of Journey to Crime was discussed. Crime Spots and Police Stations in the study area were mapped, Shortest-Path, Closest Facility, Service Area and OD (Origin – Destination) Cost Matrix were determined based on Dijkstra's Algorithm. Results show that the distribution of police stations does not correspond with the spread of crime spots.

scholarly journals Journey to Crime Using Dijkstra's Algorithm

2017 ◽  
Vol 1 (1) ◽  
pp. 1-14
Author(s):  
J. O. Olusina ◽  
J. B. Olaleye
Keyword(s):  
Information Systems ◽  
Geographic Information Systems ◽  
Shortest Path ◽  
Geographic Information ◽  
Service Area ◽  
Dijkstra’S Algorithm ◽  
Crime Mapping ◽  
Cost Matrix ◽  
Dijkstra's Algorithm ◽  
Journey To Crime

This paper describes some benefits of crime mapping in a Geographic Information Systems (G.I.S.) environment. The underlining principle of Journey to Crime was discussed. Crime Spots and Police Stations in the study area were mapped, Shortest-Path, Closest Facility, Service Area and OD (Origin – Destination) Cost Matrix were determined based on Dijkstra's Algorithm. Results show that the distribution of police stations does not correspond with the spread of crime spots.

scholarly journals Tourist Mobility at the Destination Toward Protected Areas: The Case-Study of Extremadura

2018 ◽  
Vol 10 (12) ◽  
pp. 4853 ◽  
Author(s):  
José Sánchez Martín ◽  
Juan Rengifo Gallego ◽  
Luz Martín Delgado
Keyword(s):  
Information System ◽  
Geographic Information System ◽  
Protected Areas ◽  
Shortest Path ◽  
Relevant Literature ◽  
Geographic Information ◽  
Tourist Attraction ◽  
Tourist Destination ◽  
Natural Protected Areas

The use of natural protected areas has been analyzed abundantly in the relevant literature, although on many occasions these areas are studied from the viewpoint of their role as a tourist destination in themselves, while neglecting their role as a tourist attraction that can be visited from the main destination of their stay. In certain specific areas, as in the case of Extremadura, protected areas are often a complementary destination for visitors who are staying in popular tourist hubs. This study is based on data from 4 different spaces (with different degrees in their status as protected areas) about the flow of tourists they generate at the destination. In light of the data, this paper identifies the 41 towns and villages with the most tourists, later to determine their mobility towards natural protected areas. Information was collected from almost 14,000 surveys that were filled at 52 tourist offices. This information allowed us to map the flow of tourists from their places of stay to the protected areas analyzed here, which resulted in the mapping of relevant networks by means of a Geographic Information System following the criterion of shortest path available. The results here clearly demonstrate that each area has a varying capacity to attract visitors, although in a large proportion of cases, the 60-min isochrone is a boundary beyond which the number of visitors drops significantly.

Sign in / Sign up

Export Citation Format

Share Document