Abstract
Vehicle routing problem (VRP) is concerned with finding efficient routes, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Liu, B. (2009). Vehicle Routing Problem. In: Theory and Practice of Uncertain Programming. Studies in Fuzziness and Soft Computing, vol 239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89484-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-89484-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89483-4
Online ISBN: 978-3-540-89484-1
eBook Packages: EngineeringEngineering (R0)