Travelling Choices Made Easier using Dijkstra Algorithm

Authors

  • Wardah Mohd Noor Universiti Teknologi MARA, Perlis Branch, Arau Campus
  • Noraini Noordin Universiti Teknologi MARA, Perlis Branch, Arau Campus

Keywords:

shortest path problem, dijkstra algorithm, network model, time-dependent SPP, cost dependent, SPP

Abstract

Current inflating high cost of living may affect mobility of students to commute between their university and any other destination. In an attempt to help solve or minimise the problem, several proposed travel alternative modes from this research may help students to identify the shortest path and minimum cost path in a journey. In finding the minimum total travel cost and shortest total completion time for a journey between two destinations, the step-by-step Dijkstra algorithm was applied in the time-dependent shortest path problem (TDSPP) and cost-dependent shortest path problem (CDSPP) in this research. Interestingly, both problems treated separately mapped out two different paths with two different costs. The former mapped out a route from UiTM Perlis Branch to Arau by taxi, train from Arau to Alor Setar, and Malaysia Airlines flights from Alor Setar to Kuala Lumpur and on to Johor Bahru. The other route was best described by taxi from Arau to Alor Setar, Air Asia flight from Alor Setar to Kuala Lumpur and train from Kuala Lumpur to Johor Bahru.

Downloads

Download data is not yet available.

Downloads

Published

2016-12-28

How to Cite

Mohd Noor, W., & Noordin, N. (2016). Travelling Choices Made Easier using Dijkstra Algorithm. Journal of Computing Research and Innovation, 1(1), 7–13. Retrieved from //crinn.conferencehunter.com/index.php/jcrinn/article/view/4

Issue

Section

General Computing