Public Transport Planning System By Dijkstra Algorithm: Case Study Bangkok Metropolitan Area

Tirastittam, Pimploi; Waiyawuththanapoom, Phutthiwat

doi:10.5281/zenodo.1336370

2014

DOI: 10.5281/zenodo.1336370

|View full text |Cite

Public Transport Planning System By Dijkstra Algorithm: Case Study Bangkok Metropolitan Area

Pimploi Tirastittam¹,

Phutthiwat Waiyawuththanapoom²

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

Pazil

Mahmud

Jamaluddin

2020

JCRINN

View full text Add to dashboard Cite

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).

show abstract

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

Pazil

Mahmud

Jamaluddin

2020

JCRINN

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Public Transport Planning System By Dijkstra Algorithm: Case Study Bangkok Metropolitan Area

Cited by 1 publication

References 0 publications

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

Contact Info

Product

Resources

About