- Main Page
- Namespaces
- Classes
- Files

- Search for |

# exampleC.cpp

    00001 /*
    00002 * <exampleC.cpp>
    00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
    00004 * (C) OPAC Team, LIFL, 2002-2007
    00005 *
    00006 * Sebastien Cahon, Alexandru-Adrian Tantar
    00007 *
    00008 * This software is governed by the CeCILL license under French law and
    00009 * abiding by the rules of distribution of free software.  You can  use,
    00010 * modify and/ or redistribute the software under the terms of the CeCILL
    00011 * license as circulated by CEA, CNRS and INRIA at the following URL
    00012 * "http://www.cecill.info".
    00013 *
    00014 * As a counterpart to the access to the source code and  rights to copy,
    00015 * modify and redistribute granted by the license, users are provided only
    00016 * with a limited warranty  and the software's author,  the holder of the
    00017 * economic rights,  and the successive licensors  have only  limited liability.
    00018 *
    00019 * In this respect, the user's attention is drawn to the risks associated
    00020 * with loading,  using,  modifying and/or developing or reproducing the
    00021 * software by the user in light of its specific status of free software,
    00022 * that may mean  that it is complicated to manipulate,  and  that  also
    00023 * therefore means  that it is reserved for developers  and  experienced
    00024 * professionals having in-depth computer knowledge. Users are therefore
    00025 * encouraged to load and test the software's suitability as regards their
    00026 * requirements in conditions enabling the security of their systems and/or
    00027 * data to be ensured and,  more generally, to use and operate it in the
    00028 * same conditions as regards security.
    00029 * The fact that you are presently reading this means that you have had
    00030 * knowledge of the CeCILL license and that you accept its terms.
    00031 *
    00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
    00033 * Contact: paradiseo-help@lists.gforge.inria.fr
    00034 *
    00035 */
    00036 // (c) OPAC Team, LIFL, July 2007
    00037 //
    00038 // Contact: paradiseo-help@lists.gforge.inria.fr
    00039
    00040 #include "param.h"
    00041 #include "route_init.h"
    00042 #include "route_eval.h"
    00043
    00044 #include "order_xover.h"
    00045 #include "edge_xover.h"
    00046 #include "partial_mapped_xover.h"
    00047 #include "city_swap.h"
    00048 #include "part_route_eval.h"
    00049 #include "merge_route_eval.h"
    00050 #include "two_opt_init.h"
    00051 #include "two_opt_next.h"
    00052 #include "two_opt_incr_eval.h"
    00053
    00054 #include <peo>
    00055
    00056 #define POP_SIZE 10
    00057 #define NUM_GEN 10
    00058 #define CROSS_RATE 1.0
    00059 #define MUT_RATE 0.01
    00060
    00061 #define MIG_FREQ 1
    00062 #define MIG_SIZE 5
    00063
    00064
    00065 int main (int __argc, char * * __argv) {
    00066
    00067   peo :: init (__argc, __argv);
    00068
    00069
    00070   loadParameters (__argc, __argv); /* Processing some parameters relative to the tackled
    00071                                       problem (TSP) */
    00072
    00073   /* Migration topology */
    00074   RingTopology topo;
    00075
    00076
    00077
    00078   // The First EA -------------------------------------------------------------------------------------
    00079
    00080   RouteInit route_init; /* Its builds random routes */
    00081   RouteEval full_eval; /* Full route evaluator */
    00082
    00083   OrderXover order_cross; /* Recombination */
    00084   CitySwap city_swap_mut;  /* Mutation */
    00085
    00086   eoPop <Route> ox_pop (POP_SIZE, route_init);  /* Population */
    00087
    00088   eoGenContinue <Route> ox_cont (NUM_GEN); /* A fixed number of iterations */
    00089   eoCheckPoint <Route> ox_checkpoint (ox_cont); /* Checkpoint */
    00090   peoSeqPopEval <Route> ox_pop_eval (full_eval);
    00091   eoStochTournamentSelect <Route> ox_select_one;
    00092   eoSelectNumber <Route> ox_select (ox_select_one, POP_SIZE);
    00093   eoSGATransform <Route> ox_transform (order_cross, CROSS_RATE, city_swap_mut, MUT_RATE);
    00094   peoSeqTransform <Route> ox_seq_transform (ox_transform);
    00095   eoEPReplacement <Route> ox_replace (2);
    00096
    00097
    00098   /* The migration policy */
    00099   eoPeriodicContinue <Route> ox_mig_cont (MIG_FREQ); /* Migration occurs periodically */
    00100   eoStochTournamentSelect <Route> ox_mig_select_one; /* Emigrants are randomly selected */
    00101   eoSelectNumber <Route> ox_mig_select (ox_mig_select_one, MIG_SIZE);
    00102   eoPlusReplacement <Route> ox_mig_replace; /* Immigrants replace the worse individuals */
    00103
    00104   peoAsyncIslandMig <Route> ox_mig (ox_mig_cont, ox_mig_select, ox_mig_replace, topo, ox_pop, ox_pop);
    00105   ox_checkpoint.add (ox_mig);
    00106
    00107   peoEA <Route> ox_ea (ox_checkpoint, ox_pop_eval, ox_select, ox_seq_transform, ox_replace);
    00108   ox_mig.setOwner (ox_ea);
    00109
    00110   ox_ea (ox_pop);   /* Application to the given population */
    00111   // --------------------------------------------------------------------------------------------------
    00112
    00113
    00114
    00115   // The Second EA ------------------------------------------------------------------------------------
    00116
    00117   RouteInit route_init2; /* Its builds random routes */
    00118   RouteEval full_eval2; /* Full route evaluator */
    00119
    00120   OrderXover order_cross2; /* Recombination */
    00121   CitySwap city_swap_mut2;  /* Mutation */
    00122
    00123
    00124   eoPop <Route> ox_pop2 (POP_SIZE, route_init2);  /* Population */
    00125
    00126
    00127   eoGenContinue <Route> ox_cont2 (NUM_GEN); /* A fixed number of iterations */
    00128   eoCheckPoint <Route> ox_checkpoint2 (ox_cont2); /* Checkpoint */
    00129   peoSeqPopEval <Route> ox_pop_eval2 (full_eval2);
    00130   eoStochTournamentSelect <Route> ox_select_one2;
    00131   eoSelectNumber <Route> ox_select2 (ox_select_one2, POP_SIZE);
    00132   eoSGATransform <Route> ox_transform2 (order_cross2, CROSS_RATE, city_swap_mut2, MUT_RATE);
    00133   peoSeqTransform <Route> ox_seq_transform2 (ox_transform2);
    00134   eoEPReplacement <Route> ox_replace2 (2);
    00135
    00136   /* The migration policy */
    00137   eoPeriodicContinue <Route> ox_mig_cont2 (MIG_FREQ); /* Migration occurs periodically */
    00138   eoStochTournamentSelect <Route> ox_mig_select_one2; /* Emigrants are randomly selected */
    00139   eoSelectNumber <Route> ox_mig_select2 (ox_mig_select_one2, MIG_SIZE);
    00140   eoPlusReplacement <Route> ox_mig_replace2; /* Immigrants replace the worse individuals */
    00141
    00142   peoAsyncIslandMig <Route> ox_mig2 (ox_mig_cont2, ox_mig_select2, ox_mig_replace2, topo, ox_pop2, ox_pop2);
    00143   ox_checkpoint2.add (ox_mig2);
    00144
    00145   peoEA <Route> ox_ea2 (ox_checkpoint2, ox_pop_eval2, ox_select2, ox_seq_transform2, ox_replace2);
    00146   ox_mig2.setOwner (ox_ea2);
    00147
    00148   ox_ea2 (ox_pop2);   /* Application to the given population */
    00149   // --------------------------------------------------------------------------------------------------
    00150
    00151
    00152
    00153   peo :: run ();
    00154   peo :: finalize (); /* Termination */
    00155
    00156
    00157   // rank 0 is assigned to the scheduler in the XML mapping file
    00158   if ( getNodeRank() == 1 ) {
    00159
    00160     std::cout << "EA[ 0 ] -----> " << ox_pop.best_element().fitness() << std::endl;
    00161     std::cout << "EA[ 1 ] -----> " << ox_pop2.best_element().fitness() << std::endl;
    00162   }
    00163
    00164
    00165   return 0;
    00166 }