git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@485 331e1502-861f-0410-8da2-ba01fb791d7f

trunk/paradiseo-peo/tutorial/Walkthrough/src/exampleC.cpp

@@ -0,0 +1,120 @@
+// (c) OPAC Team, LIFL, July 2007
+//
+// Contact: paradiseo-help@lists.gforge.inria.fr
+
+#include "param.h"
+#include "route_init.h"
+#include "route_eval.h"
+
+#include "order_xover.h"
+#include "edge_xover.h"
+#include "partial_mapped_xover.h"
+#include "city_swap.h"
+#include "part_route_eval.h"
+#include "merge_route_eval.h"
+#include "two_opt_init.h"
+#include "two_opt_next.h"
+#include "two_opt_incr_eval.h"
+
+#include <paradiseo>
+
+#define POP_SIZE 10
+#define NUM_GEN 10
+#define CROSS_RATE 1.0
+#define MUT_RATE 0.01
+
+#define MIG_FREQ 2
+#define MIG_SIZE 5
+
+
+int main (int __argc, char * * __argv) {
+
+  peo :: init (__argc, __argv);
+
+  
+  loadParameters (__argc, __argv); /* Processing some parameters relative to the tackled
+				      problem (TSP) */
+
+  RouteInit route_init; /* Its builds random routes */  
+  RouteEval full_eval; /* Full route evaluator */
+
+  
+  OrderXover order_cross; /* Recombination */
+  CitySwap city_swap_mut;  /* Mutation */
+
+
+  /* Migration topology */
+  RingTopology topo;
+
+
+
+  // The First EA -------------------------------------------------------------------------------------
+  eoPop <Route> ox_pop (POP_SIZE, route_init);  /* Population */
+  
+  eoGenContinue <Route> ox_cont (NUM_GEN); /* A fixed number of iterations */  
+  eoCheckPoint <Route> ox_checkpoint (ox_cont); /* Checkpoint */
+  peoSeqPopEval <Route> ox_pop_eval (full_eval);  
+  eoStochTournamentSelect <Route> ox_select_one;
+  eoSelectNumber <Route> ox_select (ox_select_one, POP_SIZE);
+  eoSGATransform <Route> ox_transform (order_cross, CROSS_RATE, city_swap_mut, MUT_RATE);
+  peoSeqTransform <Route> ox_para_transform (ox_transform);    
+  eoEPReplacement <Route> ox_replace (2);
+
+  
+  /* The migration policy */
+  eoPeriodicContinue <Route> ox_mig_cont (MIG_FREQ); /* Migration occurs periodically */
+  eoRandomSelect <Route> ox_mig_select_one; /* Emigrants are randomly selected */
+  eoSelectNumber <Route> ox_mig_select (ox_mig_select_one, MIG_SIZE);
+  eoPlusReplacement <Route> ox_mig_replace; /* Immigrants replace the worse individuals */
+  
+  peoAsyncIslandMig <Route> ox_mig (ox_mig_cont, ox_mig_select, ox_mig_replace, topo, ox_pop, ox_pop);
+  ox_checkpoint.add (ox_mig);
+  
+  peoEA <Route> ox_ea (ox_checkpoint, ox_pop_eval, ox_select, ox_para_transform, ox_replace);
+  ox_mig.setOwner (ox_ea);
+  
+  ox_ea (ox_pop);   /* Application to the given population */
+  // --------------------------------------------------------------------------------------------------
+
+
+
+
+  // The Second EA ------------------------------------------------------------------------------------
+  eoPop <Route> ox_pop2 (POP_SIZE, route_init);  /* Population */
+
+  eoGenContinue <Route> ox_cont2 (NUM_GEN); /* A fixed number of iterations */
+  eoCheckPoint <Route> ox_checkpoint2 (ox_cont2); /* Checkpoint */
+  peoSeqPopEval <Route> ox_pop_eval2 (full_eval);
+  eoStochTournamentSelect <Route> ox_select_one2;
+  eoSelectNumber <Route> ox_select2 (ox_select_one2, POP_SIZE);
+  eoSGATransform <Route> ox_transform2 (order_cross, CROSS_RATE, city_swap_mut, MUT_RATE);
+  peoSeqTransform <Route> ox_para_transform2 (ox_transform2);
+  eoEPReplacement <Route> ox_replace2 (2);
+
+
+  /* The migration policy */
+  eoPeriodicContinue <Route> ox_mig_cont2 (MIG_FREQ); /* Migration occurs periodically */
+  eoRandomSelect <Route> ox_mig_select_one2; /* Emigrants are randomly selected */
+  eoSelectNumber <Route> ox_mig_select2 (ox_mig_select_one2, MIG_SIZE);
+  eoPlusReplacement <Route> ox_mig_replace2; /* Immigrants replace the worse individuals */
+
+  peoAsyncIslandMig <Route> ox_mig2 (ox_mig_cont2, ox_mig_select2, ox_mig_replace2, topo, ox_pop2, ox_pop2);
+  ox_checkpoint2.add (ox_mig2);
+
+  peoEA <Route> ox_ea2 (ox_checkpoint2, ox_pop_eval2, ox_select2, ox_para_transform2, ox_replace2);
+  ox_mig2.setOwner (ox_ea2);
+
+  ox_ea2 (ox_pop2);   /* Application to the given population */
+  // --------------------------------------------------------------------------------------------------
+
+
+
+  peo :: run ();
+  peo :: finalize (); /* Termination */
+  
+  
+  std::cout << ox_pop[ 0 ].fitness() << std::endl;
+
+    
+  return 0;
+}