yichuansuanfa.rar

  • PUDN用户
    了解作者
  • WORD
    开发工具
  • 23KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 3
    下载次数
  • 2009-11-27 11:06
    上传日期
遗传算法的基本原理和相关程序,很不错的,希望对你有帮助
yichuansuanfa.rar
  • yichuansuanfa
  • 遗传算法改进的模糊C.doc
    30.5KB
  • 遗传算法优化神经网络黑箱函数通用MATLAB源码.doc
    29.5KB
  • 用遗传算法优化BP神经网络的Matlab编程实例.doc
    30.5KB
  • 遗传算法解决车辆路径问题.doc
    62.5KB
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/622babc815da9b288b5c26c9/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/622babc815da9b288b5c26c9/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#36951;&#20256;&#31639;&#27861;&#35299;&#20915;&#36710;&#36742;&#36335;&#24452;&#38382;&#39064;&#65288;<span class="ff2">VRP</span>&#65289;<span class="ff2">(2007-08-29 1<span class="_ _0"></span>1:22:12)</span></div><div class="t m0 x2 h3 y3 ff1 fs0 fc0 sc0 ls0 ws0">&#26631;&#31614;&#65306;<span class="fc1">&#30693;&#35782;<span class="_ _1"></span><span class="ff3"> <span class="_ _2"> </span> <span class="ff2">/<span class="_ _3"></span><span class="ff3"> <span class="_ _4"></span> <span class="_ _0"></span><span class="ff1">&#25506;&#32034;<span class="_ _1"></span><span class="ff3"> <span class="_ _2"> </span> <span class="ff1 fc0">&#58902;<span class="ff2"> </span></span></span></span></span></span></span></span></div><div class="t m0 x1 h3 y4 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896;&#58896;&#58896;<span class="ff1">&#20851;<span class="_ _5"></span>&#20110;&#36951;<span class="_ _5"></span>&#20256;<span class="_ _5"></span>&#31639;&#27861;<span class="_ _5"></span>&#21338;<span class="_ _5"></span>&#23458;&#37324;<span class="_ _5"></span>&#24050;<span class="_ _5"></span>&#32463;&#24456;<span class="_ _5"></span>&#22810;&#20102;<span class="_ _5"></span>&#65292;<span class="_ _5"></span>&#36825;&#27425;<span class="_ _5"></span>&#36148;<span class="_ _5"></span>&#20010;<span class="_ _6"> </span></span>c<span class="_ _6"> </span><span class="ff1">&#30340;&#20195;&#30721;<span class="_ _5"></span>&#65292;<span class="_ _5"></span>&#19979;&#38754;<span class="_ _5"></span>&#30340;<span class="_ _5"></span>&#28304;&#20195;<span class="_ _5"></span>&#30721;<span class="_ _5"></span>&#26159;&#35299;<span class="_ _5"></span>&#20915;<span class="_ _5"></span>&#36710;&#36742;<span class="_ _5"></span>&#36335;&#24452;<span class="_ _5"></span>&#38382;</span></div><div class="t m0 x1 h3 y5 ff1 fs0 fc0 sc0 ls0 ws0">&#39064;&#30340;<span class="_ _5"></span>&#12290;&#35848;<span class="_ _5"></span>&#19968;&#28857;<span class="_ _5"></span>&#32463;&#39564;<span class="_ _5"></span>&#24615;&#30340;<span class="_ _5"></span>&#19996;&#35199;<span class="_ _5"></span>&#65292;&#23601;<span class="_ _5"></span>&#26159;&#22312;&#36827;<span class="_ _5"></span>&#34892;&#26579;<span class="_ _5"></span>&#33394;&#20307;<span class="_ _5"></span>&#20132;&#21449;<span class="_ _5"></span>&#26102;&#65292;<span class="_ _5"></span>&#19968;&#23450;<span class="_ _5"></span>&#35201;&#27880;<span class="_ _5"></span>&#24847;&#22522;<span class="_ _5"></span>&#22240;&#32467;<span class="_ _5"></span>&#26500;&#30340;<span class="_ _5"></span>&#38382;&#39064;<span class="_ _5"></span>&#12290;&#26681;</div><div class="t m0 x1 h3 y6 ff1 fs0 fc0 sc0 ls0 ws0">&#25454;&#20855;<span class="_ _5"></span>&#20307;&#24212;<span class="_ _5"></span>&#29992;&#24773;<span class="_ _5"></span>&#20917;&#65292;<span class="_ _5"></span>&#23613;&#37327;<span class="_ _5"></span>&#35201;&#20445;<span class="_ _5"></span>&#35777;&#22909;<span class="_ _5"></span>&#30340;&#22522;&#22240;<span class="_ _5"></span>&#32467;&#26500;<span class="_ _5"></span>&#36951;&#20256;<span class="_ _5"></span>&#21040;&#21518;<span class="_ _5"></span>&#20195;&#20013;<span class="_ _5"></span>&#12290;&#20854;<span class="_ _5"></span>&#23454;&#27492;<span class="_ _5"></span>&#26102;&#30340;<span class="_ _5"></span>&#20132;&#21449;<span class="_ _5"></span>&#21464;&#24322;<span class="_ _5"></span>&#31561;&#25152;<span class="_ _5"></span>&#26377;&#30340;</div><div class="t m0 x1 h3 y7 ff1 fs0 fc0 sc0 ls0 ws0">&#25805;&#20316;<span class="_ _5"></span>&#65292;&#32771;<span class="_ _5"></span>&#34385;&#30340;<span class="_ _5"></span>&#26159;&#22522;<span class="_ _5"></span>&#22240;&#32467;<span class="_ _5"></span>&#26500;&#65292;<span class="_ _5"></span>&#32780;&#19981;<span class="_ _5"></span>&#26159;&#21333;&#20010;<span class="_ _5"></span>&#30340;&#22522;<span class="_ _5"></span>&#22240;&#12290;<span class="_ _5"></span>&#25152;&#20197;<span class="_ _5"></span>&#22312;&#35774;<span class="_ _5"></span>&#35745;&#32534;<span class="_ _5"></span>&#30721;&#26041;<span class="_ _5"></span>&#24335;&#26102;<span class="_ _5"></span>&#23601;&#35201;<span class="_ _5"></span>&#32771;&#34385;<span class="_ _5"></span>&#21040;&#35774;<span class="_ _5"></span>&#35745;&#20986;</div><div class="t m0 x1 h3 y8 ff1 fs0 fc0 sc0 ls0 ws0">&#33391;&#22909;&#30340;&#22522;&#22240;&#32467;&#26500;&#12290;&#20415;&#20110;&#20998;&#21106;&#21644;&#32452;&#21512;&#30340;&#32467;&#26500;&#26159;&#22909;&#30340;&#35774;&#35745;&#12290;<span class="ff2"> </span></div><div class="t m0 x1 h3 y9 ff1 fs0 fc0 sc0 ls0 ws0">&#37096;&#20998;&#28304;&#31243;&#24207;&#65306;&#65288;<span class="ff2">http://blog.sina.com.cn/greensim</span>&#65289;</div><div class="t m0 x1 h3 ya ff2 fs0 fc0 sc0 ls0 ws0">/************************** <span class="ff1">&#26368;&#20248;&#21270;&#20989;&#25968;</span> ***************************/</div><div class="t m0 x1 h4 yb ff2 fs0 fc0 sc0 ls0 ws0">void GAOptim( float *vData, float vP<span class="_ _7"></span>, int vGenNum, int *pBestGen )</div><div class="t m0 x1 h4 yc ff2 fs0 fc0 sc0 ls0 ws0">{</div><div class="t m0 x1 h4 yd ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int vFlockSize = FLOCKSIZE ;</div><div class="t m0 x1 h4 ye ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int GENNUM = vGenNum ;</div><div class="t m0 x1 h4 yf ff2 fs0 fc0 sc0 ls0 ws0">&#58896; float P<span class="_ _0"></span> = vP<span class="_ _0"></span> ;</div><div class="t m0 x1 h4 y10 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int vLen = LEN ;</div><div class="t m0 x1 h4 y11 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int MotherFlock[FLOCKSIZE][LEN] ;</div><div class="t m0 x1 h4 y12 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int FatherFlock[FLOCKSIZE][LEN] ;</div><div class="t m0 x1 h4 y13 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int ChildFlock[2*FLOCKSIZE][LEN] ;</div><div class="t m0 x1 h4 y14 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int mBestGen[LEN] ;</div><div class="t m0 x1 h4 y15 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;</div><div class="t m0 x1 h4 y16 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int mCounter<span class="_ _0"></span>, mCounter1 ;</div><div class="t m0 x1 h4 y17 ff2 fs0 fc0 sc0 ls0 ws0">&#58896; int *pT<span class="_ _8"></span>emp1;</div><div class="t m0 x1 h4 y18 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;</div><div class="t m0 x1 h3 y19 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; //<span class="ff1">&#20135;&#29983;&#21021;&#22987;&#31181;&#32676;</span></div><div class="t m0 x1 h4 y1a ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; for( mCounter1 = 0 ; mCounter1&lt;FLOCKSIZE ; mCounter1++ )</div><div class="t m0 x1 h4 y1b ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; {</div><div class="t m0 x1 h4 y1c ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; &#58896;&#58896;&#58896;pT<span class="_ _8"></span>emp1 = MotherFlock[mCounter1] ;</div><div class="t m0 x1 h4 y1d ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; &#58896;&#58896;&#58896;PermutRnd( LEN , 1 , pT<span class="_ _8"></span>emp1 ) ;</div><div class="t m0 x1 h4 y1e ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; }</div><div class="t m0 x1 h4 y1f ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896;</div><div class="t m0 x1 h4 y20 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; for( mCounter1 = 0 ; mCounter1&lt;FLOCKSIZE ; mCounter1++ )</div><div class="t m0 x1 h4 y21 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; {</div><div class="t m0 x1 h4 y22 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; &#58896;&#58896;&#58896;pT<span class="_ _8"></span>emp1 = FatherFlock[mCounter1] ;</div><div class="t m0 x1 h4 y23 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; &#58896;&#58896;&#58896;PermutRnd( LEN , 1 , pT<span class="_ _8"></span>emp1 ) ;</div><div class="t m0 x1 h4 y24 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; }</div><div class="t m0 x1 h4 y25 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;</div><div class="t m0 x1 h3 y26 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; PermutRnd( LEN , 1 , mBestGen ) ; // <span class="ff1">&#21021;&#22987;&#21270;&#26368;&#20248;&#31181;&#32676;</span></div><div class="t m0 x1 h4 y27 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;</div><div class="t m0 x1 h4 y28 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; for( mCounter = 0 ; mCounter &lt; GENNUM ; mCounter++ )</div><div class="t m0 x1 h4 y29 ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; {</div><div class="t m0 x1 h4 y2a ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896;</div><div class="t m0 x1 h3 y2b ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; //<span class="ff1">&#20132;&#21449;</span></div><div class="t m0 x1 h4 y2c ff2 fs0 fc0 sc0 ls0 ws0">&#58896;&#58896; GenCross( MotherFlock,FatherFlock,ChildFlock,vData ) ;</div><div class="t m0 x1 h4 y2d ff2 fs0 fc0 sc0 ls0 ws0">&#58896;</div></div><a class="l" rel='nofollow' onclick='return false;'><div class="d m1"></div></a></div><div class="pi" data-data='{"ctm":[1.611850,0.000000,0.000000,1.611850,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐
    • 免疫遗传算法
      免疫遗传算法源代码,是对遗传算法和免疫算法的改进 免疫遗传算法源代码,是对遗传算法和免疫算法的改进 免疫遗传算法源代码,是对遗传算法和免疫算法的改进 免疫遗传算法源代码,是对遗传算法和免疫算法的改进
    • 配电网遗传算法
      配电网与遗传算法相结合,有电价等信息。。
    • 遗传算法
      遗传算法
    • 遗传算法 
      算法的基本理论及实力
    • 遗传算法PPT
      遗传算法(Genetic Algorithm)是一类借鉴生物界的进化规律(适者生存,优胜劣汰遗传机制)演化而来的随机化搜索方法1
    • 遗传算法的应用
      遗传算法(Genetic Algorithm)是一类借鉴生物界的进化规律(适者生存,优胜劣汰遗传机制)演化而来的随机化搜索方法
    • 遗传算法程序
      遗传算法是计算数学中用于解决最佳化的搜索算法,是进化算法的一种。进化算法最初是借鉴了进化生物学中的一些现象而发展起来的,这些现象包括遗传、突变、自然选择以及杂交等。遗传算法通常实现方式为一种计算机模拟...
    • 遗传算法
      合作者 马赫伯特(Herbert Ma)/ Yogesh Verma A01066502 / A01074571 状态-100%完成 等级-100%
    • 遗传算法 遗传算法 遗传算法 遗传算法
      遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗遗传算法……遗传算法……遗传算法……遗传算法……遗传算法……遗传...
    • 遗传算法
      遗传算法 埃斯特·塞拉·埃尔·莫多·德·康科塔诺斯·西古斯塔恩