{"id":"https://openalex.org/W4390280208","doi":"https://doi.org/10.1145/3626641.3626941","title":"Improving Route-Finding Performance of Dijkstra Algorithm and Maintaining Path Visual Cue Using Douglas-Peucker Algorithm","display_name":"Improving Route-Finding Performance of Dijkstra Algorithm and Maintaining Path Visual Cue Using Douglas-Peucker Algorithm","publication_year":2023,"publication_date":"2023-10-24","ids":{"openalex":"https://openalex.org/W4390280208","doi":"https://doi.org/10.1145/3626641.3626941"},"language":"en","primary_location":{"id":"doi:10.1145/3626641.3626941","doi":"https://doi.org/10.1145/3626641.3626941","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626641.3626941","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3626641.3626941","source":{"id":"https://openalex.org/S7407089227","display_name":"International Conference on Sustainable Information Engineering and Technology (SIET)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Sustainable Information Engineering and Technology","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3626641.3626941","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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":[{"id":"https://openalex.org/I177055848","display_name":"University of Brawijaya","ror":"https://ror.org/01wk3d929","country_code":"ID","type":"education","lineage":["https://openalex.org/I177055848"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Aryo Pinandito","raw_affiliation_strings":["Information System Department, Universitas Brawijaya, Indonesia"],"raw_orcid":"https://orcid.org/0000-0002-8509-2383","affiliations":[{"raw_affiliation_string":"Information System Department, Universitas Brawijaya, Indonesia","institution_ids":["https://openalex.org/I177055848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058890165","display_name":"Agi Putra Kharisma","orcid":"https://orcid.org/0000-0002-7836-8839","observed_orcids":["https://orcid.org/0000-0002-7836-8839"]},"institutions":[{"id":"https://openalex.org/I177055848","display_name":"University of Brawijaya","ror":"https://ror.org/01wk3d929","country_code":"ID","type":"education","lineage":["https://openalex.org/I177055848"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Agi Putra Kharisma","raw_affiliation_strings":["Informatics Engineering Department, Universitas Brawijaya, Indonesia"],"raw_orcid":"https://orcid.org/0000-0002-7836-8839","affiliations":[{"raw_affiliation_string":"Informatics Engineering Department, Universitas Brawijaya, Indonesia","institution_ids":["https://openalex.org/I177055848"]}]},{"author_position":"last","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":[{"id":"https://openalex.org/I177055848","display_name":"University of Brawijaya","ror":"https://ror.org/01wk3d929","country_code":"ID","type":"education","lineage":["https://openalex.org/I177055848"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Muhammad Aminul Akbar","raw_affiliation_strings":["Information System Department, Universitas Brawijaya, Indonesia"],"raw_orcid":"https://orcid.org/0000-0003-0794-7443","affiliations":[{"raw_affiliation_string":"Information System Department, Universitas Brawijaya, Indonesia","institution_ids":["https://openalex.org/I177055848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177055848"],"apc_list":null,"apc_paid":null,"fwci":5.4153,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.9645861,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"401","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.5220000147819519,"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.5220000147819519,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13830000162124634,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.09520000219345093,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9330000281333923},{"id":"https://openalex.org/keywords/douglas-peucker-algorithm","display_name":"Douglas-Peucker algorithm","score":0.9169999957084656},{"id":"https://openalex.org/keywords/line-simplification","display_name":"line simplification","score":0.7329999804496765},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8650000095367432},{"id":"https://openalex.org/keywords/memory-footprint-reduction","display_name":"memory footprint reduction","score":0.6079999804496765},{"id":"https://openalex.org/keywords/computational-time-reduction","display_name":"computation time reduction","score":0.7580000162124634},{"id":"https://openalex.org/keywords/path-visualization","display_name":"path visualization","score":0.5950000286102295},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.5950000286102295}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9083728790283203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7768038511276245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7381792664527893},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6400461196899414},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.5849682688713074},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5736744403839111},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.5224491953849792},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4613717794418335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4575658440589905},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4397872984409332},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4384118318557739},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4233602285385132},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15438112616539001},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13655629754066467},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1330607831478119},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.10957548022270203},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0926605761051178}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3626641.3626941","doi":"https://doi.org/10.1145/3626641.3626941","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626641.3626941","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3626641.3626941","source":{"id":"https://openalex.org/S7407089227","display_name":"International Conference on Sustainable Information Engineering and Technology (SIET)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Sustainable Information Engineering and Technology","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3626641.3626941","doi":"https://doi.org/10.1145/3626641.3626941","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626641.3626941","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3626641.3626941","source":{"id":"https://openalex.org/S7407089227","display_name":"International Conference on Sustainable Information Engineering and Technology (SIET)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Sustainable Information Engineering and Technology","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7250000238418579},{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.7207000255584717}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390280208.pdf","grobid_xml":"https://content.openalex.org/works/W4390280208.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1620332495","https://openalex.org/W1981934656","https://openalex.org/W2114765431","https://openalex.org/W2270257869","https://openalex.org/W2331652455","https://openalex.org/W2551221401","https://openalex.org/W2554635527","https://openalex.org/W2766237626","https://openalex.org/W2943331055","https://openalex.org/W2947543278","https://openalex.org/W2974085611","https://openalex.org/W3016735905","https://openalex.org/W3084957793","https://openalex.org/W3118136441","https://openalex.org/W3190695173","https://openalex.org/W3192037913","https://openalex.org/W3201239353","https://openalex.org/W3201547235","https://openalex.org/W3215024416","https://openalex.org/W4213077816","https://openalex.org/W4213414466","https://openalex.org/W4285183212","https://openalex.org/W4312897964","https://openalex.org/W4316170116","https://openalex.org/W4317532136","https://openalex.org/W4323339225","https://openalex.org/W4382603319","https://openalex.org/W4385811292","https://openalex.org/W6922120124"],"related_works":["https://openalex.org/W4390280032","https://openalex.org/W2009185655","https://openalex.org/W3118136441","https://openalex.org/W3212511742","https://openalex.org/W2385737134","https://openalex.org/W2369566867","https://openalex.org/W2078896366","https://openalex.org/W2384990470","https://openalex.org/W2766237626","https://openalex.org/W2348569123"],"abstract_inverted_index":{"Smartphones":[0],"and":[1,155,181,203,222,227],"their":[2,41,45,58],"mobile":[3,35],"applications":[4,36],"have":[5,34],"become":[6],"an":[7,89],"inseparable":[8],"part":[9],"of":[10,15,47,88,137,165,185,240],"modern":[11],"daily":[12],"life.":[13],"One":[14],"them":[16],"is":[17,85,111,143],"a":[18,38,72,105,114,140,166,233],"public":[19,27,30,67,106],"transportation":[20,31],"app":[21],"that":[22,91,187,194],"helps":[23],"people":[24],"commute":[25],"with":[26],"transportation.":[28],"Many":[29],"service":[32],"providers":[33],"as":[37,61,113],"companion":[39],"for":[40,66,127,247],"customers":[42],"to":[43,75,81,94,102,129,148,177,243],"improve":[44,149],"quality":[46],"service.":[48],"The":[49,191,230],"application":[50],"provides":[51],"useful":[52],"information":[53,80],"and/or":[54],"important":[55],"features":[56,70],"regarding":[57],"service,":[59],"such":[60],"timetables":[62],"or":[63,78],"route":[64,167],"finding":[65,252],"transit.":[68],"Such":[69],"run":[71],"slow":[73],"algorithm":[74,90,116,176,189,242,250],"provide":[76],"real-time":[77],"time-based":[79],"the":[82,96,131,135,150,157,162,179,183,210,218,237,245,248,253,258],"users.":[83],"Dijkstra":[84,110,128,188,249],"one":[86,100],"example":[87],"allows":[92],"users":[93],"find":[95,130],"shortest":[97],"path":[98,168,180],"from":[99],"location":[101],"another":[103],"in":[104,139,236,251],"transit":[107],"network.":[108],"However,":[109,215],"categorized":[112],"greedy":[115],"because":[117],"it":[118,216],"looks":[119],"at":[120],"all":[121],"possible":[122],"solutions.":[123],"It":[124],"takes":[125],"longer":[126],"optimum":[132],"solution":[133],"when":[134],"number":[136,184],"points":[138,186],"network":[141],"graph":[142],"high.":[144],"This":[145],"study":[146],"attempted":[147],"overall":[151,211,219,259],"route-finding":[152,212,260],"processing":[153,207,213,223],"time":[154,208,224],"reduce":[156,182,244],"memory":[158,201,220],"footprint":[159,202,221],"while":[160],"keeping":[161],"visual":[163],"cue":[164],"reasonably":[169],"consistent":[170],"by":[171,225],"utilizing":[172],"Douglas-Peucker":[173,195,241],"line":[174],"simplification":[175,196],"simplify":[178],"processes.":[190],"result":[192,231],"suggested":[193],"process":[197],"took":[198],"0.5%":[199],"additional":[200,206],"put":[204],"5.13%":[205],"into":[209],"time.":[214],"reduces":[217],"72.56%":[226],"80.83%,":[228],"respectively.":[229],"conveyed":[232],"significant":[234],"improvement":[235],"practical":[238],"implementation":[239],"input":[246],"optimal":[254],"route,":[255],"thereby":[256],"improving":[257],"performance.":[261]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2023-12-28T00:00:00"}