Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand

  • Michael KhachayEmail author
  • Yuri Ogorodnikov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)


The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is the well-known combinatorial optimization problem having numerous valuable applications in operations research. Unlike the classic CVRP (without time windows constraints), approximation algorithms with theoretical guarantees for the CVRPTW are still developed much less, even for the Euclidean plane. In this paper, perhaps for the first time, we propose an approximation scheme for the planar CVRPTW with non-uniform splittable demand combining the well-known instance decomposition framework by A. Adamaszek et al. and Quasi-Polynomial Time Approximation Scheme (QPTAS) by L. Song et al. Actually, for any \(\varepsilon \in (0,1)\) the scheme proposed finds a \((1+\varepsilon )\)-approximate solution of the problem in polynomial time provided the capacity q and the number p of time windows does not exceed \(2^{\log ^\delta n}\) for some \(\delta =O(\varepsilon )\). For any fixed p and q the scheme is Efficient Polynomial Time Approximation Scheme (EPTAS) with subquadratic time complexity.


Capacitated vehicle routing problem Time windows Splittable demand Polynomial time approximation scheme 


  1. 1.
    Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane rof moderately large values of \(k\). Int. J. Found. Comput. Sci. 21(06), 893–904 (2010). Scholar
  2. 2.
    Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other geometric problems. J. ACM 45, 753–782 (1998)MathSciNetCrossRefGoogle Scholar
  3. 3.
    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: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 275–283. ACM, New York (1997).
  4. 4.
    Becker, A., Klein, P.N., Saulpic, D.: A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4–6 September 2017. LIPIcs, vol. 87, pp. 12:1–12:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017).
  5. 5.
    Becker, A., Klein, P.N., Saulpic, D.: Polynomial-time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 20–22 August 2018. LIPIcs, vol. 112, pp. 8:1–8:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018).
  6. 6.
    Blocho, M., Czech, Z.: A parallel memetic algorithm for the vehicle routing problem with time windows. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 144–151 (2013).
  7. 7.
    Cassettari, L., Demartini, M., Mosca, R., Revetria, R., Tonelli, F.: A multi-stage algorithm for a capacitated vehicle routing problem with time constraints. Algorithms 11(5) (2018). Scholar
  8. 8.
    Chen, X., Kong, Y., Dang, L., Hou, Y., Ye, X.: Exact and metaheuristic approaches for a bi-objective school bus scheduling problem. PLOS ONE 10(7), 1–20 (2015). Scholar
  9. 9.
    Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115–142 (2015). Scholar
  11. 11.
    Gschwind, T., Irnich, S.: Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transp. Sci. 49(2), 335–354 (2015)CrossRefGoogle Scholar
  12. 12.
    Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527–542 (1985). Scholar
  13. 13.
    Hashimoto, H., Yagiura, M.: A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 254–265. Springer, Heidelberg (2008). Scholar
  14. 14.
    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). Scholar
  15. 15.
    Khachai, M., Ogorodnikov, Y.: Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows. Trudy instituta matematiki i mekhaniki UrO RAN 24(3), 233–246 (2018). Scholar
  16. 16.
    Khachay, M., Ogorodnikov, Y.: Efficient PTAS for the Euclidean CVRP with time windows. In: van der Aalst, W.M.P., et al. (eds.) AIST 2018. LNCS, vol. 11179, pp. 318–328. Springer, Cham (2018). Scholar
  17. 17.
    Khachay, M., Ogorodnikov, Y.: Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows. In: Evtushenko, Y., Jaćimović, M., Khachay, M., Kochetov, Y., Malkova, V., Posypkin, M. (eds.) OPTIMA 2018. CCIS, vol. 974, pp. 155–169. Springer, Cham (2019). Scholar
  18. 18.
    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). Scholar
  19. 19.
    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). Scholar
  20. 20.
    Kumar, S., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manag. 4, 66–74 (2012). Scholar
  21. 21.
    Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 20(6), 2309–2327 (2016). Scholar
  22. 22.
    Necula, R., Breaban, M., Raschip, M.: Tackling dynamic vehicle routing problem with time windows by means of ant colony system. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2480–2487 (2017).
  23. 23.
    Pace, S., Turky, A., Moser, I., Aleti, A.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Comput. Sci. 51, 2257–2266 (2015). International Conference on Computational Science, ICCS 2015CrossRefGoogle Scholar
  24. 24.
    Papadimitriou, C.: Euclidean TSP is NP-complete. Theor. Comput. Sci. 4, 237–244 (1977)CrossRefGoogle Scholar
  25. 25.
    Savelsbergh, M., van Woensel, T.: 50th anniversary invited article - city logistics: challenges and opportunities. Transp. Sci. 50(2), 579–590 (2016). Scholar
  26. 26.
    Shen, L., Tao, F., Wang, S.: Multi-depot open vehicle routing problem with time windows based on carbon trading. Int. J. Environ. Res. Public Health 15(9), 2025 (2018). Scholar
  27. 27.
    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). Scholar
  28. 28.
    Song, L., Huang, H., Du, H.: Approximation schemes for Euclidean vehicle routing problems with time windows. J. Comb. Optim. 32(4), 1217–1231 (2016). Scholar
  29. 29.
    Ting, C.K., Liao, X.L., Huang, Y.H., Liaw, R.T.: Multi-vehicle selective pickup and delivery using metaheuristic algorithms. Inf. Sci. 406–407, 146–169 (2017). Scholar
  30. 30.
    Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, 2nd edn. SIAM, Philadelphia (2014)CrossRefGoogle Scholar
  31. 31.
    Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475–489 (2013). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Krasovsky Institute of Mathematics and MechanicsEkaterinburgRussia
  2. 2.Ural Federal UniversityEkaterinburgRussia
  3. 3.Omsk State Technical UniversityOmskRussia

Personalised recommendations