Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

On solving fuzzy constraint satisfaction problems with genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kowalczyk, R. ; CSIRO, Carlton, Vic., Australia

An attempt to solve fuzzy constraint satisfaction problems (FCSPs) with the use of genetic algorithms (GAs) is presented in the paper. A fuzzy relation that represents the degrees of satisfaction of fuzzy constraints in a given FCSP is considered as an objective function of the respective unconstrained optimization problem. A solution of a FCSP such that all constraints are satisfied to the maximal degree is searched for with a GA using the objective function to evaluate the prospective solutions with respect to fuzzy constraint satisfaction. The presented approach is illustrated with an example of a FCSP taking into account different levels of fuzzy granulation influencing GA's performance

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998