Frank
Dehne
Das
Surajit K.
Algorithms and Data Structures
978-3-540-28101-6
978-3-540-31711-1
space
false
routing problem
deterministic version
metric spaces
approximation
In the Vehicle Routing Problem (VRP), as in the Traveling Salesman Problem (TSP), we have a metric space of customer points, and we have to visits all customers. Additionally, every customer has a demand, a quantity of a commodity that has to be delivered in our vehicle from a single point called the depot. Because the vehicle capacity is bounded, we need to return to the depot each time we run out of the commodity to distribute. We describe a fully polynomial time algorithm with approximation 2.5, we also modify this algorithm for the on-line version of VRP, the randomized version has competitive ratio of 2.5 on the average, and the deterministic version has ratio 4. We also describe 2 approximation for a restricted version of the problem.
customers
quantity
salesman problem
polynomial time algorithm
vehicle routing problem
competitive ratio
chapter
ratio
2005
360-371
On the Vehicle Routing Problem
https://scigraph.springernature.com/explorer/license/
customer point
visits
vehicle capacity
Traveling Salesman Problem
restricted version
depots
version
commodities
algorithm
line version
point
chapters
time
time algorithm
average
vehicles
2005-01-01
demand
VRP
single point
https://doi.org/10.1007/11534273_32
problem
2022-10-01T06:55
ratio 4
capacity
dimensions_id
pub.1041178342
Mathematical Sciences
Numerical and Computational Mathematics
Piotr
Berman
Sack
Jörg-Rüdiger
doi
10.1007/11534273_32
Alejandro
López-Ortiz
Penske Logistics
Penske Logistics
The Pennsylvania State University
The Pennsylvania State University
Springer Nature - SN SciGraph project
Springer Nature