Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]
The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area. The time wasted on the road causes a lot of problems to the use...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
UiTM Cawangan Perlis
2020
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/43371/1/43371.pdf https://ir.uitm.edu.my/id/eprint/43371/ https://crinn.conferencehunter.com/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833067241358229504 |
|---|---|
| author | Muhammat Pazil, Nur Syuhada Mahmud, Norwaziah Jamaluddin, Siti Hafawati Mustafa, Nur Farasyaqirra |
| author_facet | Muhammat Pazil, Nur Syuhada Mahmud, Norwaziah Jamaluddin, Siti Hafawati Mustafa, Nur Farasyaqirra |
| author_sort | Muhammat Pazil, Nur Syuhada |
| building | Tun Abdul Razak Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknologi Mara |
| content_source | UiTM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area. The time wasted on the road causes a lot of problems to the users. Furthermore, the costs between two destinations are rather expensive. Therefore, the inability of users to use the shortest path has attracted the researcher to propose several travel alternatives to overcome this problem. In addition, this study will help to improve the efficiency of the road and make people want to use it more often. The objectives of this study are to find the shortest path from Bandar Tun Razak to Berjaya Times Square and to cut down the cost between these two destinations. The time of the shortest path problem and the cost problem are drawn separately. Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. The total time taken is 23 minutes (RM8.00), whereas, the cost is based on the shortest path from Bandar Tun Razak to Taman Maluri to Seasons Tower and Berjaya Times Square. The minimum cost is RM4.00 (30 minutes). |
| format | Article |
| id | my.uitm.ir-43371 |
| institution | Universiti Teknologi Mara |
| language | en |
| publishDate | 2020 |
| publisher | UiTM Cawangan Perlis |
| record_format | eprints |
| spelling | my.uitm.ir-433712021-05-11T06:39:30Z https://ir.uitm.edu.my/id/eprint/43371/ Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] jcrinn Muhammat Pazil, Nur Syuhada Mahmud, Norwaziah Jamaluddin, Siti Hafawati Mustafa, Nur Farasyaqirra Algorithms Road and highway design The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area. The time wasted on the road causes a lot of problems to the users. Furthermore, the costs between two destinations are rather expensive. Therefore, the inability of users to use the shortest path has attracted the researcher to propose several travel alternatives to overcome this problem. In addition, this study will help to improve the efficiency of the road and make people want to use it more often. The objectives of this study are to find the shortest path from Bandar Tun Razak to Berjaya Times Square and to cut down the cost between these two destinations. The time of the shortest path problem and the cost problem are drawn separately. Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. The total time taken is 23 minutes (RM8.00), whereas, the cost is based on the shortest path from Bandar Tun Razak to Taman Maluri to Seasons Tower and Berjaya Times Square. The minimum cost is RM4.00 (30 minutes). UiTM Cawangan Perlis 2020 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/43371/1/43371.pdf Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]. (2020) Journal of Computing Research and Innovation (JCRINN) <https://ir.uitm.edu.my/view/publication/Journal_of_Computing_Research_and_Innovation_=28JCRINN=29/>, 5 (4). pp. 59-65. ISSN 2600-8793 https://crinn.conferencehunter.com/ |
| spellingShingle | Algorithms Road and highway design Muhammat Pazil, Nur Syuhada Mahmud, Norwaziah Jamaluddin, Siti Hafawati Mustafa, Nur Farasyaqirra Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title | Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title_full | Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title_fullStr | Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title_full_unstemmed | Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title_short | Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] |
| title_sort | shortest path from bandar tun razak to berjaya times square using dijkstra algorithm / nur syuhada muhammat pazil ... [et al.] |
| topic | Algorithms Road and highway design |
| url | https://ir.uitm.edu.my/id/eprint/43371/1/43371.pdf https://ir.uitm.edu.my/id/eprint/43371/ https://crinn.conferencehunter.com/ |
| url_provider | http://ir.uitm.edu.my/ |