On Solving the Multi-depot Vehicle Routing Problem

  • Takwa Tlili
  • Saoussen Krichen
  • Ghofrane Drira
  • Sami Faiz
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


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.


Multi-depot vehicle routing problem Cplex Iterated local search 


  1. 1.
    Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multidepot vehicle routing problems. Congr. Numer. 44, 283–292 (1984)Google Scholar
  2. 2.
    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)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Ghoseiri, K., Ghannadpour, S.: A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows. Appl. Soft Comput. 10, 53–65 (2010)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Boston (1997)CrossRefMATHGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  • Takwa Tlili
    • 1
  • Saoussen Krichen
    • 1
  • Ghofrane Drira
    • 1
  • Sami Faiz
    • 2
  1. 1.LARODEC, Institut Supérieur de Gestion TunisUniversité de TunisTunisTunisia
  2. 2.LTSIRS, Ecole Nationale dIngenieurs de TunisUniversité de Tunis El ManarTunisTunisia

Personalised recommendations