Skip to main content
SpringerLink
Log in

A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In the capacitated vehicle routing problem we are given the locations of customers and depots, along with a vehicle of capacity \(k\). The objective is to find a minimum length collection of tours covering all customers such that each tour starts and end at a depot and visits at most \(k\) customers. The problem is a generalization of the traveling salesman problem. We present a quasipolynomial time approximation scheme for the Euclidean setting of the problem when all points lie in \(\mathbb {R}^d\) for constant dimension \(d\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane for moderately large values of k. Algorithms and Computation. Springer-Verlag, Berlin (2009)

    Google Scholar 

  2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: A survey. Math. Program. 97(1–2), 43–69 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Arora, S., Karakostas, G.: Approximation schemes for minimum latency problems. SIAM J. Comput. 32(5), 1317–1337 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: a polynomial approximation scheme for fixed k. Research Report RT0162, IBM Tokyo Research Laboratory (1996)

  6. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: STOC ’97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 275–283, ACM, New York (1997)

  7. Borradaile, G., Klein, P.N., Mathieu, C.: A polynomial-time approximation scheme for Euclidean steiner forest. In: FOCS ’08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 115–124, IEEE Computer Society, Washington DC (2008)

  8. Cardon, S., Dommers, S., Eksin, C., Sitters, R., Stougie, A., Stougie. L.: A PTAS for the multiple depot vehicle routing problem. SPOR Reports, January 2008. www.win.tue.nl/bs/spor/. Accessed 9 June 2014

  9. Czumaj A., Lingas, A.: A polynomial time approximation scheme for Euclidean minimum cost k-connectivity. In ICALP ’98: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, pp. 682–694, Springer-Verlag, London (1998)

  10. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  11. Das A., Mathieu, C.: A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: SODA ’10: Proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia (2009)

  12. Fisher, M., Fisher, M.: Chapter 1 vehicle routing. In: Monma, C.L., Ball, M.O., Magnanti, T.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science. Network routing, vol. 8, pp. 1–33. Elsevier, Oxford (1995)

    Google Scholar 

  13. Golden, B., Raghavan, S., Wasil, E.: The vehicle routing problem: latest advances and new challenges. Operations Research/Computer Science Interfaces Series, vol. 43. Springer, New York (2008)

    Google Scholar 

  14. Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527–542 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Haimovich, M., Rinnooy Kan, A.H.G., Stougie, L.: Analysis of heuristics for vehicle routing problems. In: Vehicle Routing: Methods and Studies. Management Science Systems, vol. 16, pp. 47–61, Elsevier Science B.V., Amsterdam (1988)

  16. Karloff, H.: How long can a Euclidean traveling salesman tour be? SIAM J. Discr. Math. 2(1), 91–99 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kolliopoulos, S.G., Rao, S.: A nearly linear-time approximation scheme for the Euclidean k-median problem. SIAM J. Comput. 37(3), 757–782 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Li, C.L., Simchi-Levi, D.: Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems. INFORMS 2(1), 64–73 (1990)

    MATH  MathSciNet  Google Scholar 

  19. Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric tsp, k-mst, and related problems. SIAM J. Comput. 28(4), 1298–1309 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  20. Rao, S.B., Smith, W.D.: Approximating geometrical graphs via “spanners” and “banyans”. In: STOC ’98: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 540–550, ACM, New York (1998)

  21. Remy, J., Steger, A.: A quasi-polynomial time approximation scheme for minimum weight triangulation. In: STOC ’06: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 316–325, ACM, New York (2006)

  22. Toth, P., Vigo, D. (eds.): The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)

    Google Scholar 

  23. Vazirani, V.: Approximation Algorithms. Springer-Verlag, New York (2001)

    Google Scholar 

Download references

Acknowledgments

A preliminary version of this paper appeared in [11] Both authors supported by NSF Grant CCF-0728816.

Author information

Authors and Affiliations

  1. Brown University, Providence, RI, USA

    Aparna Das & Claire Mathieu

Authors
  1. Aparna Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claire Mathieu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aparna Das.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, A., Mathieu, C. A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. Algorithmica 73, 115–142 (2015). https://doi.org/10.1007/s00453-014-9906-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-014-9906-4

Keywords

Search

Navigation