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
    21 Citations
    Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
    • 5
    • PDF
    A Framework for Vehicle Routing Approximation Schemes in Trees
    • 2
    • PDF
    Vehicle Routing with Subtours
    • PDF
    The Capacitated Orienteering Problem
    • 2
    • Highly Influenced
    Minimizing Latency of Capacitated k-Tours
    • 4
    Distance Constrained Vehicle Routing Problem to Minimize the Total Cost
    Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
    • 6
    • PDF
    Improving the Approximation Ratio for Capacitated Vehicle Routing
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 13 REFERENCES
    Approximation algorithms for distance constrained vehicle routing problems
    • 71
    • Highly Influential
    • PDF
    When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
    • 319
    • Highly Influential
    The School Bus Problem on Trees
    • 4
    • Highly Influential
    • PDF
    A general approximation technique for constrained forest problems
    • 887
    • Highly Influential
    • PDF
    Santa Claus schedules jobs on unrelated machines
    • 75
    • Highly Influential
    • PDF
    Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem
    • 87
    • Highly Influential
    • PDF
    An efficient approximation scheme for the one-dimensional bin-packing problem
    • N. Karmarkar, R. Karp
    • Mathematics, Computer Science
    • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
    • 1982
    • 481
    • Highly Influential
    On maximizing welfare when utility functions are subadditive
    • U. Feige
    • Mathematics, Computer Science
    • STOC '06
    • 2006
    • 260
    • Highly Influential
    • PDF
    The school bus routing problem: A review
    • 241
    • Highly Influential
    The Santa Claus problem
    • 229
    • Highly Influential
    • PDF