Jurnal ULTIMA Computing
Vol 13 No 1 (2021): Ultima Computing : Jurnal Sistem Komputer

Application of Hybrid Algorithm in Determining the Shortest Route Between Campus Branches

Waeisul Bismi (Unknown)
Windu Gata (Unknown)
Anton . (Unknown)
Taufik Asra (Unknown)



Article Info

Publish Date
26 Jun 2021

Abstract

Traffic congestion in the capital city is a familiar sight for the citizens of the capital, because two-wheeled vehicle users dominate the streets of the capital city as much as 72.8 percent while four-wheeled vehicle users are 26.5 percent. And congestion has a negative impact on the activities of the various citizens of the capital city, both in terms of work and in education. Therefore, an effective solution for road users in the capital city in overcoming congestion is to find the shortest route to get to the destination quickly. The application of the Djikstra algorithm is a solution in this case by determining the shortest route from the origin to the destination in order to get to the destination faster. Therefore, the researcher conducted a case study on the way to the STMIK Nusa Mandiri Kramat 18 campus as the place of origin to the STMIK Nusa Mandiri Jatiwaringin campus as the goal by trying to apply the Djikstra algorithm as a method of finding the shortest route.

Copyrights © 2021






Journal Info

Abbrev

SK

Publisher

Subject

Computer Science & IT Control & Systems Engineering Engineering

Description

urnal ULTIMA Computing merupakan Jurnal Program Studi Sistem Komputer Universitas Multimedia Nusantara yang menyajikan artikel-artikel penelitian ilmiah dalam bidang Sistem Komputer serta isu-isu teoritis dan praktis yang terkini, mencakup komputasi, organisasi dan arsitektur komputer, programming, ...