Abstract
Constraint Programming typically uses the technique of depth-first branch and bound as the method of solving optimization problems. Although this method can give the optimal solution, for large problems, the time needed to find the optimal can be prohibitive. This paper introduces a method for using local search techniques within a Constraint Programming framework, and applies this technique to vehicle routing problems. We introduce a Constraint Programming model for vehicle routing, and a system for integrating Constraint Programming and local search techniques. We then describe how the method can be accelerated by handling core constraints using fast local checks, while other more complex constraints are left to the constraint propagation system. We have coupled our local search method with a meta-heuristic to avoid the search being trapped in local minima. Several meta-heuristics are investigated ranging from a simple Tabu Search method to Guided Local Search. An empirical study over benchmark problems shows the relative merits of these techniques. Investigations indicate that the specific long-term memory technique used by Guided Local Search can be used as a diversification method for Tabu Search, resulting in significant benefit. Several new best solutions on the Solomon problems are found in relatively few iterations of our algorithm.
Similar content being viewed by others
References
De Backer, B. and V. Furnon. (1997). “Meta-Heuristics in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem.” In Proceedings of the 2nd International Conference on Meta-heuristics.
Caseau, Y. and F. Laburthe. (1997). “Solving Small TSPs with Constraints.” In L. Naish (ed.), Proceedings the 14th International Conference on Logic Programming. The MIT Press.
Clarke, G. and G.W. Wright. (1964). “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12, 568–581.
Desrochers, M., J. Desrosiers, and M. Solomon. (1992). “A new Optimization Algorithm for the Vehicle Routing Problems with Time Windows.” Operations Research 40(2), 342–354.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman.
Gendreau, M., A. Hertz, and G. Laporte. (1994). “A Tabu Search Heuristic for the Vehicle Routing Problem.” Management Science 40(10), 1276–1290.
Glover, F. (1989). “Tabu Search, part I.” ORSA Journal on Computing 1(3), 190–206.
Glover, F. (1990). “Tabu Search, part II.” ORSA Journal on Computing 2(1), 4–32.
Glover, F. and M. Laguna. (1995). “Tabu Search.” In Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, pp. 70–150.
Glover, F.W. and M. Laguna. (1997). Tabu Search. Kluwer Academic.
ILOG S.A. (1998). 9, Rue de Verdun, Gentilly, France. ILOG Dispatcher Reference Manual, Version 1.2.
ILOG S.A. (1998). 9, Rue de Verdun, Gentilly, France. ILOG Solver Reference Manual, Version 4.3.
Kilby, P., P. Prosser, and P. Shaw. (1997). “Guided Local Search for the Vehicle Routing Problem.” In Proceedings of the 2nd International Conference on Meta-heuristics.
Laporte, G. and I.H. Osman. (1995). “Routing Problems: A Bibliography.” Annals of Operations Research 61, 227–262.
Lin, S. (1965). “Computer Solutions of the Traveling Salesman Problem.” Bell Systems Technology Journal 44, 2245–2269.
Or, I. (1976). “Travelling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood-Banking.” Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwest University, Evanston, IL.
Osman, I.H. (1993). “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.” Annals of Operations Research 41, 421–451.
Pesant, G. and M. Gendreau. (1996). “A View of Local Search in Constraint Programming.” In E.C. Freuder (ed.), Second International Conference on Principles and Practice of Constraint Programming-CP96. Springer-Verlag, pp. 353–366.
Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). “An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows.” Transportation Science 32, 12–29.
Potvin, J.-Y. and S. Bengio. (1994). “A Genetic Approach to the Vehicle Routing Problem with Time Windows.” Technical Report CRT-953, Centre de Recherche sur les Transports, University of Montreal.
Potvin, J.-Y., T. Kervahut, B.-L. Garcia, and J.-M. Rousseau. (1993). “A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.” Technical Report CRT-855, Centre de Recherche sur les Transports. University of Montreal.
Rochat, Y. and E.D. Taillard. (1995). “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.” Journal of Heuristics 1(1), 147–167.
Savelsbergh, M.W.P. (1988). Amsterdam: Centrum voor Wiskunde en Informatica.
Savelsbergh, M.W.P. (1992). “The Vehicle Routing Problem with Time Windows: Minimizing Route Duration.” ORSA Journal on Computing 4(2), 146–154.
Shaw, P. (1998). “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.” In M. Maher and J.-F. Puget (eds.), Fourth International Conference on Principles and Practice of Constraint Programming-CP98, Springer-Verlag, pp. 417–431.
Solomon, M.M. (1987). “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints.” Operations Research 35, 254–265.
Taillard, E., P. Badeau, M. Gendreau, F. Guertain, and J.-Y. Potvin. (1997). “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.” Transportation Science 32(2).
Thangiah, S.R., I.H. Osman, and T. Sun. (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.
Tsang, E. and C. Voudouris. (1997). “Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem.” Operations Research Letters 20(3), 119–127.
Voudouris, C. (1997). “Guided Local Search for Combinatorial Problems.” Ph.D. Thesis, University of Essex, Colchester, UK.
Voudouris, C. and E. Tsang. (1995). “Function Optimization Using Guided Local Search.” Technical Report CSM-249, Department of Computer Science, University of Essex.
Voudouris, C. and E.P.K. Tsang. (1996). “Partial Constraint Satisfaction Problems and Guided Local Search.” In Proceedings of Practical Applications of Constraint Technology (PACT '96).
Voudouris, C. and E.P.K. Tsang. (1998). “Guided Local Search.” European Journal of Operational Research 113(2), 80–110.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Backer, B.D., Furnon, V., Shaw, P. et al. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics 6, 501–523 (2000). https://doi.org/10.1023/A:1009621410177
Issue Date:
DOI: https://doi.org/10.1023/A:1009621410177