Cover Image

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!
id my.uthm.eprints.2220
record_format eprints
spelling my.uthm.eprints.22202021-11-02T03:31:14Z http://eprints.uthm.edu.my/2220/ An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC 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 T175-178 Industrial research. Research and development 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. Penerbit UTHM Mohd Noor, Siti Fatimah Makminin, Suhaimi 2020 Book Section PeerReviewed text en http://eprints.uthm.edu.my/2220/1/Ch02.pdf 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
institution Universiti Tun Hussein Onn Malaysia
building UTHM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Tun Hussein Onn Malaysia
content_source UTHM Institutional Repository
url_provider http://eprints.uthm.edu.my/
language English
topic T175-178 Industrial research. Research and development
spellingShingle T175-178 Industrial research. Research and development
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
An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
description 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.
author2 Mohd Noor, Siti Fatimah
author_facet Mohd Noor, Siti Fatimah
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
format Book Section
author 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
author_sort Mohd Ghazali, Jamilah
title An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
title_short An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
title_full An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
title_fullStr An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
title_full_unstemmed An application of Dijkstra’s algorithm model in finding shortest travel time in KLCC
title_sort application of dijkstra’s algorithm model in finding shortest travel time in klcc
publisher Penerbit UTHM
publishDate 2020
url http://eprints.uthm.edu.my/2220/1/Ch02.pdf
http://eprints.uthm.edu.my/2220/
_version_ 1738580961896955904
score 13.160551

Similar Items