article · Advances in Science Technology and Engineering Systems Journal
The attributes of the vehicle routing problem (VRP) are as many additional characteristics or constraints which aim to better take into account the specificities of real application cs. The variants of the VRP thus formed are the support of an extremely rich literature, comprising an immense variety of heuristics. This article constitutes an industrial application and an objective synthesis of successful and challenging heuristic concepts for time-windowed VRP problems. The purpose will be to minimize transport costs and determining the optimal number of trucks by applying a transport algorithm. The results show that the solution method should help to increase the competitiveness of transportation operations in this important economic sector.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.25046/aj080408
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.
