Transforming Constraint Programs to Input for Local Search
Abstract
Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for some metaheuristic algorithm. In this paper, we establish a link between symmetry properties of constraint optimization problems and local search neighborhoods, and we use this link to automatically generate neighborhoods from a constraint specification in the context of the IDP system. We evaluate the obtained neighborhoods for six classical optimization problems. The resulting observations support the viability of this technique.
Cite
@article{arxiv.2605.19671,
title = {Transforming Constraint Programs to Input for Local Search},
author = {Jo Devriendt and Patrick De Causmaecker and Marc Denecker},
journal= {arXiv preprint arXiv:2605.19671},
year = {2026}
}
Comments
Unpublished paper accepted and presented at the Fourteenth International Workshop on Constraint Modelling and Reformulation (ModRef) in 2015