Skip to main content
SpringerLink
Log in
Book cover

International Conference on Analysis of Images, Social Networks and Texts

AIST 2018: Analysis of Images, Social Networks and Texts pp 318–328Cite as

Efficient PTAS for the Euclidean CVRP with Time Windows

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11179))

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial optimization problem having a wide range of practical applications in operations research. It is known that the problem is NP-hard and remains intractable even in the Euclidean plane. Although the problem is hardly approximable in the general case, some of its geometric settings can be approximated efficiently. Unlike other versions of CVRP, approximability of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) by the algorithms with performance guarantees seems to be weakly studied so far. To the best of our knowledge, the recent Quasi-Polynomial Time Approximation Scheme (QPTAS) proposed by L. Song et al. appears to be the only one known result in this field. In this paper, we propose the first Efficient Polynomial Time Approximation Scheme (EPTAS) for CVRPTW extending the classic approach of M. Haimovich and A. Rinnooy Kan.

This research was supported by Russian Science Foundation, grant no. 14-11-00109.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications. Chapman & Hall/CRC Data Mining and Knowledge Discovery Series. Chapman and Hall/CRC, Boca Raton (2013)

    Book  Google Scholar 

  2. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009). https://doi.org/10.1007/s10994-009-5103-0

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Braekers, K., Ramaekers, K., van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300–313 (2016). http://www.sciencedirect.com/science/article/pii/S0360835215004775

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115–142 (2015)

    Article  MathSciNet  Google Scholar 

  7. Expósito-Izquierdo, C., Rossi, A., Sevaux, M.: A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput. Ind. Eng. 91, 274–289 (2016). http://www.sciencedirect.com/science/article/pii/S0360835215004684

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. van Hoorn, J.J.: A note on the worst case complexity for the capacitated vehicle routing problem. In: Research Memorandum, vol. 5. Faculteit der Economische Wetenschappen en Bedrijfskunde (2010)

    Google Scholar 

  10. Kel’manov, A.V., Pyatkin, A.V.: Complexity of certain problems of searching for subsets of vectors and cluster analysis. Comput. Math. Math. Phys. 49(11), 1966–1971 (2009). https://doi.org/10.1134/S0965542509110128

    Article  MathSciNet  MATH  Google Scholar 

  11. Khachai, M.Y., Dubinin, R.D.: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces. Proc. Steklov Inst. Math. 297(1), 117–128 (2017). https://doi.org/10.1134/S0081543817050133

    Article  MathSciNet  MATH  Google Scholar 

  12. Khachay, M., Dubinin, R.: PTAS for the Euclidean capacitated vehicle routing problem in \(R^d\). In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 193–205. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_16

    Chapter  Google Scholar 

  13. Khachay, M., Zaytseva, H.: Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 178–190. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26626-8_14

    Chapter  Google Scholar 

  14. Kumar, S., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manag. 4, 66–74 (2012)

    Google Scholar 

  15. Song, L., Huang, H.: The Euclidean vehicle routing problem with multiple depots and time windows. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 449–456. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-71147-8_31

    Chapter  Google Scholar 

  16. Song, L., Huang, H., Du, H.: Approximation schemes for Euclidean vehicle routing problems with time windows. J. Comb. Optim. 32(4), 1217–1231 (2016). https://doi.org/10.1007/s10878-015-9931-5

    Article  MathSciNet  MATH  Google Scholar 

  17. Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, 2nd edn. MOS-SIAM Series on Optimization. SIAM (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay & Yuri Ogorodnikov

  2. Ural Federal University, Ekaterinburg, Russia

    Michael Khachay & Yuri Ogorodnikov

  3. Omsk State Technical University, Omsk, Russia

    Michael Khachay

Authors
  1. Michael Khachay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Ogorodnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Michael Khachay or Yuri Ogorodnikov .

Editor information

Editors and Affiliations

  1. RWTH Aachen University, Aachen, Germany

    Wil M. P. van der Aalst

  2. University of Ljubljana, Ljubljana, Slovenia

    Vladimir Batagelj

  3. University of Mannheim, Mannheim, Germany

    Goran Glavaš

  4. National Research University Higher School of Economics, Moscow, Russia

    Dmitry I. Ignatov

  5. Institute of Mathematics and Mechanics, Yekaterinburg, Russia

    Michael Khachay

  6. National Research University Higher School of Economics, Moscow, Russia

    Sergei O. Kuznetsov

  7. National Research University Higher School of Economics , Saint Petersburg, Russia

    Olessia Koltsova

  8. National Research University Higher School of Economics, Moscow, Russia

    Irina A. Lomazova

  9. Moscow State University, Moscow, Russia

    Natalia Loukachevitch

  10. Loria, Vandoeuvre lès Nancy, France

    Amedeo Napoli

  11. University of Hamburg, Hamburg, Germany

    Alexander Panchenko

  12. University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  13. Ca Foscari University of Venice, Venice, Italy

    Marcello Pelillo

  14. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Andrey V. Savchenko

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khachay, M., Ogorodnikov, Y. (2018). Efficient PTAS for the Euclidean CVRP with Time Windows. In: van der Aalst, W., et al. Analysis of Images, Social Networks and Texts. AIST 2018. Lecture Notes in Computer Science(), vol 11179. Springer, Cham. https://doi.org/10.1007/978-3-030-11027-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-11027-7_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-11026-0

  • Online ISBN: 978-3-030-11027-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation