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

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

Descripción completa

Guardado en:

Detalles Bibliográficos
Formato:	article
Lenguaje:	EN
Publicado:	Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis 2020
Materias:	Probabilities. Mathematical statistics QA273-280 Technology T Technology (General) T1-995
Acceso en línea:	https://doaj.org/article/c721b7dcedce4cd78dff7d4c2ddfd853
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:c721b7dcedce4cd78dff7d4c2ddfd853
record_format	dspace
spelling	oai:doaj.org-article:c721b7dcedce4cd78dff7d4c2ddfd8532021-11-06T02:22:42ZShortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm2600-8793https://doaj.org/article/c721b7dcedce4cd78dff7d4c2ddfd8532020-11-01T00:00:00Zhttp://repeater.my/index.php/jcrinn/article/view/169https://doaj.org/toc/2600-8793 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). Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA PerlisarticleProbabilities. Mathematical statisticsQA273-280TechnologyTTechnology (General)T1-995ENJournal of Computing Research and Innovation, Vol 5, Iss 4 (2020)
institution	DOAJ
collection	DOAJ
language	EN
topic	Probabilities. Mathematical statistics QA273-280 Technology T Technology (General) T1-995
spellingShingle	Probabilities. Mathematical statistics QA273-280 Technology T Technology (General) T1-995 Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
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
title	Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
title_short	Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
title_full	Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
title_fullStr	Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
title_full_unstemmed	Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
title_sort	shortest path from bandar tun razak to berjaya times square using dijkstra algorithm
publisher	Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis
publishDate	2020
url	https://doaj.org/article/c721b7dcedce4cd78dff7d4c2ddfd853
_version_	1718444007417184256

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

Ejemplares similares