Combinatorial optimization-enriched machine learning to solve the dynamic vehicle routing problem with time windows

L Baty, K Jungel, PS Klein, A Parmentier… - Transportation …, 2024 - pubsonline.informs.org
With the rise of e-commerce and increasing customer requirements, logistics service
providers face a new complexity in their daily planning, mainly due to efficiently handling …

Rbg: Hierarchically solving large-scale routing problems in logistic systems via reinforcement learning

Z Zong, H Wang, J Wang, M Zheng, Y Li - Proceedings of the 28th ACM …, 2022 - dl.acm.org
The large-scale vehicle routing problems (VRPs) are defined based on the classical VRPs
with thousands of customers. It is an important optimization problem in modern logistic …

Rich vehicle routing problem: Survey

J Caceres-Cruz, P Arias, D Guimarans… - ACM Computing …, 2014 - dl.acm.org
The Vehicle Routing Problem (VRP) is a well-known research line in the optimization
research community. Its different basic variants have been widely explored in the literature …

Efficient active search for combinatorial optimization problems

A Hottung, YD Kwon, K Tierney - arXiv preprint arXiv:2106.05126, 2021 - arxiv.org
Recently numerous machine learning based methods for combinatorial optimization
problems have been proposed that learn to construct solutions in a sequential decision …

Solving multi-agent routing problems using deep attention mechanisms

G Bono, JS Dibangoye, O Simonin… - IEEE Transactions …, 2020 - ieeexplore.ieee.org
Routing delivery vehicles to serve customers in dynamic and uncertain environments like
dense city centers is a challenging task that requires robustness and flexibility. Most existing …