【24h】

On solving fuzzy constraint satisfaction problems with geneticalgorithms

机译:用遗传算法解决模糊约束满足问题算法

获取原文

摘要

An attempt to solve fuzzy constraint satisfaction problems (FCSPs)with the use of genetic algorithms (GAs) is presented in the paper. Afuzzy relation that represents the degrees of satisfaction of fuzzyconstraints in a given FCSP is considered as an objective function ofthe respective unconstrained optimization problem. A solution of a FCSPsuch that all constraints are satisfied to the maximal degree issearched for with a GA using the objective function to evaluate theprospective solutions with respect to fuzzy constraint satisfaction. Thepresented approach is illustrated with an example of a FCSP taking intoaccount different levels of fuzzy granulation influencing GA'sperformance
机译:解决模糊约束满足问题(FCSP)的尝试 本文介绍了使用遗传算法(GAs)的方法。一种 表示模糊满意度的模糊关系 给定FCSP中的约束被认为是 各自的无约束优化问题。 FCSP的解决方案 这样最大程度地满足所有约束是 使用目标函数通过GA搜索以评估 关于模糊约束满足的预期解决方案。这 提出的方法以FCSP的示例为例进行说明 解释影响GA的不同程度的模糊造粒 表现

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号