Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation

This research deals with applying the Dijkstra algorithm and Welch-Powell algorithm to on-campus bus transportation problems. This research aims to determine the optimal solution of campus bus transportation routes in the shortest routes and schedules. In determining the fastest way, each intersecti...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Nurwan Nurwan, Widya Eka Pranata, Muhamad Rezky Friesta Payu, Nisky Imansyah Yahya
Formato:	article
Lenguaje:	EN
Publicado:	Department of Mathematics, UIN Sunan Ampel Surabaya 2021
Materias:	shortest route optimal schedule dijkstra algorithm welch-powell algorithm Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/c15d6c22468c4040b1b865511ab4d721
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:c15d6c22468c4040b1b865511ab4d721
record_format	dspace
spelling	oai:doaj.org-article:c15d6c22468c4040b1b865511ab4d7212021-12-02T18:47:43ZImplementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation2527-31592527-316710.15642/mantik.2021.7.1.31-40https://doaj.org/article/c15d6c22468c4040b1b865511ab4d7212021-05-01T00:00:00Zhttp://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/1054https://doaj.org/toc/2527-3159https://doaj.org/toc/2527-3167This research deals with applying the Dijkstra algorithm and Welch-Powell algorithm to on-campus bus transportation problems. This research aims to determine the optimal solution of campus bus transportation routes in the shortest routes and schedules. In determining the fastest way, each intersection represented as a node, and the path described as the sides. The shortest path obtained V1 - V2 - V5 - V8 - V9 - V10 - V13 - V16. In determining the optimal schedule, the number of buses represents the vertices, and the time expresses the side that connects each node. The optimal program of the bus starts from 06.30 am to 5.00 pm. Every bus gets four sessions of departure and four sessions return with travel time each session is 60 minutes.Nurwan NurwanWidya Eka PranataMuhamad Rezky Friesta PayuNisky Imansyah YahyaDepartment of Mathematics, UIN Sunan Ampel Surabayaarticleshortest routeoptimal scheduledijkstra algorithmwelch-powell algorithmMathematicsQA1-939ENMantik: Jurnal Matematika, Vol 7, Iss 1, Pp 31-40 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	shortest route optimal schedule dijkstra algorithm welch-powell algorithm Mathematics QA1-939
spellingShingle	shortest route optimal schedule dijkstra algorithm welch-powell algorithm Mathematics QA1-939 Nurwan Nurwan Widya Eka Pranata Muhamad Rezky Friesta Payu Nisky Imansyah Yahya Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
description	This research deals with applying the Dijkstra algorithm and Welch-Powell algorithm to on-campus bus transportation problems. This research aims to determine the optimal solution of campus bus transportation routes in the shortest routes and schedules. In determining the fastest way, each intersection represented as a node, and the path described as the sides. The shortest path obtained V1 - V2 - V5 - V8 - V9 - V10 - V13 - V16. In determining the optimal schedule, the number of buses represents the vertices, and the time expresses the side that connects each node. The optimal program of the bus starts from 06.30 am to 5.00 pm. Every bus gets four sessions of departure and four sessions return with travel time each session is 60 minutes.
format	article
author	Nurwan Nurwan Widya Eka Pranata Muhamad Rezky Friesta Payu Nisky Imansyah Yahya
author_facet	Nurwan Nurwan Widya Eka Pranata Muhamad Rezky Friesta Payu Nisky Imansyah Yahya
author_sort	Nurwan Nurwan
title	Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
title_short	Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
title_full	Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
title_fullStr	Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
title_full_unstemmed	Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation
title_sort	implementation of dijkstra algorithm and welch-powell algorithm for optimal solution of campus bus transportation
publisher	Department of Mathematics, UIN Sunan Ampel Surabaya
publishDate	2021
url	https://doaj.org/article/c15d6c22468c4040b1b865511ab4d721
work_keys_str_mv	AT nurwannurwan implementationofdijkstraalgorithmandwelchpowellalgorithmforoptimalsolutionofcampusbustransportation AT widyaekapranata implementationofdijkstraalgorithmandwelchpowellalgorithmforoptimalsolutionofcampusbustransportation AT muhamadrezkyfriestapayu implementationofdijkstraalgorithmandwelchpowellalgorithmforoptimalsolutionofcampusbustransportation AT niskyimansyahyahya implementationofdijkstraalgorithmandwelchpowellalgorithmforoptimalsolutionofcampusbustransportation
_version_	1718377647654830080

Implementation of Dijkstra Algorithm and Welch-Powell Algorithm for Optimal Solution of Campus Bus Transportation

Ejemplares similares