An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC

An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC

Nowadays, traffic congestion or also known as traffic jammed is one of the common routing problems that usually occur on road networks. Routing problems becomes one of the big concern that most of the develop country must face including Malaysia.

Saved in:
Bibliographic Details
Main Authors: Mohd Ghazali, Jamilah, Mohd Adnan, Raudah, Mohd Ismail, Nurul Izzati, Mohd Aripen, Nur Shahirah, Mohd. Shamsuri, Muhammad Izzwan Syahmi, Mustaffa, Nur Aqilah Zawani, Abdul Rahim, Nur Hanis
Other Authors: Mohd Noor, Siti Fatimah
Format: Book Section
Language:English
Published: Penerbit UTHM 2020
Subjects:
T175-178 Industrial research. Research and development
Online Access:http://eprints.uthm.edu.my/2220/1/Ch02.pdf
http://eprints.uthm.edu.my/2220/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Tun Hussein Onn Malaysia
Language: English

Internet

http://eprints.uthm.edu.my/2220/1/Ch02.pdf
http://eprints.uthm.edu.my/2220/

Similar Items