检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王钟羡[1] 郭晨海[2] 刘军[2] 王良国[1]
机构地区:[1]南京理工大学理学院,江苏南京210094 [2]江苏大学汽车学院,江苏镇江212013
出 处:《南京理工大学学报》2004年第4期346-349,共4页Journal of Nanjing University of Science and Technology
摘 要:该文个体的基因采用实数编码 ,并利用罚函数法构造适应度。通过对种群中每个个体按适应度的大小排序 ,复制一部分优良个体 ,并让最优个体依次与种群中的其他较优个体进行交叉变异遗传计算 ,使遗传有目的地以每一代中的最优个体为核心展开 ,使运算可快速收敛到全局最优解。通过对典型结构的计算表明 ,该文方法简便 ,计算量小 ,能够迅速找到目标函数的全局最优解。Individual gene is coded with real number and penalty function method is used to structure the genetic fitness. After each individual in population is arranged in the order of its fitness, some better individuals are directly copied into offsprings and others are crossed and mutated with the optimum individual that is called ‘monkey-king’ into offsprings. Thus, genetic algorithms are orderly expanded by making optimum individual of every generation as kernel, it can be quickly converged to a whole optimum. Results from the calculation of several structures show the algorithms are effective for the whole optimal solution to target functions.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28