Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
P. Augerat. Approche polyédrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble, France, 1995.
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.
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.
G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568–581, 1964.
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.
J.B.J.M. De Kort and A. Volgenant. On the generalized peripatetic salesman problem. European Journal of Operational Research, 73:175–180, 1994.
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.
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.
J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.
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.
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.
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.
E.D. Taillard. Parallel iterative search methods for vehicle routing problems. Technical Report G-2002-15, Les Cahiers du GERAD, Canada, 2002.
P. Toth and D. Vigo. The vehicle routing problem. SIAM, Philadelphia, 2002.
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.
R. Wolfler Calvo and R. Cordone. A heuristic approach to the overnight security service problem. Computers & Operations Research, 30:1269–1287, 2003.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Ngueveu, S.U., Prins, C., Calvo, R.W. (2009). A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem. In: Maniezzo, V., Stützle, T., Voß, S. (eds) Matheuristics. Annals of Information Systems, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1306-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1306-7_11
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1305-0
Online ISBN: 978-1-4419-1306-7
eBook Packages: Business and EconomicsBusiness and Management (R0)