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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Truchet, C., Christie, M., & Normand, J. M. (2008). A tabu search method for interval constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 372–376). https://doi.org/10.1007/978-3-540-68155-7_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
