Implementation of Dijkstra Algorithm in Vehicle Routing to Improve Traffic Issues in Urban Areas
Many studies have been conducted on Dijkstra Algorithm, and one of the implementations of those studies includes vehicle path selection or routing. A traditional Dijkstra Algorithm can compute simple path routing problems; however, it is not suitable for complex situations. This paper proposes an im...
Uložené v:
| Vydané v: | 2023 3rd International Conference on Smart Cities, Automation & Intelligent Computing Systems (ICON-SONICS) s. 73 - 78 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
06.12.2023
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Many studies have been conducted on Dijkstra Algorithm, and one of the implementations of those studies includes vehicle path selection or routing. A traditional Dijkstra Algorithm can compute simple path routing problems; however, it is not suitable for complex situations. This paper proposes an improved method of Dijkstra Algorithm that analyzes influencing factors, such as: traffic congestion, travel time reliability, weight of each equivalent path and then produces the best path according to each situation. This new method is a beneficial improvement in efficiency for shortest path search algorithms and reduces time complexity, and so, this paper applies the Dijkstra Algorithm to analyze travel routes between Bung Karno Stadium and Merlynn Park. A node diagram is created based on cost tables and transformed into cost metrics. The goal is to find the shortest route while considering traffic data and analyzing differences with road distances. The cost metrics are inserted into the Dijkstra Algorithm, resulting in minimum costs for each vertex from the source node. Two optimal travel paths are determined based on different datasets, highlighting the impact of traffic data. Further evaluations consider travel times and costs with and without traffic. Incorporating predicted traffic times into the algorithm improves travel cost predictions. This research concludes that the Dijkstra Algorithm is effective in solving the shortest route problem and can be applied to urban traffic networks with the inclusion of traffic predictions, addressing drawbacks and enhancing route planning effectiveness. |
|---|---|
| AbstractList | Many studies have been conducted on Dijkstra Algorithm, and one of the implementations of those studies includes vehicle path selection or routing. A traditional Dijkstra Algorithm can compute simple path routing problems; however, it is not suitable for complex situations. This paper proposes an improved method of Dijkstra Algorithm that analyzes influencing factors, such as: traffic congestion, travel time reliability, weight of each equivalent path and then produces the best path according to each situation. This new method is a beneficial improvement in efficiency for shortest path search algorithms and reduces time complexity, and so, this paper applies the Dijkstra Algorithm to analyze travel routes between Bung Karno Stadium and Merlynn Park. A node diagram is created based on cost tables and transformed into cost metrics. The goal is to find the shortest route while considering traffic data and analyzing differences with road distances. The cost metrics are inserted into the Dijkstra Algorithm, resulting in minimum costs for each vertex from the source node. Two optimal travel paths are determined based on different datasets, highlighting the impact of traffic data. Further evaluations consider travel times and costs with and without traffic. Incorporating predicted traffic times into the algorithm improves travel cost predictions. This research concludes that the Dijkstra Algorithm is effective in solving the shortest route problem and can be applied to urban traffic networks with the inclusion of traffic predictions, addressing drawbacks and enhancing route planning effectiveness. |
| Author | Tanasia, Steffi Maria Aurelia, Maria Utomo, Derrick Daniel Handoyo, Alif Tri Nurhasanah |
| Author_xml | – sequence: 1 givenname: Derrick Daniel surname: Utomo fullname: Utomo, Derrick Daniel email: derrick.utomo@binus.ac.id organization: Bina Nusantara University,School of Computer Science,Computer Science Department,Jakarta,Indonesia,11480 – sequence: 2 givenname: Maria surname: Aurelia fullname: Aurelia, Maria email: maria.aurelia001@binus.ac.id organization: Bina Nusantara University,School of Computer Science,Computer Science Department,Jakarta,Indonesia,11480 – sequence: 3 givenname: Steffi Maria surname: Tanasia fullname: Tanasia, Steffi Maria email: steffi.tanasia@binus.ac.id organization: Bina Nusantara University,School of Computer Science,Statistics Department,Jakarta,Indonesia,11480 – sequence: 4 surname: Nurhasanah fullname: Nurhasanah email: nurhasanah001@binus.ac.id organization: Bina Nusantara University,School of Computer Science,Statistics Department,Jakarta,Indonesia,11480 – sequence: 5 givenname: Alif Tri surname: Handoyo fullname: Handoyo, Alif Tri email: alif.handoyo@binus.ac.id organization: Bina Nusantara University,School of Computer Science,Computer Science Department,Jakarta,Indonesia,11480 |
| BookMark | eNo1j81OAjEURmuiC0XewEVX7gan7RTmLsn4wyQEEgG3eKfcQnWmJZ1i4turUVff5pyTfFfs3AdPjN2KfCREDnd1tVxkq-WirlYaSihHMpdqJPJCaSn1GRvCBEqlcyVKCeNL9lp3x5Y68gmTC54Hy-_d23ufIvJpuw_RpUPHnecvdHCmJf4cTsn5PU-Bf6sxfBBfR7TWGV73_Yn6H3gTG_R8Ggn7a3Zhse1p-LcDtnl8WFezbL58qqvpPHNCQMqkIQVmPC5NIRsszMQa1I0UCDuCQjektBGUA4nGWqmNxR2gAlECoBVGqQG7-e06Itoeo-swfm7_j6svURRWog |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICON-SONICS59898.2023.10435225 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798350318296 |
| EndPage | 78 |
| ExternalDocumentID | 10435225 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i119t-2ce39c668c42ba4c7fca5b21a9de945be35c1e09e1bff25cfad9a391899af1c33 |
| IEDL.DBID | RIE |
| IngestDate | Wed May 01 11:58:48 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i119t-2ce39c668c42ba4c7fca5b21a9de945be35c1e09e1bff25cfad9a391899af1c33 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_10435225 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Dec.-6 |
| PublicationDateYYYYMMDD | 2023-12-06 |
| PublicationDate_xml | – month: 12 year: 2023 text: 2023-Dec.-6 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | 2023 3rd International Conference on Smart Cities, Automation & Intelligent Computing Systems (ICON-SONICS) |
| PublicationTitleAbbrev | ICON-SONICS |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.8531821 |
| Snippet | Many studies have been conducted on Dijkstra Algorithm, and one of the implementations of those studies includes vehicle path selection or routing. A... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 73 |
| SubjectTerms | Costs dijkstra algorithm graph theory path planning Prediction algorithms Reliability Roads Routing Time complexity Traffic congestion vehicle routing problem |
| Title | Implementation of Dijkstra Algorithm in Vehicle Routing to Improve Traffic Issues in Urban Areas |
| URI | https://ieeexplore.ieee.org/document/10435225 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9uiHhSceI3OYi3zqbpV45jOhzIHOjGbjMfL67qWqmdf79J2ikePHgLaUIhr83Le3m_3w-hCwVCRVwTjzMqvFBI06JSeYFOuU_NE-mYmKZ3yWiUzmZs3IDVHRYGAFzxGXRt093lq0KubKrM_OGhPS9ELdRKkrgGa22hy4Y382rYt7vQ_WjYf4isLGLXSoN315N-yac47zHY-ed7d1HnB4eHx98eZg9tQL6Pnhyh77LBDOW40Pg6e3m1KQvce3suTLS_WOIsx1NY2I8C26IfMx1XBa5TCICNh7LUEbjW3rODJ6XgOe7ZEvUOmgxuHvu3XqOT4GWEsMoLJFAm4ziVYSB4KBMteSQCwpkCFkYCaCQJ-AyI0DqIpOaKccqICbWMlSSlB6idFzkcIiw5CxU1o1gAJnALmUxYnJgzgPJ1mhL_CHXs8szfayqM-Xpljv_oP0Hb1giu_iM-Re2qXMEZ2pSfVfZRnjsDfgGuvJ-e |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4UjXpSI8bf9mC8Dbe13dYjQYlEnCQC4Yb9KVPZDA7_ftsONB48eGu6Nkv6tr6-1_d9HwAXUnFJmA48RhH3MBemhYT0Qp0wH5knwjExDbtxmiajEe0twOoOC6OUcsVnqmGb7i5fFmJuU2XmD8f2vEBWwRrBOPQruNYGuFwwZ151WnYfekg7rUdihREbVhy8sZz2S0DF-Y_29j_fvAPqP0g82Pv2MbtgReV74MlR-k4XqKEcFhpeZy-vNmkBm2_PhYn3J1OY5XCoJvazgLbsx0yHZQGrJIKCxkdZ8ghYqe_ZwYMZZzls2iL1Ohi0b_qtW2-hlOBlQUBLLxQKURFFicAhZ1jEWjDCw4BRqSgmXCEiAuVTFXCtQyI0k5QhGphgy9hJILQPanmRqwMABaNYIjOKhsqEbpiKmEaxOQVIXydJ4B-Cul2e8XtFhjFerszRH_3nYPO2f98ddzvp3THYsgZx1SDRCaiVs7k6Bevis8w-ZmfOmF8qSKLl |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+3rd+International+Conference+on+Smart+Cities%2C+Automation+%26+Intelligent+Computing+Systems+%28ICON-SONICS%29&rft.atitle=Implementation+of+Dijkstra+Algorithm+in+Vehicle+Routing+to+Improve+Traffic+Issues+in+Urban+Areas&rft.au=Utomo%2C+Derrick+Daniel&rft.au=Aurelia%2C+Maria&rft.au=Tanasia%2C+Steffi+Maria&rft.au=Nurhasanah&rft.date=2023-12-06&rft.pub=IEEE&rft.spage=73&rft.epage=78&rft_id=info:doi/10.1109%2FICON-SONICS59898.2023.10435225&rft.externalDocID=10435225 |