Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study

2020 ◽

Vol 9 (2) ◽

Author(s):

K. A. F. A. Samah ◽

A. A. Sharip ◽

I. Musirin ◽

N. Sabri ◽

M. H. Salleh

Keyword(s):

Indoor Environment ◽

Indoor Navigation ◽

Dijkstra’S Algorithm ◽

Reliability Study ◽

Dijkstra's Algorithm ◽

Current Location ◽

Shortest Distance ◽

Level 2 ◽

Test Result

This paper describes a reliability study on the adaptation of Dijkstra’s Algorithm (DA) in the indoor environment for navigation purposes. Gateway KLIA2 located at Sepang, Selangor, Malaysia has been chosen as the area for case study. Gateway KLIA2 is divided into 4 levels but this research focused on Level 2 only that consists of 129 shop lots. A survey conducted towards 68 public respondents before the adaptation and most of them responded that they are not aware of the surrounding of KLIA2 and are facing difficulties in finding the information or location of certain places inside the building. DA was chosen because it helps the users to navigate using the shortest path to destination. It is proven that through the adaptation of DA, we are able to provide the shortest distance for indoor navigation from current location to the destination location. G-INS is reliable based on the functionality and reliability testing conducted towards 15 users with the distance reduction of 47% t-test result of 0.01303 (p0.05), indicates the system is accepted

Download Full-text

Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport

Algorithm Engineering - Lecture Notes in Computer Science ◽

10.1007/3-540-48318-7_11 ◽

1999 ◽

pp. 110-123 ◽

Cited By ~ 21

Author(s):

Frank Schulz ◽

Dorothea Wagner ◽

Karsten Weihe

Keyword(s):

Dijkstra’S Algorithm ◽

Railroad Transport ◽

Dijkstra's Algorithm ◽

On Line

Download Full-text

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

10.25212/icoit17.030 ◽

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

Download Full-text

Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

Public Transport ◽

10.1007/s12469-020-00253-x ◽

2020 ◽

Author(s):

Fredrik Ljunggren ◽

Kristian Persson ◽

Anders Peterson ◽

Christiane Schmidt

Keyword(s):

Experimental Evaluation ◽

Temporal Distance ◽

Dijkstra’S Algorithm ◽

Passenger Traffic ◽

Dijkstra's Algorithm ◽

Railway Timetabling

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Download Full-text