article · Procedia Computer Science
Vehicle routing problem is a NP-hard problem and a combinatorial optimization problem; it appeared first time in 1959 in the paper of the mathematician Dantzig. The goal of VRP is to locate the optimal routes of some vehicles that begin from a depot and serve each customer one time and then return to the depot (i.e., Starting point). From its beginning, the research literature in this area is growing rapidly and causing the extension of VRP to many variants for making it a real-world problem. For solving it, the researchers have tried firstly the exact methods then the heuristics and lastly the metaheuristics. This paper aims for many targets for instance: (i) discovering the evolution of VRP and its variants over the last decade; (ii) knowing the trends, challenges and opportunities in the next years in this fields by discovering, comparing many recent reviews and papers related either to VRP or to metaheuristics for exploiting these results and building on them in other papers.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1016/j.procs.2023.03.051
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
