📄 firstrealga.html
字号:
<!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>FirstRealGA.html</title> <!-- Changed by: Marc Schoenauer, 29-Nov-2000 --></head><body text="#000000" bgcolor="#C3C2B4" link="#0000EE" vlink="#551A8B" alink="#FF0000"><a href="eoLesson1.html">Back to Lesson 1</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">Code for FirstRealGA</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> <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>// FirstRealGA.cpp<br>//-----------------------------------------------------------------------------<br>//*<br>// An instance of a VERY simple Real-coded Genetic Algorithm<br>//<br>//-----------------------------------------------------------------------------<br>// standard includes<br><b>#include <stdexcept> </b>// runtime_error <br><b>#include <iostream> </b>// cout<br><b>#include <strstream> </b>// ostrstream, istrstream<br>// the general include for eo<br><b>#include <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 <es.h></b><br>//-----------------------------------------------------------------------------<br>// define your individuals<br><b> typedef eoReal<double> Indi;</b><br></font></tt></td></tr></table><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 euclidian norm of a real vector<br>// @param _indi A real-valued individual <br><a name="evalfunc"></a><b>double real_value(const Indi & _indi)</b><br><b>{</b><br><b> double sum = 0;</b><br><b> for (unsigned i = 0; i < _indi.size(); i++)</b><br><b> sum += _indi[i]*_indi[i];</b><br><b> return (-sum); </b>// maximizing only<br><b>}</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> </b>// all parameters are hard-coded!<br><b> const unsigned int SEED = 42; </b>// seed for random number generator<br><b> const unsigned int VEC_SIZE = 8; </b>// Number of object variables in genotypes<br><b> const unsigned int POP_SIZE = 20; </b>// Size of population<br><b> const unsigned int T_SIZE = 3; </b>// size for tournament selection<br><b> const unsigned int MAX_GEN = 500; </b>// Maximum number of generation before STOP<br><b> const float CROSS_RATE = 0.8; </b>// Crossover rate<br><b> const double EPSILON = 0.01; </b>// range for real uniform mutation<br><b> const float MUT_RATE = 0.5; </b>// mutation rate<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"><a NAME="random"></a><b> </b>//////////////////////////<br><b> </b>// Random seed<br><b> </b>//////////////////////////<br><b> </b>//reproducible random seed: if you don't change SEED above, <br><b> </b>// you'll aways get the same result, NOT a random run<br><b> 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> </b>/////////////////////////////<br><b> </b>// Fitness function<br><b> </b>////////////////////////////<br><b> </b>// Evaluation: from a plain C++ fn to an EvalFunc Object<br><b> eoEvalFuncPtr<Indi> eval( real_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> </b>////////////////////////////////<br><b> </b>// Initilisation of population<br><b> </b>////////////////////////////////<br><b> </b>// declare the population<br><b> eoPop<Indi> pop;</b><br><b> </b>// fill it!<br><b> for (unsigned int igeno=0; igeno<POP_SIZE; igeno++)</b><br><b> {</b><br><b> Indi v; </b>// void individual, to be filled<br><b> for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)</b><br><b> {</b><br><b> double r = 2*rng.uniform() - 1; </b>// new value, random in [-1,1)<br><b> v.push_back(r); </b>// append that random value to v<br><b> }</b><br><b> eval(v); </b>// evaluate it<br><b> pop.push_back(v); </b>// and put it in the population<br><b> }</b><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> </b>// sort pop before printing it!<br><b> pop.sort();</b><br><b> </b>// Print (sorted) intial population (raw printout)<br><b> cout << "Initial Population" << endl;</b><br><b> cout << pop;</b><br></font></tt></td></tr></table><a NAME="engine"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#99FFCC" NOSAVE ><tr><td><tt><font color="#009900"><b> </b>/////////////////////////////////////<br><b> </b>// selection and replacement<br><b> </b>////////////////////////////////////<br></font></tt></td></tr></table><a NAME="select"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#99FFCC" NOSAVE ><tr><td><tt><font color="#009900"><b> </b>// The robust tournament selection<br><b> eoDetTournamentSelect<Indi> select(T_SIZE); </b>// T_SIZE in [2,POP_SIZE]<br></font></tt></td></tr></table><a NAME="replace"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#99FFCC" NOSAVE ><tr><td><tt><font color="#009900"><b> </b>// eoSGA uses generational replacement by default<br><b> </b>// so no replacement procedure has to be given<br></font></tt></td></tr></table><a NAME="stop"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#CCFFFF" NOSAVE ><tr><td><tt><font color="#3366FF"></font></tt></td></tr></table><a NAME="checkpoint"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#CCFFFF" NOSAVE ><tr><td><tt><font color="#3366FF"><b> </b>//////////////////////////////////////<br><b> </b>// termination condition<br><b> </b>/////////////////////////////////////<br><b> </b>// stop after MAX_GEN generations<br><b> eoGenContinue<Indi> continuator(MAX_GEN);</b><br><b> </b><br></font></tt></td></tr></table><a NAME="operators"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCFF" NOSAVE ><tr><td><tt><font color="#993399"><b> </b>//////////////////////////////////////<br><b> </b>// The variation operators<br><b> </b>//////////////////////////////////////<br></font></tt></td></tr></table><a NAME="mutation"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCFF" NOSAVE ><tr><td><tt><font color="#993399"><b> </b>// offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]<br><b> eoUniformMutation<Indi> mutation(EPSILON); </b><br></font></tt></td></tr></table><a NAME="crossover"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCFF" NOSAVE ><tr><td><tt><font color="#993399"><b> </b>// offspring(i) is a linear combination of parent(i)<br><b> eoSegmentCrossover<Indi> xover;</b><br></font></tt></td></tr></table><a NAME="generation"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCC99" NOSAVE ><tr><td><tt><font color="#FF6666"><b> </b>/////////////////////////////////////////<br><b> </b>// the algorithm<br><b> </b>////////////////////////////////////////<br><b> </b>// standard Generational GA requires<br><b> </b>// selection, evaluation, crossover and mutation, stopping criterion<br><b> </b><br><b> eoSGA<Indi> gga(select, xover, CROSS_RATE, mutation, MUT_RATE, </b><br><b> eval, continuator);</b><br><b> </b>// Apply algo to pop - that's it!<br><b> gga(pop);</b><br><b> </b><br></font></tt></td></tr></table><a NAME="final_output"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#CCFFFF" NOSAVE ><tr><td><tt><font color="#3366FF"><b> </b>// Print (sorted) intial population<br><b> pop.sort();</b><br><b> cout << "FINAL Population\n" << pop << endl;</b><br></font></tt></td></tr></table><a NAME="main"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCC99" NOSAVE ><tr><td><tt><font color="#993300"><b>}</b><br>// A main that catches the exceptions<br><b>int main(int argc, char **argv)</b><br><b>{</b><br><b>#ifdef _MSC_VER</b><br><b> </b>// rng.reseed(42);<br><b> int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);</b><br><b> flag |= _CRTDBG_LEAK_CHECK_DF;</b><br><b> _CrtSetDbgFlag(flag);</b><br>// _CrtSetBreakAlloc(100);<br><b>#endif</b><br><b> try</b><br><b> {</b><br><b> main_function(argc, argv);</b><br><b> }</b><br><b> catch(exception& e)</b><br><b> {</b><br><b> cout << "Exception: " << e.what() << '\n';</b><br><b> }</b><br><b> return 1;</b><br><b>}</b><br></font></font></font></td></tr></table><hr WIDTH="100%"><a href="eoLesson1.html">Back to Lesson 1</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><hr><address><a href="mailto:Marc.Schoenauer@inria.fr">Marc Schoenauer</a></address><br><!-- Created: Nov 2000 --><!-- hhmts start -->Lastmodified: Sun Nov 19 08:31:29 2000<!-- hhmts end --></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -