Determining The Shortest Path In Car Parking Layout In FMIPA UNPAD Using Floyd-Warshall Algorithm

https://doi.org/10.47194/ijgor.v3i3.166

Authors

  • Mochamad Suyudi Department of Mathematics, FMIPA, Universitas Padjadjaran Jl. Raya Bandung-Sumedang Km 21, Jatinangor 45363, Jawa Barat, Indonesia
  • Asma Ainun Mardiyah Department of Mathematics, FMIPA, Universitas Padjadjaran Jl. Raya Bandung-Sumedang Km 21, Jatinangor 45363, Jawa Barat, Indonesia

Keywords:

Graph, Parking lot, Floyd-Warshall Algorithm, shortest path

Abstract

Vehicles that are increasingly needed by the community increase the volume of vehicle traffic, resulting in a high demand for parking spaces. Especially in public places such as campuses, offices, shopping centers, and other places. A parking lot is also needed that has a maximum capacity by determining the layout of the vehicle mileage in finding a parking location. In this paper, we are looking for the shortest path in the car park layout at FMIPA UNPAD using the Floyd-Warshall algorithm.

References

Azis, H., Mallongi, R., Lantara, D., & Salim, Y. (2018). Comparison of Floyd-Warshall Algorithm and Greedy Algorithm in Determining the Shortest Route. 2018 2nd East Indonesia Conference on Computer and Information Technology (EIConCIT), 294–298.

Bhavya. (2022). All Pair Shortest Path Problem in Python. Retrieved June 15, 2022, from https://pythonwife.com/all-pair-shortest-path-problem-in-python/

Fatmala, F., Yudatama, U., & Burhanuddin, A. (2019). Panduan Jalur Angkutan Umum Menggunakan Algoritma Floyd Warshall. Jurnal Komtika (Komputasi Dan Informatika), 3, 1–9. https://doi.org/https://doi.org/10.31603/komtika.v3i1.3462

Fortuna, C., Sandra, K., Sipil, J. T., & Trisakti, U. (2020). Kebijakan Strategi Parkir (Studi Kasus : Ibu Kota Metropolitan Jakarta) Parking Strategy Policy (Case Study : Metropolitan Jakarta), (September), 103–108.

Jayanti, N. K. D. A. (2017). Penggunaan Algoritma Floyd Warshall Dalam Masalah Jalur Terpendek Pada Penentuan Tata Letak Parkir. In Seminar Nasional Informatika (SNIf), 1, 75–81.

Kumar, R.., & Kumar, M. (2010). Exploring Genetic Algorithm for Shortest Path Optimization in Data Networks, 10(11), 8–12.

Ramadhan, Z., Siahaan, A. P. U., & Mesran, M. (2018). Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem, 47–58.

Rosen, K. H. (2012). Discrete Mathematics and Its Discrete and Its Seventh Edition.

Vasudev, C. (2006). Graph theory with applications. New Age International.

Published

2022-08-08