The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse), suitable tosolve problems in cases with up to 50 users.
Vehicle Routing Problem Models
2004
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Springer Verlag | 2009
|DataCite | 2024
|Transportation Research Record | 2013
|SLUB | 2002
|