Abstract
This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first-level tabu searches for vehicle routing problems may be significantly improved with this technique. Moreover, the solutions produced by this technique may often be improved by a postoptimization technique presented in this article, too. The solutions of nearly forty problem instances of the literature have been improved.
Similar content being viewed by others
References
Chiang, W.-C., and Russell, R. (1993).Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows. Working paper, Department of Quantitative Methods, University of Tulsa, Tulsa, OK 74104.
Christofides, N., Mingozzi, A., and Toth, P. (1979). The vehicle routing problem. In N. Christofides, A Mingozzi, P. Toth, and C. Sandi (Eds.),Combinatorial Optimization. Chichester: Wiley.
Davis, L. (Ed.). (1987).Genetic Algorithms and Simulated Annealing. London: Pitman.
Dersochers, M., Desrosiers, J., and Solomon, J. (1992). A new optimization algorithm for the vehicle routing problem with time windows.Operations Research, 40, 342–354.
Fisher, M.L. (1994). Optimal solution of vehicle routing problems using minimum K-trees.Operations Research, 42, 626–642.
Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem.Management Science, 40, 1276–1290.
Gendreau, M., Laporte, G., and Potvin, J.-Y. (1995). Local search algorithms for the vehicle routing problem. In J.K. Lenstra and E.H.L. Aarts (Eds.),Local Search Algorithms. Chichester: Wiley.
Gillett, B.E., and Johnson, J. (1974). Sweep Algorithm for the multiple depot vehicle-dispatch problem. Paper presented at the ORSA National Meeting, San Juan.
Glover, F. (1975). Surrogate constraint duality in mathematical programming.Operations Research, 23, 434–451.
Glover, F. (1977). Heuristics for integer programming using surrogate constraints.Decision Sciences, 8(1), 156–166.
Glover, F. (1990). Tabu search: Part II.ORSA Journal on Computing, 2, 4–32.
Holland, J.H. (1976).Adaptations in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
Potvin, J.-Y., and Bengio, S. (1994).A Genetic Approach to the Vehicle Routing Problem with Time Windows. Publication CRT-953, Centre de recherche sur les transports, University of Montreal.
Portvin, J.-Y., Kervahut, T., Garcia, B.-L., and Rousseau, J.-M. (1993).A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Publication CRT-855, Centre de recherche sur les transport, University of Montreal.
Rochat, Y., and Semet, F. (1994). A tabu search approach for delivering pet food and flour in Switzerland.Journal of the Operational Research Society, 45, 1233–1246.
Russel, R.A. (1995). Hybrid heuristics for the vehicle routing problem with time windows.Transportation Science, 29, 156–166.
Semet, F. and Taillard, É.D. (1993). Solving real-life vehicle routing problems efficiently using taboo searcch.Annals of Operations Research, 41, 469–488.
Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problem with time window constraints.Operations Research, 35, 254–265.
Taillard, É.D. (1993). Parallel iterative search methods for vehicle routing problems.Networks, 23, 661–676.
Taillard, É.D. (1994).Comparison of Heuristic Methods for the Quadratic Assignment Problem. Publication CRT-989, Centre de recherche sur les transports, University of Montreal.
Thangiah, S.R., Osman, I.H., and Sun, T. (1994). Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Working paper UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent. Canterbury.
Thompson, P.M., and Psaraftis, H. (1993). Cyclic transfer algorithms for multi-vehicle routing and scheduling problems.Operations Research, 41, 935–946.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rochat, Y., Taillard, É.D. Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1, 147–167 (1995). https://doi.org/10.1007/BF02430370
Issue Date:
DOI: https://doi.org/10.1007/BF02430370