Parking System Application Using a Greedy Algorithm Approach
DOI:
https://doi.org/10.21512/emacsjournal.v7i1.12575Keywords:
Parking System, Greedy Algorithm, Database SQL, Vehicle, CongestionAbstract
Indonesia has recently witnessed a significant increase in the number of automobiles, reaching an estimated 17.2 million units by the end of 2022, according to the Central Statistics Agency (BPS). Extensive ownership and usage of vehicles in public parking areas, including campuses, have created a high demand for parking spaces. However, challenges still exist within the parking system, such as longer search times for available parking spaces and the lack of technological regulation, leading to uncertainty. Our research focuses on addressing these issues by employing a priority-based greedy algorithm for the nearest lift, prioritizing convenience and speed. We utilize an SQL database to store parking data, leveraging its comprehensive features for efficient processing. The result of this research is a website where customers can input their license plate numbers, processed by our algorithm to generate parking tickets, granting access to designated parking areas. The algorithm works by providing parking slot locations from even-numbered floors first; when all even-numbered floors are filled, it will then allocate parking slots on odd numbered floors. The implementation of the greedy algorithm and SQL database has proven to be efficient in the context of the nearest lift in the Binus parking lot, handling a manageable amount of data and prioritizing data processing speed over achieving the optimal solution in all scenarios
Plum Analytics
References
Abu-Alsaad, H., & Al-Taie, R. (2024). Smart parking system using IoT. Proceedings of the 2024 European Conference on Artificial Intelligence (ECAI). https://doi.org/10.1109/ECAI61503.2024.10607419.
Al Aqel, G., Li, X., & Gao, L. (2019). A modified iterated greedy algorithm for flexible job shop scheduling problem. Chinese Journal of Mechanical Engineering, 32(1). https://doi.org/10.1186/s10033-019-0337-7
Ata, K., Che Soh, A., Ishak, A., Jaafar, H., & Khairuddin, N. (2019). Smart indoor parking system based on Dijkstra's algorithm. International Journal of Electrical Engineering and Applied Sciences, 2(1)
Aung, S. L. (2019). Comparative study of dynamic programming and greedy method. International Journal of Computer Applications Technology and Research, 8(8), 327–330. https://doi.org/10.7753/ijcatr0808.1007
Elmasri, R., & Navathe, S. B. (2015). Database systems (7th ed.). Pearson.
Elsonbaty, A., & Shams, M. (2020). The smart parking management system. arXiv. https://doi.org/10.48550/arXiv.2009.13443
Elfaki, A. O., Messoudi, W., Bushnag, A., Abuzneid, S., & Alhmiedat, T. (2023). A smart real-time parking control and monitoring system. Sensors, 23(24), 9741. https://doi.org/10.3390/s23249741
Fahmi, H., Zarlis, M., Nababan, E. B., & Sihombing, P. (2020). Implementation of the greedy algorithm to determine the nearest route search in distributing food production. IOP Conference Series: Materials Science and Engineering, 769(1). https://doi.org/10.1088/1757-899X/769/1/012005
Gupta, R. K., & Rani, G. (2020). Machine learning and IoT-based real-time parking system: Challenges and implementation. 3rd International Conference on Innovative Computing and Communication (ICICC-2020). Retrieved from https://ssrn.com/abstract=3563377
Koumetio Tekouabou, S. C., Abdellaoui Alaoui, E. A., Cherif, W., & Silkan, H. (2022). Improving parking availability prediction in smart cities with IoT and ensemble-based model. Journal of King Saud University - Computer and Information Sciences, 34(3), 687–697. https://doi.org/10.1016/j.jksuci.2020.01.008
Sefriyadi, I., Andani, I. G. A., Raditya, A., Belgiawan, P. F., & Windasari, N. A. (2023). Private car ownership in Indonesia: Affecting factors and policy strategies. Transportation Research Interdisciplinary Perspectives, 19, 100796. https://doi.org/10.1016/j.trip.2023.100796
Susanto, A., & Meiryani. (2019). Database management system. International Journal of Scientific & Technology Research.
Tanaka, S., Ohno, S., & Nakamura, F. (2017). Analysis on drivers’ parking lot choice behaviors in expressway rest area. Transportation Research Procedia, 25, 1342–1351. https://doi.org/10.1016/j.trpro.2017.05.158
Wang, B., & Xie, K. (2019). Design of open parking lot based on grid-segmentation and greedy algorithm. World Scientific Research Journal, 5(9). https://doi.org/10.6911/WSRJ.201909_5(9).0030
Wayahdi, M., Ginting, S., & Syahputra, D. (2021). Greedy, A-Star, and Dijkstra’s algorithms in finding shortest path. International Journal of Advances in Data and Information Systems, 2(1), 45–52. https://doi.org/10.25008/ijadis.v2i1.1206
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Engineering, MAthematics and Computer Science Journal (EMACS)

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows: Creative Commons Attribution-Share Alike (CC BY-SA)