Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Hangzhou Dianzi University》 2007-02
Add to Favorite Get Latest Update

The Realization of Random Assorting Algorithm and the Comparing with General Genetic Algorithm

YUAN Bao-lan1,ZHANG Wan-jun2,ZHANG Zhi-feng1(1.School of Science,Hangzhou Dianzi University,Hangzhou,Zhejiang 310018,China;2.Vocational School of Software Technology,Hangzhou Danzi University,Hangzhou Zhejiang 310037,China)  
Uses the simple point in view of general genetic algorithm in crossover and mutation operator insufficiency,introduces random assorting recombination of cluster in the DM,used the random assorting recombination genetic operator and has realized its algorithm,and the simple simulation two algorithms,the computed result indicated the improvement operator the genetic algorithm had a more obvious improvement.
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved