{"id":"https://openalex.org/W7225200312","doi":"https://doi.org/10.25126/jtiik.2026135","title":"Perbandingan Algoritma Dijkstra dan A-Star untuk Pencarian Rute Transportasi Umum Pada Perangkat Bergerak","display_name":"Perbandingan Algoritma Dijkstra dan A-Star untuk Pencarian Rute Transportasi Umum Pada Perangkat Bergerak","publication_year":2026,"publication_date":"2026-11-02","ids":{"openalex":"https://openalex.org/W7225200312","doi":"https://doi.org/10.25126/jtiik.2026135"},"language":"id","primary_location":{"id":"doi:10.25126/jtiik.2026135","doi":"https://doi.org/10.25126/jtiik.2026135","is_oa":true,"landing_page_url":"https://doi.org/10.25126/jtiik.2026135","pdf_url":null,"source":{"id":"https://openalex.org/S4210196574","display_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","issn_l":"2355-7699","issn":["2355-7699","2528-6579"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310314997","host_organization_name":"Brawijaya University","host_organization_lineage":["https://openalex.org/P4310314997"],"host_organization_lineage_names":["Brawijaya University"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","raw_type":"journal-issue"},"volume":null,"type":"paratext","is_traditional":false,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.25126/jtiik.2026135","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049706750","display_name":"Tri Afirianto","orcid":"https://orcid.org/0000-0003-0462-2854","observed_orcids":["https://orcid.org/0000-0003-0462-2854"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tri Afirianto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023791335","display_name":"Issa Arwani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Issa Arwani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012762301","display_name":"Muhammad Aminul Akbar","orcid":"https://orcid.org/0000-0003-0794-7443","observed_orcids":["https://orcid.org/0000-0003-0794-7443"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Muhammad Aminul Akbar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062598109","display_name":"Aryo Pinandito","orcid":"https://orcid.org/0000-0002-8509-2383","observed_orcids":["https://orcid.org/0000-0002-8509-2383"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aryo Pinandito","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1000000,"currency":"IDR","value_usd":65},"apc_paid":{"value":1000000,"currency":"IDR","value_usd":65},"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8109999895095825,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8109999895095825,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.06260000169277191,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.057100001722574234,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9039999842643738},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.9900000095367432},{"id":"https://openalex.org/keywords/mobile-devices","display_name":"mobile devices","score":0.8450000286102295},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.847000002861023},{"id":"https://openalex.org/keywords/heuristic-function","display_name":"heuristic function","score":0.6809999942779541},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.8339999914169312},{"id":"https://openalex.org/keywords/malang","display_name":"Malang","score":0.5080000162124634},{"id":"https://openalex.org/keywords/memory-usage","display_name":"memory usage","score":0.43299999833106995},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.8709999918937683},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"traffic congestion","score":0.6679999828338623}],"concepts":[{"id":"https://openalex.org/C15708023","wikidata":"https://www.wikidata.org/wiki/Q80083","display_name":"Humanities","level":1,"score":0.6026999950408936},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.5109999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44279998540878296},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3571999967098236},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.23720000684261322},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.19089999794960022},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.16380000114440918},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.16169999539852142},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1574999988079071},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.15469999611377716}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.25126/jtiik.2026135","doi":"https://doi.org/10.25126/jtiik.2026135","is_oa":true,"landing_page_url":"https://doi.org/10.25126/jtiik.2026135","pdf_url":null,"source":{"id":"https://openalex.org/S4210196574","display_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","issn_l":"2355-7699","issn":["2355-7699","2528-6579"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310314997","host_organization_name":"Brawijaya University","host_organization_lineage":["https://openalex.org/P4310314997"],"host_organization_lineage_names":["Brawijaya University"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","raw_type":"journal-issue"},{"id":"pmh:oai:doaj.org/article:5a421ae773584f638a7d7df7e8a3a478","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/5a421ae773584f638a7d7df7e8a3a478","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jurnal Teknologi Informasi dan Ilmu Komputer, Vol 13, Iss 5 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.25126/jtiik.2026135","doi":"https://doi.org/10.25126/jtiik.2026135","is_oa":true,"landing_page_url":"https://doi.org/10.25126/jtiik.2026135","pdf_url":null,"source":{"id":"https://openalex.org/S4210196574","display_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","issn_l":"2355-7699","issn":["2355-7699","2528-6579"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310314997","host_organization_name":"Brawijaya University","host_organization_lineage":["https://openalex.org/P4310314997"],"host_organization_lineage_names":["Brawijaya University"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Teknologi Informasi dan Ilmu Komputer","raw_type":"journal-issue"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5142999887466431,"id":"https://metadata.un.org/sdg/11"},{"display_name":"Industry, innovation and infrastructure","score":0.428600013256073,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7215622142","https://openalex.org/W7162300146","https://openalex.org/W4409824518","https://openalex.org/W4406809321","https://openalex.org/W2941541555","https://openalex.org/W3111927472","https://openalex.org/W2923415694","https://openalex.org/W7004990375","https://openalex.org/W2803521947","https://openalex.org/W7221232567"],"abstract_inverted_index":{"Transportasi":[0],"merupakan":[1,21],"suatu":[2,80],"proses":[3,195],"perpindahan":[4],"barang":[5],"atau":[6],"manusia":[7],"dari":[8,53,88,110,154,180],"tempat":[9,12,51],"asal":[10],"ke":[11,50],"tujuan":[13,52,64],"dengan":[14,38,63,158],"menggunakan":[15,219],"alat":[16],"bantu.":[17],"Angkutan":[18],"kota":[19],"(angkot)":[20],"salah":[22],"satu":[23],"bentuk":[24],"transportasi":[25,232],"umum":[26,124,233],"yang":[27,65,67,70,77,82,99,107,123,132,211,213,234],"memiliki":[28],"berbagai":[29,89],"macam":[30],"rute,":[31],"sehingga":[32],"penumpang":[33,42,55,74],"dapat":[34],"memilih":[35,46],"rute":[36,106,147,231],"sesuai":[37],"keperluannya.":[39],"Ada":[40],"kalanya,":[41],"mengalami":[43],"kesulitan":[44],"ketika":[45],"angkot":[47,62,76,148,266,300,313,330,396],"untuk":[48,135,145,193],"menuju":[49],"posisi":[54],"berada":[56],"saat":[57],"itu.":[58],"Terkadang":[59],"terdapat":[60],"beberapa":[61,119],"berbeda-beda":[66],"melintasi":[68],"jalan":[69,98],"sama.":[71],"Untuk":[72],"membantu":[73],"memilihkan":[75],"tepat":[78],"menjadi":[79],"tantangan":[81],"kompleks.":[83],"Hal":[84],"ini":[85,199,224],"dikarenakan":[86,189],"pengaruh":[87],"faktor,":[90],"seperti":[91],"kemacetan,":[92],"biaya,":[93],"waktu":[94,172,184,215],"tempuh,":[95],"dan":[96,128,140,237],"kondisi":[97],"kurang":[100],"memadai.":[101],"Penelitian":[102,131],"terhadap":[103],"algoritma":[104,122,138,156],"pencarian":[105,230],"efisien,":[108],"baik":[109],"kecepatan":[111],"maupun":[112],"penggunaan":[113],"sumber":[114],"daya,":[115],"telah":[116],"dilakukan":[117,133],"selama":[118],"dekade.":[120],"Dua":[121],"diteliti":[125],"adalah":[126],"Dijkstra":[127,139,205,374,385,459],"A-Star":[129,141,168,175,186,376,387,418,435],"(A*).":[130,377],"bertujuan":[134],"(i)":[136,382],"mengimplementasikan":[137],"pada":[142,181,239],"perangkat":[143,240],"bergerak":[144],"menentukan":[146],"terpendek;":[149],"serta":[150],"(ii)":[151,399],"menganalisis":[152],"performa":[153],"komputasi":[155],"tersebut":[157],"studi":[159],"kasus":[160],"di":[161],"Kota":[162],"Malang.":[163],"Hasil":[164],"penelitian":[165],"menunjukkan":[166],"bahwa":[167],"lebih":[169,177,187,202,216,221,235],"efisien":[170,238],"dalam":[171,227],"eksekusi,":[173],"meskipun":[174],"membutuhkan":[176,200,214],"banyak":[178],"memori":[179,201,220],"Dijkstra.":[182,434],"Kecepatan":[183],"eksekusi":[185],"cepat":[188],"memanfaatkan":[190],"fungsi":[191],"heuristik":[192],"memandu":[194],"pencarian,":[196],"namun,":[197],"hasil":[198],"banyak.":[203],"Kebalikannya,":[204],"harus":[206],"mengevaluasi":[207],"setiap":[208],"bobot":[209],"node":[210],"ada":[212],"lama":[217],"namun":[218],"efisien.":[222],"Temuan":[223],"memberikan":[225],"kontribusi":[226],"pengembangan":[228],"aplikasi":[229],"responsif":[236],"bergerak.":[241],"Abstract":[242],"Transportation":[243],"is":[244,269,419],"the":[245,291,298,320,327,384,394,401,447,462,480],"process":[246],"of":[247,272,358,404,424,464,482],"moving":[248],"goods":[249],"or":[250],"people":[251],"from":[252,305],"an":[253],"origin":[254],"to":[255,282,301,336,381,392,433,445,479],"a":[256,284,332,408,442],"destination":[257,304],"using":[258,407],"supporting":[259],"tools.":[260],"City":[261],"transportation":[262,274,488],"(commonly":[263],"known":[264],"as":[265,341],"in":[267,325,356,411,422,453],"Indonesia)":[268],"one":[270],"form":[271],"public":[273,487],"that":[275,417],"operates":[276],"on":[277,287,319,352,389,491],"various":[278,337],"routes,":[279],"allowing":[280],"passengers":[281,292,324],"choose":[283],"route":[285],"based":[286],"their":[288,303,306],"needs.":[289],"However,":[290],"often":[293],"face":[294],"difficulties":[295],"when":[296],"selecting":[297],"appropriate":[299],"reach":[302],"current":[307],"location.":[308],"In":[309,457],"some":[310],"cases,":[311],"multiple":[312],"lines":[314],"with":[315],"different":[316],"destinations":[317],"operate":[318],"same":[321],"road.":[322],"Assisting":[323],"choosing":[326],"most":[328],"suitable":[329],"presents":[331],"complex":[333],"challenge":[334],"due":[335],"influencing":[338],"factors,":[339],"such":[340],"traffic":[342],"congestion,":[343],"cost,":[344],"travel":[345],"time,":[346,426],"and":[347,361,375,386,398,485],"poor":[348],"road":[349],"conditions.":[350],"Research":[351],"efficient":[353,421,486],"route-finding":[354,448,489],"algorithms,":[355],"terms":[357,423],"both":[359],"speed":[360],"resource":[362],"usage,":[363],"has":[364],"been":[365],"conducted":[366],"for":[367],"decades.":[368],"Two":[369],"commonly":[370],"studied":[371],"algorithms":[372,388,406],"are":[373],"This":[378],"study":[379,410],"aims":[380],"implement":[383],"mobile":[390,492],"devices":[391],"determine":[393],"shortest":[395],"routes;":[397],"analyze":[400],"computational":[402],"performance":[403],"these":[405],"case":[409],"Malang":[412],"City.":[413],"The":[414],"results":[415,452],"show":[416],"more":[420,430,469,474,483],"execution":[425,438],"although":[427],"it":[428],"requires":[429],"memory":[431,455,473],"compared":[432],"achieves":[436],"faster":[437],"time":[439,470],"by":[440],"utilizing":[441],"heuristic":[443],"function":[444],"guide":[446],"process;":[449],"however,":[450],"this":[451],"higher":[454],"consumption.":[456],"contrast,":[458],"must":[460],"evaluate":[461],"weight":[463],"every":[465],"node,":[466],"which":[467],"takes":[468],"but":[471],"uses":[472],"efficiently.":[475],"These":[476],"findings":[477],"contribute":[478],"development":[481],"responsive":[484],"applications":[490],"devices.":[493]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-04T00:00:00"}