A Tabu Search Method for Interval Constraints
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.
Unable to display preview. Download preview PDF.
- 2.Chelouah, R., Siarry, P.: Tabu search applied to global optimization. European Journal on Operational Research (2000)Google Scholar
- 4.Fanni, A., Manunza, A., Marchesi, M., Pilo, F.: Tabu search metaheuristics for electromagnetic problemsoptimization in continuous domains. IEEE Transactions on Magnetics 35(3) (1999)Google Scholar
- 5.Franze, F., Speciale, N.: A tabu-search-based algorithm for continuous multiminima problems. International Journal for Numerical Methods in Engineering 50(3) (2001)Google Scholar
- 7.Granvilliers, L., FrédéricBenhamou: Algorithm 852: RealPaver: An interval solver using constraint satisfaction techniques. ACM Transactions on Mathematical Software 32(1) (2006)Google Scholar