Abstract
This paper studies the Euclidean vehicle routing problem with multiple depots and time windows (Euclidean VRP with MDTW). We consider the scenario where there are multiple depots which could dispatch out vehicles, and customers must be serviced within a time window which is chosen from a finite set of consecutive time windows. Specially, in an input instance of Euclidean VRP with MDTW, we require that each customer has the same unit demand, ignore the limit of vehicle number, and give a reasonable service ability to the servicing vehicles. In quasi-polynomial time, our algorithm could generate a solution with the expected length at most \((1 + O(\epsilon ))OPT\).
This work was financially supported by National Natural Science Foundation of China with Grant No. 11371004 and No. 61672195, National Key Research and Development Program of China with Grant No. 2016YFB0800804 and No. 2017YFB0803002, Shenzhen Science and Technology Plan with Grant No. JCYJ20160318094336513, No. JCYJ20160318094101317 and No. KQCX20150326141251370, and China Scholarship Council.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1959)
Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)
Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115–142 (2015)
Das, A.: (Dissertation) Approximation Schemes for Euclidean Vehicle Routing Problems. Brown University, Providence, Rhode Island, USA (2011)
Martin, C., Salavatipour, M.: Minimizing latency of capacitated k-tours. Algorithmica (2017). Online First Article
Lacomme, P., Prins, C., Ramdane-Chérif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159–185 (2004)
Baldacci, R., Mingozzi, A., Roberti, R., Calvo, R.W.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61, 298–314 (2013)
Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logistics Eng. 2, 52–58 (2014)
Sousaa, J.C., Biswasa, H.A., Britob, R., Silveirab, A.: A multi objective approach to solve capacitated vehicle routing problems with time windows using mixed integer linear programming. Int. J. Adv. Sci. Technol. 28, 1–8 (2011)
Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica (2017). Online First Article
Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97, 43–69 (2003)
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753–782 (1998)
A.Das and C.Mathieu. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 390–403 (2010)
Song, L., Huang, H., Du, H.: A quasi-polynomial time approximation scheme for Euclidean CVRPTW. In: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2014, pp. 66–73 (2014)
Song, L., Huang, H., Du, H.: Approximation schemes for Euclidean vehicle routing problems with time windows. J. Comb. Optim. 32, 1217–1231 (2016)
Bounds and heuristic for capacitated routing problems: Haimovich, M., Rinnooy Kan, A.H.G. Math. Oper. Res. 10, 527–542 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Song, L., Huang, H. (2017). The Euclidean Vehicle Routing Problem with Multiple Depots and Time Windows. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-71147-8_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71146-1
Online ISBN: 978-3-319-71147-8
eBook Packages: Computer ScienceComputer Science (R0)