Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Fuzzy set theory—and its applications (3rd ed.)
Fuzzy set theory—and its applications (3rd ed.)
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Heuristics for Solving Fuzzy Constraint Satisfaction Problems
ANNES '95 Proceedings of the 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems
Extending GENET for Non-Binary Constraint Satisfaction Problems
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
Fuzzy Sets and Systems - Theme: Multicriteria decision
| Hi-index | 0.00 |
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when applied to real-life problems. With the incorporation of the concept of fuzziness, fuzzy constraint satisfaction problems (FCSP's) have been exploited. FCSP's model real-life problems better by allowing individual constraints to be either fully or partially satisfied. GENET, which has been shown to be efficient and effective in solving certain traditional CSP's, is extended to handle FCSP's. Through transforming FCSP's into 0 - 1 integer programming problems, we display the equivalence between the underlying working mechanism of fuzzy GENET and the discrete Lagrangian method. Simulator of fuzzy GENET for single-processor machines is implemented. Benchmarking results confirm its feasibility in tackling CSP's and flexibility in dealing with over-constrained problems.