Abstract
The Multi-Depot Vehicle Routing Problem (MDVRP) is a variant of the Vehicle Routing Problem (VRP) that consists in designing a set of vehicle routes to serve all customers, such that the maximum number of vehicle per depot, the vehicle capacity and the maximum time for each route are respected. The objective is to minimize the total cost of transportation. This paper presents an algorithm, named VNSALS, based on the Variable Neighborhood Search (VNS) with Adaptive Local Search (ALS) for solving it. The main procedures of VNSALS are perturbation, ALS and cluster refinement. The perturbation procedure of VNS is important to diversify the solutions and avoid getting stuck in local optima. The ALS procedure consists in memorizing the results found after applying a local search and in using this memory to select the most promising neighborhood for the next local search application. The choice of the neighborhood is very important to improve the solution in heuristic methods because the complexity of the local search is high and expensive. On the other hand, customer’s reallocation keeps the clusters more balanced. VNSALS is tested in classical instances of MDVRP for evaluating its efficiency and the results are presented and discussed.
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)
Aziz, R.A., Ayob, M., Othman, Z., Ahmad, Z., Sabar, N.R.: An adaptive guided variable neighborhood search based on honey-bee mating optimization algorithm for the course timetabling problem. Soft Comput. 21(22), 6755–6765 (2017)
Aziz, R., Ayob, M., Othman, Z., Sarim, H.: Adaptive guided variable neighborhood search. J. Appl. Sci. 13(6), 883–888 (2013)
Bezerra, S.N., de Souza, S.R., Souza, M.J.F.: A GVNS algorithm for solving the multi-depot vehicle routing problem. Electron. Notes Discrete Math. 66, 167–174 (2018). 5th International Conference on Variable Neighborhood Search
Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129–146 (2014)
Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)
Gillett, B.E., Johnson, J.G.: Multi-terminal vehicle-dispatch algorithm. Omega 4(6), 711–718 (1976)
Hansen, P., Mladenović, N., Moreno Pérez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319–360 (2008)
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The IRACE package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)
Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jiménez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115–129 (2015)
de Oliveira, F.B., Enayatifar, R., Sadaei, H.J., Guimarães, F.G., Potvin, J.Y.: A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Expert Syst. Appl. 43, 117–130 (2016)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)
Salhi, S., Imran, A., Wassan, N.A.: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52(PB), 315–325 (2014)
Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899–1911 (2010)
Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519–2531 (2013)
Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)
Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1–21 (2013)
Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Implicit depot assignments and rotations in vehicle routing heuristics. Eur. J. Oper. Res. 237(1), 15–28 (2014)
Acknowledgements
The authors would like to thank the CAPES Foundation, the Brazilian Council of Technological and Scientific Development (CNPq), the Minas Gerais State Research Foundation (FAPEMIG), the Federal Center of Technological Education of Minas Gerais (CEFET-MG), and the Federal University of Ouro Preto (UFOP) for supporting this research.
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
Nunes Bezerra, S., Souza, M.J.F., de Souza, S.R., Nazário Coelho, V. (2019). A VNS-Based Algorithm with Adaptive Local Search for Solving the Multi-Depot Vehicle Routing Problem. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-15843-9_14
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)