Routing for Distribution Logistics

S. P. Anbuudayasankar, K. Ganesh and Sanjay Mohapatra
Additional contact information
S. P. Anbuudayasankar: Amrita School of Engineering
K. Ganesh: McKinsey Knowledge Center India
Sanjay Mohapatra: Xavier Institute of Management

Chapter Chapter 5 in Models for Practical Routing Problems in Logistics, 2014, pp 95-122 from Springer

Abstract: Abstract The classical VRP is concerned with a set of customers to be served by a set of vehicles housed at a depot or distribution centre located in the same geographical region. The objective of the problem is to devise a set of vehicle routes with minimum distance in such a way that all delivery points are served. The demands of the points assigned to each route do not exceed the capacity of the vehicle that serves the specified route. The objective is to minimise the total distance travelled by all the vehicles and in turn to minimise the overall distribution cost. While VRP has received much attention from researchers in the last four decades (Toth and Vigo 2002), variants of this problem with more and more constraints have attracted the attention of scientific community of late.

Keywords: Benchmark Dataset; Blood Bank; Vehicle Capacity; Public Health Care System; Initial Route (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-05035-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319050355

DOI: 10.1007/978-3-319-05035-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().