Comparative research on all to all pairs path finding algorithms in a real-world scenario
This paper presents a comparative study of the implementation of all-to-all pairs shortest path algorithms, specifically Floyd-Warshall, Johnson’s, and Dijkstra’s. It contributes to a better understanding of their strengths and weaknesses in different types of applications (real-world scenarios). Th...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2023-01-01
|
| Series: | E3S Web of Conferences |
| Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/63/e3sconf_icobar23_01024.pdf |
| _version_ | 1797673602596732928 |
|---|---|
| author | Subrata Peter Nelson Tandra Philipus Adriel Owen Christopher Yuwono Arvin Astriani Maria Seraphina |
| author_facet | Subrata Peter Nelson Tandra Philipus Adriel Owen Christopher Yuwono Arvin Astriani Maria Seraphina |
| author_sort | Subrata Peter Nelson |
| collection | DOAJ |
| description | This paper presents a comparative study of the implementation of all-to-all pairs shortest path algorithms, specifically Floyd-Warshall, Johnson’s, and Dijkstra’s. It contributes to a better understanding of their strengths and weaknesses in different types of applications (real-world scenarios). The research demonstrates the use of these algorithms in finding the shortest path between multiple locations using a Google Maps plotter and the Google Maps API. Older research papers have shown a comparison that shows that the Floyd-Warshall algorithm is faster than the other two algorithms in certain scenarios; however, none have brought up the real-world application of such an algorithm. The null hypothesis of this study is that the Floyd-Warshall algorithm is not suitable for use in a real-life application for finding the shortest path compared to Johnson’s algorithm. The results of this study have potential applications in transportation and logistics and will provide useful insights for future work in this field. |
| first_indexed | 2024-03-11T21:47:47Z |
| format | Article |
| id | doaj.art-a11044b36f564c7794341f75405b0057 |
| institution | Directory Open Access Journal |
| issn | 2267-1242 |
| language | English |
| last_indexed | 2024-03-11T21:47:47Z |
| publishDate | 2023-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | E3S Web of Conferences |
| spelling | doaj.art-a11044b36f564c7794341f75405b00572023-09-26T10:11:34ZengEDP SciencesE3S Web of Conferences2267-12422023-01-014260102410.1051/e3sconf/202342601024e3sconf_icobar23_01024Comparative research on all to all pairs path finding algorithms in a real-world scenarioSubrata Peter Nelson0Tandra Philipus Adriel1Owen Christopher2Yuwono Arvin3Astriani Maria Seraphina4Computer Science Department, School of Computing and Media, 11480 Bina Nusantara UniversityComputer Science Department, School of Computing and Media, 11480 Bina Nusantara UniversityComputer Science Department, School of Computing and Media, 11480 Bina Nusantara UniversityComputer Science Department, School of Computing and Media, 11480 Bina Nusantara UniversityComputer Science Department, School of Computing and Media, 11480 Bina Nusantara UniversityThis paper presents a comparative study of the implementation of all-to-all pairs shortest path algorithms, specifically Floyd-Warshall, Johnson’s, and Dijkstra’s. It contributes to a better understanding of their strengths and weaknesses in different types of applications (real-world scenarios). The research demonstrates the use of these algorithms in finding the shortest path between multiple locations using a Google Maps plotter and the Google Maps API. Older research papers have shown a comparison that shows that the Floyd-Warshall algorithm is faster than the other two algorithms in certain scenarios; however, none have brought up the real-world application of such an algorithm. The null hypothesis of this study is that the Floyd-Warshall algorithm is not suitable for use in a real-life application for finding the shortest path compared to Johnson’s algorithm. The results of this study have potential applications in transportation and logistics and will provide useful insights for future work in this field.https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/63/e3sconf_icobar23_01024.pdf |
| spellingShingle | Subrata Peter Nelson Tandra Philipus Adriel Owen Christopher Yuwono Arvin Astriani Maria Seraphina Comparative research on all to all pairs path finding algorithms in a real-world scenario E3S Web of Conferences |
| title | Comparative research on all to all pairs path finding algorithms in a real-world scenario |
| title_full | Comparative research on all to all pairs path finding algorithms in a real-world scenario |
| title_fullStr | Comparative research on all to all pairs path finding algorithms in a real-world scenario |
| title_full_unstemmed | Comparative research on all to all pairs path finding algorithms in a real-world scenario |
| title_short | Comparative research on all to all pairs path finding algorithms in a real-world scenario |
| title_sort | comparative research on all to all pairs path finding algorithms in a real world scenario |
| url | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/63/e3sconf_icobar23_01024.pdf |
| work_keys_str_mv | AT subratapeternelson comparativeresearchonalltoallpairspathfindingalgorithmsinarealworldscenario AT tandraphilipusadriel comparativeresearchonalltoallpairspathfindingalgorithmsinarealworldscenario AT owenchristopher comparativeresearchonalltoallpairspathfindingalgorithmsinarealworldscenario AT yuwonoarvin comparativeresearchonalltoallpairspathfindingalgorithmsinarealworldscenario AT astrianimariaseraphina comparativeresearchonalltoallpairspathfindingalgorithmsinarealworldscenario |