A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
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.
KeywordsTabu Search Travel Salesman Problem Tabu Search Algorithm Vehicle Capacity Minimum Total Cost
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 9.J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.Google Scholar
- 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.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.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.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.P. Toth and D. Vigo. The vehicle routing problem. SIAM, Philadelphia, 2002.Google Scholar