Computers and Operations Research
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
Variable Neighborhood Decomposition Search
Journal of Heuristics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
On-line resources allocation for ATM networks with rerouting
Computers and Operations Research
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Solving constraint optimization problems in anytime contexts
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Weighted CSPs (Constraint Satisfaction Problems) are used to model and to solve constraint optimization problems using tree search or local search methods that use large neighborhoods. For the last ones, selecting the neighborhood to explore is crucial. Some heuristics defined for CSP, as ConflictVar, are based on conflicts. In this article, we propose new neighborhood heuristics for WCSP, not only based on conflicts, but also depending on the topology of the constraints graph and violation costs of constraints. Experiments performed with VNS/LDS+CP, a particular instance of VNS (Variable Neighborhood Search) we developed, show that our heuristics clearly outperform ConflictVar.