Article Per Year (5 Year)
p-Index From 2021 - 2026
1.829
P-Index
This Author published in this journals
All Journal Jurnal Buana Informatika Jurnal Teknologi Informasi dan Ilmu Komputer CogITo Smart Journal JUTEI (Jurnal Terapan Teknologi Informasi) Jurnal Informatika ComTech: Computer, Mathematics and Engineering Applications Jurnal Linguistik Komputasional JOINCS (Journal of Informatics, Network, and Computer Science) JuTISI (Jurnal Teknik Informatika dan Sistem Informasi)
Aditya Wikan Mahastama
Universitas Kristen Duta Wacana
Computer Science & IT Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Engineering Mathematics

Published : 15 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : comtech computer mathematics and engineering applications

 1 
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm Tamatjita, Elizabeth Nurmiyati; Mahastama, Aditya Wikan
ComTech: Computer, Mathematics and Engineering Applications Vol 7, No 3 (2016): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v7i3.2534

Abstract

Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm Elizabeth Nurmiyati Tamatjita; Aditya Wikan Mahastama
ComTech: Computer, Mathematics and Engineering Applications Vol. 7 No. 3 (2016): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v7i3.2534

Abstract

Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.
Co-Authors Antonius Rachmat Chrismanto Arnan Dwika Diasmara Diasmara, Arnan Dwika Elizabeth Nurmiyati Tamatjita Fidelia Vera Sentosa Gloria Virginia Kristian Hartono, Renaldi Kristianto, Tiar Dwi Lucia Dwi Krisnawati Matahari Bhakti Nendya, Matahari Bhakti Pagalla, Majestic Tampak Pramudya, Natanael Tegar Priagung Satriyotomo Raden Gunawan Santosa Rouly Doharma Sihite Setiadi, Bantolo Sri Suwarno Yuan Lukito