Metaheuristic Optimization Review MOR 3066-280X 10.54216/MOR https://www.americaspg.com/journals/show/3414 2024 2024 Operations Research Department, Faculty of Graduate Studies for Statistical Research, Cairo University, Giza 12613, Egypt Ali Ali Vehicle Routing Problem (VRP) variants and modifications are significant problems in combinatorial programming and logistics. They relate to efficient and optimal transport routing for customer demand fulfillment while monitoring operational costs. Traditional methods have been exact algorithms, heuristics, and metaheuristics; however, it has yet to be known to cater to the scalability, computational, efficiency, and adaptability challenges posed by dynamic and large-scale VRPs. Recent advances have shown enormous promise in combining this with learning approaches in hybrid forms: ML and metaheuristic and optimization techniques to overcome them. Such hybrid approaches now promise even better quality solutions, computational speeds, and real-world applicability for two actual ML methods: deep reinforcement learning and meta-learning. The present study surveys the current state of the art of hybrid methods applying to VRPs to find strengths, weaknesses, and directions that future research could intensify to enhance efficiency, scalability, and applicability to transportation and logistics systems. 2024 2024 48 58 10.54216/MOR.020205 https://www.americaspg.com/articleinfo/41/show/3414