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

Mohd Ghazali, Jamilah and Mohd Adnan, Raudah and Mohd Ismail, Nurul Izzati and Mohd Aripen, Nur Shahirah and Mohd. Shamsuri, Muhammad Izzwan Syahmi and Mustaffa, Nur Aqilah Zawani and Abdul Rahim, Nur Hanis (2020) An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC. In: Application in Science and Technology. Penerbit UTHM, pp. 9-17. ISBN 978-967-2389-55-2

[img] Text
Ch02.pdf
Restricted to Registered users only
Download (547kB) | Request a copy

Abstract

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.

Item Type: Book Section
Uncontrolled Keywords: Research; Technology--Research; Education, Higher--Research--Malaysia; Government publications--Malaysia
Subjects: T Technology > T Technology (General) > T175-178 Industrial research. Research and development
Divisions: Faculty of Applied Science and Technology > Department of Mathematics and Statistics
Depositing User: Mrs. Siti Noraida Miskan
Date Deposited: 02 Nov 2021 03:31
Last Modified: 02 Nov 2021 03:31
URI: http://eprints.uthm.edu.my/id/eprint/2220

Actions (login required)

View Item View Item