Matheuristics pp 253-266 | Cite as

A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem

  • Sandra Ulrich NgueveuEmail author
  • Christian Prins
  • Roberto Wolfler Calvo
Part of the Annals of Information Systems book series (AOIS, volume 10)


This chapter presents a hybridization of a perfect b-matching within a tabu search framework for the m-Peripatetic Vehicle Routing Problem (m-PVRP). The m-PVRP models, for example, money transports and cash machines supply where, for security reasons, no path can be used more than once during m periods and the amount of money allowed per vehicle is limited. It consists in finding a set of routes of minimum total cost over m periods from an undirected graph such that each customer is visited exactly once per period and each edge can be used at most once during the m periods. Each route starts and finishes at the depot with a total demand not greater than the vehicle capacity. The aim is to minimize the total cost of the routes. The m-PVRP can be considered as a generalization of two well-known NP-hard problems: the vehicle routing problem (VRP or 1-PVRP) and the m-Peripatetic Salesman Problem (m-PSP). Computational results on classical VRP instances and TSPLIP instances show that the hybrid algorithm obtained improves the tabu search, not only on the m-PVRP in general, but also on the VRP and the m-PSP.


Tabu Search Travel Salesman Problem Tabu Search Algorithm Vehicle Capacity Minimum Total Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Augerat. Approche polyédrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble, France, 1995.Google Scholar
  2. 2.
    R. Baldacci, N. Christofides, and A. Mingozzi. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming, 115(2):351–385, 2008.CrossRefGoogle Scholar
  3. 3.
    N. Christofides, A. Mingozzi, and P. Toth. The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, and L. Sandi, editors, Combinatorial Optimization, pages 315–338. Wiley, Chichester, UK, 1979.Google Scholar
  4. 4.
    G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568–581, 1964.CrossRefGoogle Scholar
  5. 5.
    J.F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J.S. Sormany. New heuristics for the vehicle routing problem. In A. Langevin and D. Riopel, editors, Logistics systems: design and optimization, pages 279–298. Wiley, 2005.Google Scholar
  6. 6.
    J.B.J.M. De Kort and A. Volgenant. On the generalized peripatetic salesman problem. European Journal of Operational Research, 73:175–180, 1994.CrossRefGoogle Scholar
  7. 7.
    E. Duchenne, G. Laporte, and F. Semet. Branch and cut algorithms for the undirected m-peripatetic salesman problem. European Journal of Operational Research, 162:700–712, 2005.CrossRefGoogle Scholar
  8. 8.
    E. Duchenne, G. Laporte, and F. Semet. The undirected m-peripatetic salesman problem: Polyhedral results and new algorithms. Operations Research, 55(5):949–965, 2007.CrossRefGoogle Scholar
  9. 9.
    J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.Google Scholar
  10. 10.
    F. Glover and M. Laguna. Tabu search. In C.R. Reeves, editor, Modern heuristic techniques for combinatorial problems, pages 70–150. Blackwell, Oxford, UK, 1993.Google Scholar
  11. 11.
    J. Krarup. The peripatetic salesman and some related unsolved problems. In B. Roy, editor, Combinatorial Programming Methods and Applications, pages 173–178. Reidel, Dordrecht, 1975.Google Scholar
  12. 12.
    S.U. Ngueveu, C. Prins, and R. Wolfler Calvo. Bornes supérieures et inférieures pour le problème de tournées de véhicules m-péripatétiques. In Actes de la 7ème conférence internationale de Modélisation et Simulation (MOSIM), volume 3, pages 1617–1625, Paris, France, 2008.Google Scholar
  13. 13.
    E.D. Taillard. Parallel iterative search methods for vehicle routing problems. Technical Report G-2002-15, Les Cahiers du GERAD, Canada, 2002.Google Scholar
  14. 14.
    P. Toth and D. Vigo. The vehicle routing problem. SIAM, Philadelphia, 2002.Google Scholar
  15. 15.
    P. Toth and D. Vigo. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15(4):333–346, 2003.CrossRefGoogle Scholar
  16. 16.
    R. Wolfler Calvo and R. Cordone. A heuristic approach to the overnight security service problem. Computers & Operations Research, 30:1269–1287, 2003.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Sandra Ulrich Ngueveu
    • 1
    Email author
  • Christian Prins
    • 1
  • Roberto Wolfler Calvo
    • 1
  1. 1.Institut Charles Delaunay – LOSI, Universitè de Technologie de Troyes (UTT)TroyesFrance

Personalised recommendations