会议专题

Research On Genetic Operators In Binary-Tree-Encoded Individuals Pool

Construction of a continuous expression for fitting some discrete dots based on the combination of elementary functions is difficult today.This paper discusses a genetic algorithm framework to solve this problem,in which individuals are encoded in binarytrees.Two construction methods of fitness functions are proposed,one aims at only fitting the given discrete dots,while another aims at suppressing excessive fluctations of the expression curves.In crossover,an algorithm is proposed based on that new cmromosomes should not be worse than their parents,in which the key factor can be theoretically caculated.In the end,we discuss the pruning problem and present a simple pruning method,in which an built-in GA is suggested to search an optimal combination of operators.

curve fitting genetic algorithmt pruning binary-tree

WANG Jiefa TIAN Xiqun

Institute of Management Engineering Xian University of Finance and Economics Xian,China

国际会议

2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

太原

英文

557-560

2011-02-26(万方平台首次上网日期,不代表论文的发表时间)