journal article·2025-08-29Open access

Advances in Q-Learning: Real-Time Optimization of Multi-Distant Transportation Systems

Ahmad Barghash, Ahmad Abuznaid

Applied Sciences· Volume 15· Issue 17

Abstract

Vehicle routing improvement has become a vital topic in modern transport digitalization projects. Presently, there are no fully adapted techniques to offer optimal solutions for finding the best routes that include all visiting locations, considering mandatory transportation constraints. This project explores the application of modern machine learning techniques in solving transportation problems, with a specific focus on Q-learning. We utilize Q-learning to address the traveling salesman and vehicle routing problems. The ability of Q-learning to find optimal solutions in dynamic environments helped overcome the vulnerabilities of traditionally used algorithms. Moreover, this project provides an advanced comparative analysis in terms of accuracy and speed between Q-learning and currently used algorithms in the same scope, using a set of generated routing datasets. Q-learning presented superior performance, generating solutions that were closest to the global optima, exhibiting impressive computational efficiency and fast action even with large-scale problem instances, suggesting that it can serve as a powerful tool for optimizing transportation systems.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Transportation and Mobility Innovations · Smart Parking Systems Research · Optimization and Search Problems

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Department of Computer Science, German Jordanian University, Amman 11180, Jordan

Department of Computer Engineering, German Jordanian University, Amman 11180, Jordan

References (29)

Show source-provided references
1. Sutton, R., and Barto, A. (2025, May 28). Reinforcement Learning: An Introduction. Available online: https://www.cambridge.org/core/journals/robotica/article/robot-learning-edited-by-jonathan-h-connell-and-sridhar-mahadevan-kluwer-boston-19931997-xii240-pp-isbn-0792393651-hardback-21800-guilders-12000-8995/737FD21CA908246DF17779E9C20B6DF6.
2. New benchmark instances for the Capacitated Vehicle Routing Problem10.1016/j.ejor.2016.08.012 ↗
3. (2025, May 29). CVRPLIB—Plotted Instances. Available online: http://vrp.atd-lab.inf.puc-rio.br/index.php/en/plotted-instances?data=E-n22-k4.
4. Davendra, D. (2025, May 31). Traveling Salesman Problem: Theory; Applications. Available online: https://books.google.com/books?hl=en&lr=&id=gKWdDwAAQBAJ&oi=fnd&pg=PR11&dq=Traveling+Salesman+Problem:+Theory+and+Applications&ots=aacB087hD7&sig=y3elL3SUkXtjd_TbIwEdi0T0ix8.
5. Demez, H. (2013). Combinatorial Optimization: Solution Methods of Traveling Salesman Problem. [Master’s Thesis, Eastern Mediterranean University]. Available online: https://i-rep.emu.edu.tr/xmlui/handle/11129/654.
6. (2025, May 29). TSP—Data for the Traveling Salesperson Problem. Available online: https://people.sc.fsu.edu/~jburkardt/datasets/tsp/tsp.html.
7. TSPLIB—A Traveling Salesman Problem Library10.1287/ijoc.3.4.376 ↗
8. Lingling, W., and Qingbao, Z. (2008, January 18–20). An efficient approach for solving TSP: The rapidly convergent ant colony algorithm. Proceedings of the 4th International Conference on Natural Computation, ICNC 2008, Jinan, China.
9. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP10.1155/2016/8932896 ↗
10. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator10.1155/2017/7430125 ↗
11. Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages
12. Performance Comparison of Simulated Annealing, GA and ACO Applied to TSP
13. El Din, H.M. (2021). Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem, Blenkinge Institute of Technology.
14. A Performance Comparison of GA and ACO Applied to TSP
15. Ant colony versus genetic algorithm based on travelling salesman problem
16. Learning for multiple purposes: A Q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problem10.1016/j.cie.2023.109851 ↗
17. Manfrin, M., Birattari, M., Stützle, T., and Dorigo, M. (2006). Parallel ant colony optimization for the traveling salesman problem. Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, Springer. Available online: https://link.springer.com/chapter/10.1007/11839088_20.10.1007/11839088_20 ↗
18. Improved ant colony optimization algorithm for the traveling salesman problems10.3969/j.issn.1004-4132.2010.02.025 ↗
19. Holland, J. (2025, May 31). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Available online: https://books.google.com/books?hl=en&lr=&id=5EgGaBkwvWcC&oi=fnd&pg=PR7&dq=Adaptation+in+Natural+and+Artificial+Systems:+An+Introductory+Analysis+with+Applications+to+Biology,+Control,+and+Artificial+Intelligence&ots=mKjq65Knwo&sig=7UCexT89PHykaf8ooWmXKCa9XZM.
20. On the nearest neighbor rule for the metric traveling salesman problem10.1016/j.dam.2014.03.012 ↗
21. Raymond, T.C. (2025, May 31). Journal of and Development and Undefined 1969. Heuristic Algorithm for the Traveling-Salesman Problem. Available online: https://ieeexplore.ieee.org/abstract/document/5391746/.
22. Ayudhya, W., and Grasman, S. (2025, May 31). Conference Undefined 2005. A New Heuristic Algorithm for the Traveling Salesman Problem. Available online: https://search.proquest.com/openview/ab34da7735a2205dfa1664a3bf507c81/1?pq-origsite=gscholar&cbl=51908.
23. An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem10.1007/s00453-017-0293-5 ↗
24. A new simulated annealing approach for travelling salesman problem
25. Wang, Y., Sun, S., and Li, W. (2021, January 25–28). Hierarchical Reinforcement Learning for Vehicle Routing Problems with Time Windows. Proceedings of the Canadian Conference on Artificial Intelligence, Vancouver, BC, Canada.10.21428/594757db.f0516e23 ↗
26. Nazari, M., Oroojlooy, A., Snyder, L., and Takác, M. (2025, August 19). In Neural; Undefined 2018. Reinforcement Learning for Solving the Vehicle Routing Problem. Advances in Neural Information Processing Systems. Available online: https://proceedings.neurips.cc/paper/2018/hash/9fb4651c05b2ed70fba5afe0b039a550-Abstract.html.
27. Yan, D., Guan, Q., Ou, B., Yan, B., and Cao, H. (2025). Graph-Driven Deep Reinforcement Learning for Vehicle Routing Problems with Pickup and Delivery. Appl. Sci., 15.10.3390/app15094776 ↗
28. Enhancing vehicle routing problem solutions through deep reinforcement learning and graph neural networks
29. Multi-agent Reinforcement Learning Based Approach for Vehicle Routing Problem