New hybrid method for solving constraint optimization problems in anytime contexts

This paper describes a new hybrid method for solving constraint optimization problems in anytime contexts. We use the valued constraint satisfaction problem (VCSP) framework to model numerous discrete optimization problems. Our method (VNS/LDS+CP) combines a variable neighborhood search (VNS) scheme with limited discrepancy search (LDS) using constraint propagation (CP) to evaluate cost and legality of moves made by VNS. Experiments on real-word problem instances demonstrate that our method clearly outperforms both LNS/CP/GR and other standard local search methods as simulated annealing.

[1]  Patrice Boizumault,et al.  Resource allocation in a mobile telephone network: A constructive repair algorithm , 2001, RAIRO Oper. Res..

[2]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[3]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[4]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[5]  Mark S. Boddy,et al.  Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..

[6]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[7]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[8]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[9]  Simon de Givry.  Algorithmes d'optimisation sous contraintes étudiés dans un cadre temps réel , 1998 .

[10]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[11]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[12]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[13]  Javier Larrosa,et al.  Exploiting the Use of DAC in MAX-CSP , 1996, CP.

[14]  François Laburthe,et al.  CLAIRE: combining sets, search and rules to better express algorithms , 1999, Theory and Practice of Logic Programming.

[15]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[16]  Christos Voudouris.  Solving the Radio Link Frequency Assignment Problem using Guided Local Search , 2001 .

[17]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[18]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[19]  Simon de Givry,et al.  Anytime Lower Bounds for Constraint Violation Minimization Problems , 1998, CP.

[20]  Thomas Schiex,et al.  Reversible DAC and Other Improvements for Solving Max-CSP , 1998, AAAI/IAAI.