Abstract
We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the constraints of the problem and the actual search procedure. Each neighborhood exploration is performed by branch-and-bound search, whose potential pruning capabilities open the door to more elaborate local moves, which could lead to even better approximate results. Two illustrations of this framework are provided, including computational results for the traveling salesman problem with time windows. These results indicate that it is one order of magnitude faster than the customary constraint programming approach to local search and that it is competitive with a specialized local search algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aarts, E. and J.K. Lenstra. (1997). Local Search in Combinatorial Optimization. John Wiley & Sons.
Caseau, Y. and F. Laburthe. (1995). “Disjunctive Scheduling with Task Intevals.” Technical Report 95–25, Laboratoire d'informatique de l' École Normale Sup0érieure, Département de mathématiques et d'informatique, 45 rue d'Ulm, 75230 Paris Cedex 05, France.
Christodoulou, N., E. Stefanitsis, E. Kaltsas, and V. Assimakopoulos. (1994). “A Constraint Logic Programming Approach to the Vehicle-Flet Scheduling Problem.” Proceedings of Practical Applications of Prolog.
Dumas, Y., J. Desrosiers, É. Gélinas, and M.M. Solomon. (1995). “An Optimal Algorithm for the Traveling Salesman Problem with Time Windows,” Operations Research 43(2), 367–371.
Gendreau, M., A. Hertz, and G. Laporte. (1992). “NewInsertion and Postoptimization Procedures for the Traveling Salesman Problem,” Operations Research 40,1086–1094.
Gendreau, M., A. Hertz, G. Laporte, and M. Stan. (1995). “A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows,” Publication CRT-95-07, Centre de recherche sur les transports, Université de Montréal, Montréal.
Glover, F. (1977). “Heuristic for Integer Programming Using Surrogate Constraints,” Decision Sciences 8, 156–166.
Glover, F., Laguna, É. Taillard, and D. de Werra. (1993). “Tabu Search,” Annals of Operations Research 41.
Glover, F., É. Taillard, and D. deWerra. (1993). “A User's Guide to Tabu Search,” Annals of Operations Research 41, 3–28.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: The University of Michigan Press.
ILOG, S.A. (1995). 12, Avenue Raspail, BP7, 94251 Gentilly Cedex, France. ILOG SOLVER: Object-oriented constraint programming.
Kirkpatrick, S., D. Gelatt Jr., and M.P. Vecchi. (1983). “Optimization by Simulated Annealing,” Science 220, 671–680.
Lin, S. (1965). “Computer Solutions of the Traveling Salesman Problem,” Bell System Technical Journal 44, 2245–2269.
Lin, S. and B.W. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research 21, 498–516.
Minton, S., M.D. Johnston, A.B. Philips, and P. Laird. (1990). “Solving Large-Scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Method.” Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 17–24.
Or, I. (1976). “Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking.” Ph.D. Thesis, Northwestern 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.” Principles and Practice of Constraint Programming—CP96: Proceedings of the Second International Conference, Lecture Notes in Computer Science 1118. Berlin: Springer-Verlag, pp. 353–366.
Pesant, G., 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.
Pesant, G., M. Gendreau, and J.-M. Rousseau. (1997). “GENIUS-CP: A Generic Vehicle Routing Algorithm.” Principles and Practice of Constraint Programming—CP97: Proceedings of the Third International Conference, LNCS 1330. Springer-Verlag, pp. 420–434.
Potvin, J.-Y. and J.-M. Rousseau. (1995). “An Exchange Heuristic for Routing Problems with Time Windows,” Journal of the Operational Research Society 46(12):1433–1446.
Puget, J.-F. (1992). “Object-Oriented Constraint Programming for Transportation Problems.” Proceedings of Advanced Software Technology in Air Transport (ASTAIR).
Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Halsted Press.
Savelsbergh, M.W.P. (1985). “Local Search in Routing Problems with Time Windows,” Annals of Operations Research 4, 285–305.
Selman, B., H. Levesque, and D. Mitchell. (1992). “A New Method for Solving Hard Satisfiability Problems.” Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 440–446.
Solomon, M.M. (1987). “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints,” Operations Research 35, 254–265.
Taillard, É., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows,” Transportation Science 31, 170–186.
Wallace, M. (1996). “Practical Applications of Constraint Programming,” Constraints 1, 139–168.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pesant, G., Gendreau, M. A Constraint Programming Framework for Local Search Methods. Journal of Heuristics 5, 255–279 (1999). https://doi.org/10.1023/A:1009694016861
Issue Date:
DOI: https://doi.org/10.1023/A:1009694016861