Implementasi Algoritma Dijkstra Untuk Analisis Rute Transportasi Umum Transjogja Berbasis Android

S. Sunardi, A. Yudhana, Ahmad Azhar Kadim
{"title":"Implementasi Algoritma Dijkstra Untuk Analisis Rute Transportasi Umum Transjogja Berbasis Android","authors":"S. Sunardi, A. Yudhana, Ahmad Azhar Kadim","doi":"10.21456/VOL9ISS1PP32-38","DOIUrl":null,"url":null,"abstract":"TransJogja is one of the public transportation media used by Yogyakarta residents. Currently TransJogja has served many passengers with various routes and has become a favorite transportation for locals and tourists visiting Yogyakarta. TransJogja continues to provide the best services for its users to attract potential passengers. Lack of information about bus routes and stops creates a negative impression for TransJogja users such as using the bus or going down to the bus which is not the destination of the user. This study aims to implement and analyze the TransJogja route using the Dijkstra Algorithm and utilize Android as its medium so that it can increase the interest of Transjogja users and facilitate service. Dijkstra Algebra is an algorithm to find the best route by comparing all the good weights in terms of distance, time and route to be passed. The weight used is the distance between stops. In this study obtained the best route results with a shorter execution time of <0.0076 seconds and the results of the route obtained can be displayed to an Android-based mobile device as expected. Using the developed application is expected to be a solution to be applied to TransJogja and other public transportation.","PeriodicalId":123899,"journal":{"name":"Jurnal Sistem Informasi Bisnis","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Sistem Informasi Bisnis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21456/VOL9ISS1PP32-38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

TransJogja is one of the public transportation media used by Yogyakarta residents. Currently TransJogja has served many passengers with various routes and has become a favorite transportation for locals and tourists visiting Yogyakarta. TransJogja continues to provide the best services for its users to attract potential passengers. Lack of information about bus routes and stops creates a negative impression for TransJogja users such as using the bus or going down to the bus which is not the destination of the user. This study aims to implement and analyze the TransJogja route using the Dijkstra Algorithm and utilize Android as its medium so that it can increase the interest of Transjogja users and facilitate service. Dijkstra Algebra is an algorithm to find the best route by comparing all the good weights in terms of distance, time and route to be passed. The weight used is the distance between stops. In this study obtained the best route results with a shorter execution time of <0.0076 seconds and the results of the route obtained can be displayed to an Android-based mobile device as expected. Using the developed application is expected to be a solution to be applied to TransJogja and other public transportation.
基于Android的Transjogja公共交通路线分析的Dijkstra算法的实现
TransJogja是日惹居民使用的公共交通媒体之一。目前,TransJogja已通过各种路线为许多乘客提供服务,并已成为当地人和前往日惹的游客最喜欢的交通工具。TransJogja继续为其用户提供最好的服务,以吸引潜在的乘客。缺乏公交路线和站点的信息会给TransJogja的用户留下负面印象,比如乘坐公交或下车,而不是用户的目的地。本研究旨在利用Dijkstra算法对TransJogja路线进行实现和分析,并以Android为媒介,提高TransJogja用户的兴趣,方便服务。Dijkstra代数是一种通过比较距离、时间和要通过的路线的所有好的权重来找到最佳路线的算法。使用的重量是站与站之间的距离。本研究以<0.0076秒的较短执行时间获得了最佳路由结果,并且所获得的路由结果可以按照预期在android移动设备上显示。使用开发的应用程序有望成为应用于TransJogja和其他公共交通的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信