Advertisement

Decision Support System for the Multi-depot Vehicle Routing Problem

  • Takwa Tlili
  • Saoussen Krichen
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 359)

Abstract

This paper is concerned with designing an integrated transportation solver for multi-depot vehicle routing problem with distance constraints (MD-DVRP). The MD-DVRP is one of the most tackled transportation problems in real-world situations. It is about seeking the vehicle routes that minimize the overall travelled distance. To cope with the MD-DVRP, a Decision Support System (DSS) is designed based on the integration of Geographical Information System (GIS) and the Local Search (LS). The DSS architecture as well as its performance are checked using a real world case.

Keywords

Multi-depot vehicle routing problem Metaheuristic Local search Decision Support System 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming 120, 347–380 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Chen, P., Huang, H.-k., Dong, X.-Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems with Applications 27, 1620–1627 (2010)CrossRefGoogle Scholar
  3. 3.
    Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization 12, 129–146 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 2, 105–119 (1997)CrossRefGoogle Scholar
  5. 5.
    Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics 20, 483–509 (2014)CrossRefGoogle Scholar
  6. 6.
    Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of np-completeness, 1st edn. W. H. Freeman (1979)Google Scholar
  7. 7.
    Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Boston (1997)CrossRefzbMATHGoogle Scholar
  8. 8.
    Karakatič, S., Podgorelec, V.: A survey of genetic algorithms for solving multi depot vehicle routing problem. Applied Soft Computing 27, 519–532 (2015)CrossRefGoogle Scholar
  9. 9.
    Li, H., Kong, C.W., Pang, Y.C., Shi, W.Z., Yu, L.: Internet-based geographical information systems system for e-commerce application in construction material procurement. Journal of Construction Engineering and Management 129, 689–697 (2003)CrossRefGoogle Scholar
  10. 10.
    Luo, J., Chen, M.-R.: Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Systems with Applications 41, 2535–2545 (2014)CrossRefGoogle Scholar
  11. 11.
    Narasimha, K.V., Kivelevitch, E., Sharma, B., Kumar, M.: An ant colony optimization technique for solving min–max multi-depot vehicle routing problem. Swarm and Evolutionary Computation 13, 63–73 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Takwa Tlili
    • 1
  • Saoussen Krichen
    • 1
  1. 1.LARODEC, Institut Supérieur de Gestion TunisUniversité de TunisTunisTunisia

Personalised recommendations