Automated Neighborhood Generation from Constraint Programs for Local Search
A new technique automatically generates local search neighborhoods from constraint specifications, linking symmetry properties of constraint optimization problems to local search neighborhoods. The method is implemented in the IDP system and tested on six classical optimization problems, showing viability. This reduces the need for human intervention in compiling constraints for metaheuristic algorithms.
Key facts
- Local search algorithms require human intervention to compile constraints for metaheuristics.
- The paper establishes a link between symmetry properties of constraint optimization problems and local search neighborhoods.
- Neighborhoods are automatically generated from constraint specifications in the IDP system.
- The technique was evaluated on six classical optimization problems.
- Results support the viability of the method.
Entities
Institutions
- IDP system