Abstract
Problems associated with seeking the lowest cost vehicle routes to deliver demand from a set of depots to a set of customers are called Multi-depot Vehicle Routing Problems (MDVRP). The MDVRP is a generalization of the standard vehicle routing problem which involves more than one depot. In MDVRP each vehicle leaves a depot and should return to the same depot they started with. In this paper, the MDVRP is tackled using a iterated local search metaheuristic. Experiments are run on a number of benchmark instances of varying depots and customer sizes. The numerical results show that the proposed algorithm is competitive against state-of-the-art methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multidepot vehicle routing problems. Congr. Numer. 44, 283–292 (1984)
Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. 12, 129–146 (2014)
Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J. Heuristics 20, 483–509 (2014)
Ghoseiri, K., Ghannadpour, S.: A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows. Appl. Soft Comput. 10, 53–65 (2010)
Polacek, M., Hartl, R., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10, 613–627 (2004)
Yu, B., Yang, Z., Xie, J.: A parallel improved ant colony optimization for multi-depot vehicle routing problem. J. Oper. Res. Soc. 62, 183–188 (2010)
Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Boston (1997)
Chen, P., Kuan Huang, H., Dong, X.-Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst. Appl. 27, 1620–1627 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Tlili, T., Krichen, S., Drira, G., Faiz, S. (2016). On Solving the Multi-depot Vehicle Routing Problem. In: Nagar, A., Mohapatra, D., Chaki, N. (eds) Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. Smart Innovation, Systems and Technologies, vol 44. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2529-4_10
Download citation
DOI: https://doi.org/10.1007/978-81-322-2529-4_10
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2528-7
Online ISBN: 978-81-322-2529-4
eBook Packages: EngineeringEngineering (R0)