• DOI:10.1145/2591796.2591840
Corpus ID: 8814340

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing

@article{Friggstad2014ApproximationAF,
  title={Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing},
  author={Zachary Friggstad and C. Swamy},
  journal={Proceedings of the forty-sixth annual ACM symposium on Theory of computing},
  year={2014}
}

Zachary Friggstad, C. Swamy

Published 2014

Mathematics, Computer Science

Proceedings of the forty-sixth annual ACM symposium on Theory of computing

We consider vehicle-routing problems (VRPs) that incorporate the notion of regret of a client, which is a measure of the waiting time of a client relative to its shortest-path distance from the depot. Formally, we consider both the additive and multiplicative versions of, what we call, the regret-bounded vehicle routing problem (RVRP). In these problems, we are given an undirected complete graph G = ({r} ∪ V,E) on n nodes with a distinguished root (depot) node r, edge costs {cuv} that form a… CONTINUE READING

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed