论文信息 - A comparison of adaptive virtual constraint identification strategies for recurrent dynamic constraint satisfaction

A comparison of adaptive virtual constraint identification strategies for recurrent dynamic constraint satisfaction

In this paper, we compare four strategies designed to improve the search efficiency for solving recurrent dynamic constraint satisfaction problems. These strategies work by identifying and maintaining a set of virtual constraints based on their overall satisfiability. Of the four strategies, the co-adaptive method is superior.

Gerry Dozier

[1] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[2] Gerry Dozier. Evolutionary hill-climbing, virtual constraints, and recurrent dynamic CSPs , 2001 .

[3] Eugene C. Freuder,et al. Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.

[4] James Bowen,et al. Lexical Imprecision in Fuzzy Constraint Networks , 1992, AAAI.

[5] James Bowen,et al. Solving constraint satisfaction problems using hybrid evolutionary search , 1998, IEEE Trans. Evol. Comput..

[6] James Bowen,et al. Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7] Christian Bessiere. Arc-Consistency for Non-Binary Dynamic CSPs , 1992, ECAI.

[8] Bernard A. Nadel,et al. Constraint satisfaction algorithms 1 , 1989, Comput. Intell..