Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin

Mohd Nor, Wardah and Noordin, Noraini Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin. Journal of Computing Research and Innovation, 1 (1): 2. pp. 7-13. ISSN 2600-8793

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.

Metadata

Item Type: Article
Creators:
Creators
Email / ID Num.
Mohd Nor, Wardah
UNSPECIFIED
Noordin, Noraini
UNSPECIFIED
Subjects: H Social Sciences > HE Transportation and Communications > Transportation (General works). Communication and traffic
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms
Divisions: Universiti Teknologi MARA, Perlis > Arau Campus > Faculty of Computer and Mathematical Sciences
Journal or Publication Title: Journal of Computing Research and Innovation
UiTM Journal Collections: UiTM Journal > Journal of Computing Research and Innovation (JCRINN)
ISSN: 2600-8793
Volume: 1
Number: 1
Page Range: pp. 7-13
Keywords: shortest path problem, dijkstra algorithm, network model, time-dependent SPP, costdependent SPP
URI: https://ir.uitm.edu.my/id/eprint/53603
Edit Item
Edit Item

Download

[thumbnail of 53603.pdf] Text
53603.pdf

Download (346kB)

ID Number

53603

Indexing

|

Statistic

Statistic details