Abstract
This article presents an extension of the Tabu Search (TS) metaheuristic to continuous CSPs, where the domains are represented by floating point-bounded intervals. This leads to redefine the usual TS operators to take into account the special features of interval constraints: real variables encoded in floating points domains, high cardinality of the domains, nature of the CSP where constraints may be partially satisfied. To illustrate the expressiveness of the framework, we instantiate this method to compute an inner-approximation of a set of inequalities.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barichard, V., Hao, J.-K.: A Population and Interval Constraint Propagation Algorithm. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 88–101. Springer, Heidelberg (2003)
Chelouah, R., Siarry, P.: Tabu search applied to global optimization. European Journal on Operational Research (2000)
Cruz, J.: Constraint Reasoning for Differential Models. IOS Press, Amsterdam (2005)
Fanni, A., Manunza, A., Marchesi, M., Pilo, F.: Tabu search metaheuristics for electromagnetic problemsoptimization in continuous domains. IEEE Transactions on Magnetics 35(3) (1999)
Franze, F., Speciale, N.: A tabu-search-based algorithm for continuous multiminima problems. International Journal for Numerical Methods in Engineering 50(3) (2001)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht, The Netherlands (1997)
Granvilliers, L., FrédéricBenhamou: Algorithm 852: RealPaver: An interval solver using constraint satisfaction techniques. ACM Transactions on Mathematical Software 32(1) (2006)
Hansen, E.R.: Global Optimization Using Interval Analysis. Pure and Applied Mathematics. Marcel Dekker Inc, New York (1992)
Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Truchet, C., Christie, M., Normand, JM. (2008). A Tabu Search Method for Interval Constraints. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-68155-7_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68154-0
Online ISBN: 978-3-540-68155-7
eBook Packages: Computer ScienceComputer Science (R0)