Application of Optimization Algorithms in Reliable Pathfinding Models for Smart Cities

Authors

Corressponding author's email:

2391301@student.hcmute.edu.vn

DOI:

https://doi.org/10.54644/jte.2025.1847

Keywords:

Optimization Algorithms, Pathfinding, Smart Cities, RAO-3, Q-Learning

Abstract

This article implements and compares two potential algorithms in urban traffic management: the RAO-3 optimization algorithm and the Q-Learning reinforcement learning algorithm. The research is conducted on the dynamic traffic density optimization system platform, which collects real-time traffic data from IoT devices and processes it through fog computing infrastructure. The implementation of RAO-3 and Q-Learning on this rich dataset can be considered a groundbreaking contribution, helping to identify a more optimal algorithm for traffic flow and routing based on current conditions. The core idea of the research is to manually create a set of sample data while also extracting data from the dynamic traffic density optimization system, then testing this dataset with the RAO-3 and Q-Learning algorithms. The results indicate that Q-Learning outperforms RAO-3 in terms of efficiency and accuracy. This serves as a foundation for future advancements in smart city technology, emphasizing the role of integrating advanced technology in promoting more sustainable, efficient, and safer urban environments.

Downloads: 0

Download data is not yet available.

Author Biographies

Lap Duy Le, Ho Chi Minh City University of Technology and Education, Vietnam

Lap Duy Le graduated from Ho Chi Minh City University of Technology and Education, Vietnam in 2018 with a major in Software Engineering. He is currently pursuing a master’s degree in computer engineering at the same university. His research interests include the application of IoT to everyday practical problems.

Email: 2391301@student.hcmute.edu.vn. ORCID:  https://orcid.org/0009-0001-9317-7758

Van Long Nguyen, Ho Chi Minh City University of Technology and Education, Vietnam

Van Long Nguyen graduated from Ho Chi Minh City University of Technology and Education, Vietnam in 2000 with a major in Electric Engineering. He is currently pursuing a Master's degree in Computer Engineering at the same university. His research interests incde the application of IoT to everyday practical problems.

Email: longnv@hcmute.edu.vn. ORCID:  https://orcid.org/0009-0009-2992-5748

Thanh Tuan Vu, FPT Software Company Limited, Vietnam

Thanh Tuan Vu is currently holding the position of Head of Recruitment at FPT Software Academy. He has 12 years of experience in the fields of Training and Recruitment.

Email: tuanvt5@fpt.com. ORCID:  https://orcid.org/0009-0004-5068-871X

References

P. C. Tho, T. T. P. Anh, N. T. Cuong, and P. N. Phuong, “Organization and control of urban areas of Vietnam oriented towards green and sustainable development,” UD-JST, vol. 11, no. 96.2, pp. 183–189, Nov. 2015.

T. Q. Chien and T. N. Tuan, “Algorithms of the problem of finding the shortest paths from a set of nodes to another set of nodes,” 2004.

D. N. Lau and N. T. Viet, “Parallelizing algorithm Dijkstra’s finding the shortest paths from a vertex to all vertices,” HUEUNI-JNS, vol. 74B, no. 5, pp. 81–92, 2012.

T. Q. Chien, “Revised Bellman-Ford algorithm finding shortest path on extended networks,” UD-JST, vol. 11, no. 96.1, pp. 84–87, Nov. 2015.

G. Giorgio and P. Stefano, “Shortest path algorithms,” Ann. Oper. Res., vol. 13, no. 1, pp. 1–79, 1988. DOI: https://doi.org/10.1007/BF02288320

E. L. Lawler, “Shortest path and network flow algorithms,” Ann. Discrete Math., pp. 251–263, 1979. DOI: https://doi.org/10.1016/S0167-5060(08)70830-6

D. Eppstein, “Finding the k shortest paths,” SIAM J. Comput., vol. 28, no. 2, pp. 652–673, 1998. DOI: https://doi.org/10.1137/S0097539795290477

M. El Khaili, “Path planning in a dynamic environment,” Int. J. Adv. Comput. Sci. Appl., vol. 5, no. 8, pp. 86–92, 2014. DOI: https://doi.org/10.14569/IJACSA.2014.050813

P. T. M. Phuong, P. T. Yen, and N. T. N. Trang, “Research on optimizing order-picking routes in warehouse operation,” JMST, vol. 80, no. 80, pp. 100–103, Dec. 2024.

W. Zhu, W. Cai, and H. Kong, “Optimal path planning based on ACO in intelligent transportation,” Int. J. Cogn. Comput. Eng., 2025. DOI: https://doi.org/10.1016/j.ijcce.2025.02.006

H. T. Thien, T. V. Le, and S. Bouzefrane, “iTEVAC: An enhanced trusted evacuation system leveraging fog computing and IoT,” J. Inf. Telecommun., vol. 8, no. 4, pp. 417–451, 2024. DOI: https://doi.org/10.1080/24751839.2024.2306787

Y. Li, D. Pan, C. Xing, J. Huang, and Q. Zhang, “Research on road test route design method of ADAS system based on fault database and Dijkstra-CWOA,” in Proc. 7th Int. Conf. Robot., Control Autom. Eng. (RCAE), 2024, pp. 281–287. DOI: https://doi.org/10.1109/RCAE62637.2024.10834256

R. V. Rao, “Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems,” Int. J. Ind. Eng. Comput., pp. 107–130, 2020. DOI: https://doi.org/10.5267/j.ijiec.2019.6.002

C. J. C. H. Watkins and P. Dayan, “Q-learning,” Mach. Learn., vol. 8, pp. 279–292, 1992. DOI: https://doi.org/10.1007/BF00992698

T. V. Le, D. L. Le, and H. T. Tran, “Dynamic traffic optimization system: Leveraging IoT and fog computing for enhanced urban mobility with the RAO algorithm,” in Proc. Int. Conf. Green Technol. Sustain. Dev., 2024, pp. 73–84. DOI: https://doi.org/10.1007/978-3-031-76197-3_7

Downloads

Published

28-08-2025

How to Cite

[1]
L. D. Le, V. L. Nguyen, and T. T. Vu, “Application of Optimization Algorithms in Reliable Pathfinding Models for Smart Cities”, JTE, vol. 20, no. 03, pp. 100–110, Aug. 2025.

Issue

Section

Research Article

Categories