摘要
针对交互式遗传算法中用户易疲劳问题,提出求同算子与求异算子,基于此给出搜索空间的划分及演化方法,提出基于满意域和禁忌域的交互式遗传算法,该方法可以引导遗传算法在不断缩小的空间中产生新个体,从而提高收敛速度,减少进化代数,达到减轻用户疲劳的目的.利用此方法进行服装设计的实验结果表明,该方法可以有效解决用户疲劳问题.
The concept of landscape of satisfaction and taboos are given aiming on the problem of user fatigue in interactive genetic algorithm(IGA). The common operator and distinct operator are proposed, and the methodology of search space partition and evolution is presented. The interactive genetic algorithm based on landscape of satisfaction and taboos is put forward. The algorithm can produce new individuals in continually shrinking space. Hence, the convergence is speeded, the evolution time is reduced and user fatigue is alleviated. The experimental results from fashion design show that this method is efficient.
出处
《中国矿业大学学报》
EI
CAS
CSCD
北大核心
2005年第2期204-208,共5页
Journal of China University of Mining & Technology
基金
国家自然科学基金项目(60304016)
关键词
交互式遗传算法
有效解
算子
收敛速度
搜索空间
代数
缩小
用户
问题
减轻
interactive genetic algorithm
landscape of satisfaction and taboos
gene unit of sense
common operator and distinct operator
