Abstract
In this paper we deal with a generalization of the multi-depot capacitated vehicle routing problem namely the multi-depot covering tour vehicle routing problem (MDCTVRP). This problem is considered more challenging since it deals with some situations where it is not possible to visit all the customers with the vehicles routes. In this problem, a customer can receive its demand directly by visiting it along the tour using a set of vehicles located at different depots or by covering it. A customer is considered as covered if it is located within an acceptable distance from at least one visited customer in the tour. The latter can satisfy its demand. We propose a general variable neighborhood search algorithm to solve the MDCTVRP. In this paper we use a variable neighborhood search (VNS) with a variable neighborhood descent (VND) method as a local search. Experiments were conducted on benchmark instances from the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Allahyari, S., Salari, M., Vigo, D.: A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242(3), 756–768 (2015). https://doi.org/10.1016/j.ejor.2014.10.048
Ha, M.H., Bostel, N., Langevin, A., Rousseau, L.: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur. J. Oper. Res. 226(2), 211–220 (2013). https://doi.org/10.1016/j.ejor.2012.11.012
Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, pp. 433–458. Springer, Boston (1999). https://doi.org/10.1007/978-1-4615-5775-3_30
Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001). https://doi.org/10.1016/S0377-2217(00)00100-4
Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 145–184. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_6
Kammoun, M., Derbel, H., Ratli, M., Jarboui, B.: An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. ITOR 24(3), 663–679 (2017). https://doi.org/10.1111/itor.12355
Pham, T.A., Ha, M.H., Nguyen, X.H.: Solving the multi-vehicle multi-covering tour problem. Comput. Oper. Res. 88, 258–278 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kammoun, M., Derbel, H., Jarboui, B. (2019). A GVNS Algorithm to Solve VRP with Optional Visits. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds) Variable Neighborhood Search. ICVNS 2018. Lecture Notes in Computer Science(), vol 11328. Springer, Cham. https://doi.org/10.1007/978-3-030-15843-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-15843-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15842-2
Online ISBN: 978-3-030-15843-9
eBook Packages: Computer ScienceComputer Science (R0)