369 lines
15 KiB
HTML
369 lines
15 KiB
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>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">Tutorial
|
|
main page </a>- <a href="eoTopDown.html">Algorithm-Based</a> - <a href="eoBottomUp.html">Component-Based
|
|
page</a> - <a href="eoProgramming.html">Programming hints</a> - <font face="Arial,Helvetica"><a href="../../doc/html/index.html">EO
|
|
documentation</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>
|
|
<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 Breeder - and Combined Ops<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 <ga.h></b><br>
|
|
//-----------------------------------------------------------------------------<br>
|
|
// define your individuals<br>
|
|
<b>typedef eoBit<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<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> const unsigned int SEED = 42; </b>// seed for random number generator<br>
|
|
<b> const unsigned int T_SIZE = 3; </b>// size for tournament selection<br>
|
|
<b> const unsigned int VEC_SIZE = 8; </b>// Number of bits in genotypes<br>
|
|
<b> const unsigned int POP_SIZE = 20; </b>// Size of population<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 P_MUT_PER_BIT = 0.01; </b>// probability of bit-flip mutation<br>
|
|
<b> const float MUT_RATE = 1.0; </b>// mutation rate<br>
|
|
<b> </b>// some parameters for chosing among different operators<br>
|
|
<b> const double onePointRate = 0.5; </b>// rate for 1-pt Xover<br>
|
|
<b> const double twoPointsRate = 0.5; </b>// rate for 2-pt Xover<br>
|
|
<b> const double URate = 0.5; </b>// rate for Uniform Xover<br>
|
|
<b> const double bitFlipRate = 0.5; </b>// rate for bit-flip mutation<br>
|
|
<b> const double oneBitRate = 0.5; </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> </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> </b>// you need to give the full description of the function<br>
|
|
<b> eoEvalFuncPtr<Indi, double, const vector<bool>& > eval( 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> </b>////////////////////////////////<br>
|
|
<b> </b>// Initilisation of population<br>
|
|
<b> </b>////////////////////////////////<br>
|
|
<b> </b>// based on eoUniformGenerator class (see utils/eoRndGenerators.h)<br>
|
|
<b> eoUniformGenerator<bool> uGen;</b><br>
|
|
<b> eoInitFixedLength<Indi> random(VEC_SIZE, uGen);</b><br>
|
|
<b> </b>// Initialization of the population<br>
|
|
<b> eoPop<Indi> pop(POP_SIZE, random);</b><br>
|
|
<b> </b>// and evaluate it in one line<br>
|
|
<b> apply<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> </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> selectOne(T_SIZE); </b>// T_SIZE in [2,POP_SIZE]<br>
|
|
<a NAME="select_encapsulate"></a>
|
|
<b> </b>// is now encapsulated in a eoSelectPerc (entage)<br>
|
|
<b> eoSelectPerc<Indi> select(selectOne);</b>// by default rate==1<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>// And we now have the full slection/replacement - though with <br>
|
|
<b> </b>// no replacement (== generational replacement) at the moment :-)<br>
|
|
<b> eoNoReplacement<Indi> replace; </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="crossover"></a><table BORDER=0 CELLSPACING=0 COLS=1 WIDTH="100%" BGCOLOR="#FFCCFF" NOSAVE >
|
|
<tr>
|
|
<td>
|
|
<tt><font color="#993399">
|
|
<b> </b>// 1-point crossover for bitstring<br>
|
|
<b> eo1PtBitXover<Indi> xover1;</b><br>
|
|
<b> </b>// uniform crossover for bitstring<br>
|
|
<b> eoUBitXover<Indi> xoverU;</b><br>
|
|
<b> </b>// 2-pots xover<br>
|
|
<b> eoNPtsBitXover<Indi> xover2(2);</b><br>
|
|
<b> </b>// Combine them with relative rates<br>
|
|
<b> eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);</b><br>
|
|
<b> xover.add(xoverU, URate);</b><br>
|
|
<b> xover.add(xover2, twoPointsRate, true);</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><br>
|
|
<b> </b>// standard bit-flip mutation for bitstring<br>
|
|
<b> eoBitMutation<Indi> mutationBitFlip(P_MUT_PER_BIT);</b><br>
|
|
<b> </b>// mutate exactly 1 bit per individual<br>
|
|
<b> eoDetBitFlip<Indi> mutationOneBit; </b><br>
|
|
<b> </b>// Combine them with relative rates<br>
|
|
<b> eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);</b><br>
|
|
<b> mutation.add(mutationOneBit, oneBitRate, true);</b><br>
|
|
<b> </b><br>
|
|
<a NAME="transform"></a>
|
|
<b> </b>// The operators are encapsulated into an eoTRansform object<br>
|
|
<b> eoSGATransform<Indi> transform(xover, CROSS_RATE, mutation, MUT_RATE);</b><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 conditions: use more than one<br>
|
|
<b> </b>/////////////////////////////////////<br>
|
|
<b> </b>// stop after MAX_GEN generations<br>
|
|
<b> eoGenContinue<Indi> genCont(MAX_GEN);</b><br>
|
|
<b> </b>// do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement<br>
|
|
<b> eoSteadyFitContinue<Indi> steadyCont(MIN_GEN, STEADY_GEN);</b><br>
|
|
<b> </b>// stop when fitness reaches a target (here VEC_SIZE)<br>
|
|
<b> eoFitContinue<Indi> fitCont(0);</b><br>
|
|
<b> </b>// do stop when one of the above says so<br>
|
|
<b> eoCombinedContinue<Indi> continuator(genCont);</b><br>
|
|
<b> continuator.add(steadyCont);</b><br>
|
|
<b> continuator.add(fitCont);</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>// Easy EA requires <br>
|
|
<b> </b>// selection, transformation, eval, replacement, and stopping criterion<br>
|
|
<b> eoEasyEA<Indi> gga(continuator, eval, select, transform, replace);</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="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="general"></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="eoLesson2.html">Back to Lesson 2</a> - <a href="eoTutorial.html">Tutorial
|
|
main page </a>- <a href="eoTopDown.html">Algorithm-Based</a> - <a href="eoBottomUp.html">Component-Based
|
|
page</a> - <a href="eoProgramming.html">Programming hints</a> - <font face="Arial,Helvetica"><a href="../../doc/html/index.html">EO
|
|
documentation</a></font>
|
|
<hr>
|
|
<address>
|
|
<a href="mailto:Marc.Schoenauer@inria.fr">Marc Schoenauer</a></address>
|
|
<br><!-- Created: Nov 2000 --><!-- hhmts start -->Last
|
|
modified: Sun Nov 19 22:26:27 2000
|
|
<!-- hhmts end -->
|
|
</body>
|
|
</html>
|