Abstract
The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem with a wide range of applications in operations research. Since the CVRP is NP-hard even in a finite-dimensional Euclidean space, special attention is traditionally paid to the issues of its approximability. A major part of the known results concerning approximation algorithms and polynomial-time approximation schemes (PTAS) for this problem are obtained for its particular statement in the Euclidean plane. In this paper, we show that the approach to the development of a PTAS for the planar problem with a single depot proposed by Haimovich and Rinnooy Kan in 1985 can be successfully extended to the more general case, for instance, in spaces of arbitrary fixed dimension and for an arbitrary number of depots.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Arora, “Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems,” J. ACM 45 (5), 753–782 (1998).
T. Asano, N. Katoh, H. Tamaki, and T. Tokuyama, Covering Points in the Plane by k-Tours: A Polynomial Approximation Scheme for Fixed k, Report RT0162 (IBM Tokyo Research Laboratory 1996).
S. Cardon, S. Dommers, C. Eksin, R. Sitters, A. Stougie, and L. Stougie, A PTAS for the Multiple Depot Vehicle Routing Problem, Technical Report No. 2008.10 (Eindhoven Univ. of Technology, 2008).
N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” in Algorithms and Complexity: New Directions and Recent Results (Academic, New York, 1975), p.441.
G. Dantzig and H. Ramser, “The truck dispatching problem,” Management Sci. 6 (1), 80–91 (1959).
A. Das and C. Mathieu, “A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing,” Algorithmica 73 (1), 115–142 (2015).
E. K. Gimadi and I. A. Rykov, “On the asymptotic optimality of a solution of the euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight,” Dokl. Math. 93 (1), 117–120 (2016).
M. Haimovich and A. H. G. Rinnooy Kan, “Bounds and heuristics for capacitated routing problems,” Math. Oper. Res. 10 (4), 527–542 (1985).
S. Hubbert, Q. T. L. Gia, and T. M. Morton, Spherical Radial Basis Functions: Theory and Applications (Springer, Cham, 2015).
M. Khachay and K. Neznakhina, “Approximability of the minimum-weight k-size cycle cover problem,” J. Global Optimiz. 66 (1), 65–82 (2015).
M. Khachay and H. Zaytseva, “Time approximation scheme for single-depot Euclidean capacitated vehicle routing problem,” in Combinatorial Optimization and Applications: Proceedings of the 9th International Conference, Houston, TX, USA, 2015 (Springer, Cham, 2015), pp. 178–190.
S. Kumar and R. Panneerselvam, “A survey on the vehicle routing problem and its variants,” Intel. Inform. Management 4 (3), 66–74 (2012).
C. Papadimitriou, “Euclidean TSP is NP-complete,” Theor. Comput. Sci., No 4, 237–244 (1977).
L. Song, H. Huang, and H. Du, “Approximation schemes for Euclidean vehicle routing problems with time windows,” J. Comb. Optimiz. 32 (4) (2016).
The Vehicle Routing Problem, Ed. by P. Toth and D. Vigo (SIAM, Philadelphia, 2001).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.Yu.Khachai, R.D.Dubinin, 2016, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2016, Vol. 22, No. 2.
Rights and permissions
About this article
Cite this article
Khachai, M.Y., Dubinin, R.D. Approximability of the Vehicle Routing Problem in finite-dimensional Euclidean spaces. Proc. Steklov Inst. Math. 297 (Suppl 1), 117–128 (2017). https://doi.org/10.1134/S0081543817050133
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543817050133