[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

A path relinking algorithm for a multi-depot periodic vehicle routing problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper, we consider a multi-depot periodic vehicle routing problem which is characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods, and two types of constraints that are often found in reality, i.e., vehicle capacity and route duration constraints. The objective is to minimize total travel costs. To tackle the problem, we propose an efficient path relinking algorithm whose exploration and exploitation strategies enable the algorithm to address the problem in two different settings: (1) As a stand-alone algorithm, and (2) As a part of a co-operative search algorithm called integrative co-operative search. The performance of the proposed path relinking algorithm is evaluated, in each of the above ways, based on standard benchmark instances. The computational results show that the developed PRA performs well, in both solution quality and computational efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

  • Coy, S.P., Golden, B.L., Runger, G.C., Wasil, E.A.: Using experimental design to find effective parameter settings for heuristics. J. Heuristics 7(1), 77–97 (2000)

    Article  Google Scholar 

  • Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  • Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086–1094 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40, 1276–1290 (1994)

    Article  MATH  Google Scholar 

  • Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1–4), 109–133 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Glover, F., Laguna, M.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

  • Hadjiconstantinou, E., Baldacci, R.: A multi-depot period vehicle routing problem arising in the utilities sector. J. Oper. Res. Soc. 49, 1239–1248 (1998)

    MATH  Google Scholar 

  • Kang, K.H., Lee, Y.H., Lee, B.K.: An exact algorithm for multi depot and multi period vehicle scheduling problem. In: Computational Science and Its Applications-ICCSA, Lecture Notes in Computer Science, pp. 350–359. ICCSA, Springer-Verlag, Berlin, Heidelberg (2005)

  • Kytöjoki, J., Nuortio, T., Bräysy, O., Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comp. Oper. Res. 34(9), 2743–2757 (2007)

    Article  MATH  Google Scholar 

  • Lahrichi, N., Crainic, T.G., Gendreau, M., Rei, W., Crisan, G.C., Vidal, T.: An integrative cooperative search framework for multi-decision-attribute combinatorial optimization. Technical Report, CIRRELT, p. 42 (2012)

  • Parthanadee, P., Logendran, R.: Periodic product distribution from multi-depots under limited supplies. IIE Trans. 38(11), 1009–1026 (2006)

    Article  Google Scholar 

  • Smith, S.K., Eiben, A.E.: Parameter Tuning of Evolutionary Algorithms: Generalist and Specialist. Applications of Evolutionary Computation, LNCS vol. 6024, pp. 542–551. Springer, Heidelberg (2010)

  • Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)

    Book  MATH  Google Scholar 

  • Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multi-depots and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Partial funding for this project has been provided by the Natural Sciences and Engineering Council of Canada (NSERC), through its Industrial Research Chair, Collaborative Research and Development, and Discovery Grant programs, by the Fonds de Recherche du Québec - Nature et Technologies (FRQ-NT) through its Team Research Project program, and by the EMME/2-STAN Royalty Research Funds (Dr. Heinz Spiess). We also gratefully acknowledge the support of Fonds de recherche du Qubec through their infrastructure grants.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alireza Rahimi-Vahed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rahimi-Vahed, A., Crainic, T.G., Gendreau, M. et al. A path relinking algorithm for a multi-depot periodic vehicle routing problem. J Heuristics 19, 497–524 (2013). https://doi.org/10.1007/s10732-013-9221-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-013-9221-2

Keywords

Navigation