⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 firstbitea.html

📁 这是linux下的进化计算的源代码。 === === === === === === === === === === === ===== check latest news at http:
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!doctype html public "-//w3c//dtd html 4.0 transitional//en"><html><head>   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">   <meta name="GENERATOR" content="cpp2html Marc Schoenauer">   <title>FirstBitEA.cpp</title>   <!-- Changed by: Marc Schoenauer, 28-Nov-2000 --></head><body text="#000000" bgcolor="#C3C2B4" link="#0000EE" vlink="#551A8B" alink="#FF0000"><a href="eoLesson2.html">Back to Lesson 2</a> - <a href="eoTutorial.html">Tutorialmain page </a>- <a href="eoTopDown.html">Algorithm-Based</a> - <a href="eoBottomUp.html">Component-Basedpage</a> - <a href="eoProgramming.html">Programming hints</a> - <font face="Arial,Helvetica"><a href="../../doc/html/index.html">EOdocumentation</a></font><br><hr WIDTH="100%"><!-- -------------- End of header ------------------ --><!-- ----------------------------------------------- --><center><h1><font color="#FF0000">FirstBitEA.cpp</font></h1></center>Click on the figure to see the corresponding code.<br>In the code, the <a href="eoTutorial.html#colors">colors are meaningfull</a><br>The actual code is in boldface and the comment in normal face.<br><img SRC="EA_tutorial.jpg" USEMAP="#Map" ><map NAME="Map"><!-- Init --><area SHAPE="rect" HREF="#init" COORDS="14,31,135,70"><area SHAPE="rect" HREF="#eval" COORDS="14,110,135,150"><!-- main loop --><area SHAPE="rect" HREF="#representation" COORDS="170,110,295,150"><area SHAPE="rect" HREF="#output" COORDS="280,45,480,70"><area SHAPE="rect" HREF="#stop" COORDS="348,110,430,150"><area SHAPE="rect" HREF="#select" COORDS="495,110,615,150"><area SHAPE="rect" HREF="#representation" COORDS="495,190,615,230"><area SHAPE="rect" HREF="#crossover" COORDS="495,265,625,287"><area SHAPE="rect" HREF="#mutation" COORDS="495,287,625,305"><area SHAPE="rect" HREF="#representation" COORDS="240,270,465,310"><area SHAPE="rect" HREF="#eval" COORDS="170,270,295,310"><area SHAPE="rect" HREF="#replace" COORDS="170,190,295,230"><!-- Center of loop --><area SHAPE="rect" HREF="#generation" COORDS="310,160,485,260"><!-- 4 bottom lines --><area SHAPE="rect" HREF="#operators" COORDS="15,350,260,370"><area SHAPE="rect" HREF="#representation" COORDS="270,350,460,370"><area SHAPE="rect" HREF="#engine" COORDS="15,377,400,397"><area SHAPE="rect" HREF="#eval" COORDS="15,403,230,423"><area SHAPE="rect" HREF="#checkpoint" COORDS="15,430,221,450"><area SHAPE="rect" HREF="#stop" COORDS="221,430,345,450"><area SHAPE="rect" HREF="#stat" COORDS="375,430,445,450"><area SHAPE="rect" HREF="#parametres" COORDS="0,358,278,378"></map><br>&nbsp;<A NAME="start"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCC99" NOSAVE ><tr NOSAVE><td NOSAVE><tt><font color="#993300">//-----------------------------------------------------------------------------<br>// FirstBitEA.cpp<br>//-----------------------------------------------------------------------------<br>//*<br>// Still an instance of a VERY simple Bitstring Genetic Algorithm <br>// (see FirstBitGA.cpp) but now with  &nbsp;Breeder - and Combined Ops<br>//<br>//-----------------------------------------------------------------------------<br>// standard includes<br><b>#include &lt;stdexcept>  &nbsp;</b>// runtime_error <br><b>#include &lt;iostream>  &nbsp; &nbsp;</b>// cout<br><b>#include &lt;strstream>  &nbsp;</b>// ostrstream, istrstream<br>// the general include for eo<br><b>#include &lt;eo></b><br></font></tt></td></tr></table><a NAME="representation"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFFFCC" NOSAVE ><tr><td><tt><font color="#999900"><b>#include &lt;ga.h></b><br>//-----------------------------------------------------------------------------<br>// define your individuals<br><b>typedef eoBit&lt;double> Indi;	</b>// A bitstring with fitness double<br></font></tt></td></tr></table><a NAME="evalfunc"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCCC" NOSAVE ><tr><td><tt><font color="#CC0000">//-----------------------------------------------------------------------------<br>// a simple fitness function that computes the number of ones of a bitstring<br>// Now in a separate file, and declared as binary_value(const vector&lt;bool> &)<br><b>#include "binary_value.h"</b><br></font></tt></td></tr></table><a NAME="general"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCC99" NOSAVE ><tr><td><tt><font color="#993300">//-----------------------------------------------------------------------------<br><b>void main_function(int argc, char **argv)</b><br><b>{</b><br></font></tt></td></tr></table><a NAME="parametres"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#CCFFFF" NOSAVE ><tr><td><tt><font color="#3366FF"><b>  &nbsp;const unsigned int SEED = 42;	</b>// seed for random number generator<br><b>  &nbsp;const unsigned int T_SIZE = 3; </b>// size for tournament selection<br><b>  &nbsp;const unsigned int VEC_SIZE = 8; </b>// Number of bits in genotypes<br><b>  &nbsp;const unsigned int POP_SIZE = 20; </b>// Size of population<br><b>  &nbsp;const unsigned int MAX_GEN = 500; </b>// Maximum number of generation before STOP<br><b>  &nbsp;const float CROSS_RATE = 0.8;	</b>// Crossover rate<br><b>  &nbsp;const double P_MUT_PER_BIT = 0.01;	</b>// probability of bit-flip mutation<br><b>  &nbsp;const float MUT_RATE = 1.0;	</b>// mutation rate<br><b>  &nbsp;</b>// some parameters for chosing among different operators<br><b>  &nbsp;const double onePointRate = 0.5;  &nbsp; &nbsp; &nbsp; &nbsp;</b>// rate for 1-pt Xover<br><b>  &nbsp;const double twoPointsRate = 0.5;  &nbsp; &nbsp; &nbsp; &nbsp;</b>// rate for 2-pt Xover<br><b>  &nbsp;const double URate = 0.5;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</b>// rate for Uniform Xover<br><b>  &nbsp;const double bitFlipRate = 0.5;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</b>// rate for bit-flip mutation<br><b>  &nbsp;const double oneBitRate = 0.5;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</b>// rate for one-bit mutation<br></font></tt></td></tr></table><a NAME="general"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCC99" NOSAVE ><tr><td><tt><font color="#993300"><b>  &nbsp;</b>//////////////////////////<br><b>  &nbsp;</b>//  &nbsp;Random seed<br><b>  &nbsp;</b>//////////////////////////<br><b>  &nbsp;</b>//reproducible random seed: if you don't change SEED above, <br><b>  &nbsp;</b>// you'll aways get the same result, NOT a random run<br><b>  &nbsp;rng.reseed(SEED);</b><br></font></tt></td></tr></table><a NAME="eval"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCCC" NOSAVE ><tr><td><tt><font color="#CC0000"><b>  &nbsp;</b>/////////////////////////////<br><b>  &nbsp;</b>// Fitness function<br><b>  &nbsp;</b>////////////////////////////<br><b>  &nbsp;</b>// Evaluation: from a plain C++ fn to an EvalFunc Object<br><b>  &nbsp;</b>// you need to give the full description of the function<br><b>  &nbsp;eoEvalFuncPtr&lt;Indi, double, const vector&lt;bool>& > eval(  &nbsp;binary_value );</b><br></font></tt></td></tr></table><a NAME="init"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCFF" NOSAVE ><tr><td><tt><font color="#993399"><b>  &nbsp;</b>////////////////////////////////<br><b>  &nbsp;</b>// Initilisation of population<br><b>  &nbsp;</b>////////////////////////////////<br><b>  &nbsp;</b>// based on eoUniformGenerator class (see utils/eoRndGenerators.h)<br><b>  &nbsp;eoUniformGenerator&lt;bool> uGen;</b><br><b>  &nbsp;eoInitFixedLength&lt;Indi> random(VEC_SIZE, uGen);</b><br><b>  &nbsp;</b>// Initialization of the population<br><b>  &nbsp;eoPop&lt;Indi> pop(POP_SIZE, random);</b><br><b>  &nbsp;</b>// and evaluate it in one line<br><b>  &nbsp;apply&lt;Indi>(eval, pop);	</b>// STL syntax<br></font></tt></td></tr></table><a NAME="output"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#CCFFFF" NOSAVE ><tr><td><tt><font color="#3366FF"><b>  &nbsp;</b>// sort pop before printing it!<br><b>  &nbsp;pop.sort();</b><br><b>  &nbsp;</b>// Print (sorted) intial population (raw printout)<br><b>  &nbsp;cout &lt;&lt; "Initial Population" &lt;&lt; endl;</b><br><b>  &nbsp;cout &lt;&lt; pop;</b><br></font></tt>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -