Abstract
Constraint Programming is a technique of choice for solving hard combinatorial optimization problems. However, it is best used in conjunction with other optimization paradigms such as local search, yielding hybrid algorithms with constraints. Such combinations lack a language supporting an elegant description and retaining the original declarativity of Constraint Logic Programming. We propose a language, SALSA, dedicated to specifying (local, global or hybrid) search algorithms. We illustrate its use on a few examples from combinatorial optimization for which we specify complex optimization procedures with a few simple lines of code of high abstraction level. We report preliminary experiments showing that such a language can be implemented on top of CP systems, yielding a powerful environment for combinatorial optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K.R. Apt, A. Schaerf, Search and Imperative Programming, Proc. of the 24th ACM Symposium on Principles of Programming Languages (POPL’97), ACM Press, 1997
Y. Caseau, F. Laburthe, Heuristics for Large Constrained Vehicle Routing Problems, submitted for publication, march 1998.
Y. Caseau, F. Laburthe, SaLSA: A Specification Language for Search Algorithms, LIENS 97-11, école Normale Supérieure, 1997.
M. Dell’Amico & M. Trubian. Applying Tabu-Search to the Job-Shop Scheduling Problem. Annals of Op. Research, 41, p. 231–252, 1993.
E. Demeulemeester, Optimal Algorithms for various classes of multiple resource constrained project scheduling problems, unpublished PhD. dissertation, Université Catholique de Louvain, Belgique, 1992.
R. Fourer, D. MacGay, B.W. Kernighan, AMPL: A Modelling Language for Mathematical Programming, Brook/Cole Publishing Company, 1993.
M. Gendreau, A. Hertz, G. Laporte. A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, 40, p. 1276–1290, 1994.
M. Hanus, F. Steiner, Controlling Search in Functional Logic Programs, technical report, RWTH Aachen, 1998.
W. Harvey, M. Ginsberg, Limited Discrepancy Search, Proceedings of the 14th IJCAI, p. 607–615, Morgan Kaufmann, 1995.
J. Jaffar, J.-L. Lassez, Constraint Logic Programming, Proceedings of the ACM symposium on Principles of Programming Languages, 1987.
S. Lin, B.W. Kernighan, An Effective Heuristic for the Traveling Salesman Problem. Operations Research 21, 1973.
J.W. Lloyd, Foundation of Logic Programming, Spinger, 1987.
D. Martin, P. Shmoys, A time-based approach to the Jobshop problem, Proc. of IPCO’5, M. Queyranne ed., LCNS 1084, Springer, 1996.
L. Michel, P. Van Hentenryck, Localizer: A Modeling Language for Local Search. Proc. of CP’97, LNCS 1330, Springer, 1997.
J.-M. Labat, L. Mynard, Oscillation, Heuristic Ordering and Pruning in Neighborhood Search. Proc. of CP’97, G. Smolka ed., LNCS 1330, Springer, 1997.
J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.
G. Pesant, M. Gendreau, A View of Local Search in Constraint Programming, proc. of CP’96, LNCS 1118, p. 353–366, Springer 1996.
G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau, An Exact Constraint Logic Programming Algorithm for the Travelling Salesman with Time Windows, to appear in Transportation Science, 1996.
R. Russell, Hybrid Heuristics for the Vehicle Routing Problem with Time Windows, Transportation Science, 29(2), may 1995.
C. Schulte, G. Smolka, Encapsulated Search for Higher-order Concurrent Constraint Programming, Proc. of ILPS’94, M. Bruynooghe ed., p. 505–520, MIT Press, 1994.
C. Schulte, Oz explorer: A Visual Constraint Programming Tool, Proc. 14th ICLP, L. Naish ed., p. 286–300, MIT Press, 1997.
B. Selman, H. Levesque, D. Mitchell, A New Method for Solving Hard Satisfiability Problems Proc. of AAAI-92, p. 440–446, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laburthe, F., Caseau, Y. (1998). Salsa: A Language for Search Algorithms. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive