【作者】 郝国生； 巩敦卫； 史有群； 张勇； 刘太湖；

【Author】 Hao Guosheng Gong Dunwei Shi Youqun Zhang Yong Liu Taihu(College of Infonnation and Electrical Engineering, China University of Mining and Technology, Xuzhou 221008, China) (College of Technology, Xuzhou Normal University, Xuzhou 221011, China)

【机构】 中国矿业大学信息与电气工程学院；

【摘要】 运用选择、投影、广义笛卡尔积等关系代数运算,给出了遗传算法的搜索空间及个体、遗传算子和搜索最优解过程等关系代数形式的描述,建立了遗传算法的关系代数模型,给出了遗传算法的数学解释.然后,给出建立遗传算法关系代数模型的意义,说明了数据挖掘和知识发现应用于遗传算法的可行性.最后,用该模型描述了2个常见用遗传算法解决的问题,即TSP问题和交互式遗传算法中的服装设计问题,结果表明该模型的可行性.更多还原

【Abstract】 The search space, individuals, genetic operators and the process of searching optima in genetic algorithm are formally described by relation algebra operators such as selection, projection, and generalized Cartesian product. The relation algebra based genetic algorithm model is established, which serves as the explanation of genetic algorithm. Then the significance is presented which provides the feasibility of application of data-mining and knowledge-discovering to genetic algorithm. At last, the model is applied to the description of two problems solved by genetic algorithm, i.e., travelling salesman problem (TSP) and fashion design problem in interactive genetic algorithm (IGA). The result indicates its feasibility.更多还原