Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints

Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally expensive. Local search quickly provides supports for many variable-value pairs, thus reducing the effort required to check and potentially filter the rest of them. The idea is demonstrated on the SomeDifferent constraint, a graph coloring substructure. An experimental evaluation confirms its significant computational gain in many cases.

• Type: Conference
• Year: 2008
• Where: CPAIOR
• Authors: Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
• Keywords: Computationally Expensive, CPAIOR 2008, Graph Coloring Substructure, Local Search, Operations Research