00001 /* 00002 * <main.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 00037 #include "route.h" 00038 #include "route_init.h" 00039 #include "route_eval.h" 00040 00041 #include "order_xover.h" 00042 #include "city_swap.h" 00043 00044 #include "param.h" 00045 00046 00047 #include <peo> 00048 00049 00050 #define POP_SIZE 10 00051 #define NUM_GEN 100 00052 #define CROSS_RATE 1.0 00053 #define MUT_RATE 0.01 00054 00055 #define MIG_FREQ 10 00056 #define MIG_SIZE 5 00057 00058 00059 int main( int __argc, char** __argv ) { 00060 00061 // initializing the ParadisEO-PEO environment 00062 peo :: init( __argc, __argv ); 00063 00064 00065 // processing the command line specified parameters 00066 loadParameters( __argc, __argv ); 00067 00068 00069 // init, eval operators, EA operators ------------------------------------------------------------------------------------------------------------- 00070 00071 RouteInit route_init; // random init object - creates random Route objects 00072 RouteEval full_eval; // evaluator object - offers a fitness value for a specified Route object 00073 00074 OrderXover crossover; // crossover operator - creates two offsprings out of two specified parents 00075 CitySwap mutation; // mutation operator - randomly mutates one gene for a specified individual 00076 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00077 00078 00079 // evolutionary algorithm components -------------------------------------------------------------------------------------------------------------- 00080 00081 eoPop< Route > population( POP_SIZE, route_init ); // initial population for the algorithm having POP_SIZE individuals 00082 peoParaPopEval< Route > eaPopEval( full_eval ); // evaluator object - to be applied at each iteration on the entire population 00083 00084 eoGenContinue< Route > eaCont( NUM_GEN ); // continuation criterion - the algorithm will iterate for NUM_GEN generations 00085 eoCheckPoint< Route > eaCheckpointContinue( eaCont ); // checkpoint object - verify at each iteration if the continuation criterion is met 00086 00087 eoRankingSelect< Route > selectionStrategy; // selection strategy - applied at each iteration for selecting parent individuals 00088 eoSelectNumber< Route > eaSelect( selectionStrategy, POP_SIZE ); // selection object - POP_SIZE individuals are selected at each iteration 00089 00090 // transform operator - includes the crossover and the mutation operators with a specified associated rate 00091 eoSGATransform< Route > transform( crossover, CROSS_RATE, mutation, MUT_RATE ); 00092 peoSeqTransform< Route > eaTransform( transform ); // ParadisEO transform operator (please remark the peo prefix) - wraps an e EO transform object 00093 00094 eoPlusReplacement< Route > eaReplace; // replacement strategy - for replacing the initial population with offspring individuals 00095 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00096 00097 00098 00099 RingTopology topology; 00100 00101 // migration policy and components ---------------------------------------------------------------------------------------------------------------- 00102 00103 eoPeriodicContinue< Route > mig_cont( MIG_FREQ ); // migration occurs periodically 00104 00105 eoRandomSelect< Route > mig_select_one; // emigrants are randomly selected 00106 eoSelectNumber< Route > mig_select( mig_select_one, MIG_SIZE ); 00107 00108 eoPlusReplacement< Route > mig_replace; // immigrants replace the worse individuals 00109 00110 peoSyncIslandMig< Route > mig( MIG_FREQ, mig_select, mig_replace, topology, population, population ); 00111 //peoAsyncIslandMig< Route > mig( mig_cont, mig_select, mig_replace, topology, population, population ); 00112 00113 eaCheckpointContinue.add( mig ); 00114 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00115 00116 00117 00118 00119 00120 // ParadisEO-PEO evolutionary algorithm ----------------------------------------------------------------------------------------------------------- 00121 00122 peoEA< Route > eaAlg( eaCheckpointContinue, eaPopEval, eaSelect, eaTransform, eaReplace ); 00123 00124 mig.setOwner( eaAlg ); 00125 00126 eaAlg( population ); // specifying the initial population for the algorithm, to be iteratively evolved 00127 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00128 00129 00130 00131 00132 // evolutionary algorithm components -------------------------------------------------------------------------------------------------------------- 00133 00134 eoPop< Route > population2( POP_SIZE, route_init ); // initial population for the algorithm having POP_SIZE individuals 00135 peoParaPopEval< Route > eaPopEval2( full_eval ); // evaluator object - to be applied at each iteration on the entire population 00136 00137 eoGenContinue< Route > eaCont2( NUM_GEN ); // continuation criterion - the algorithm will iterate for NUM_GEN generations 00138 eoCheckPoint< Route > eaCheckpointContinue2( eaCont2 ); // checkpoint object - verify at each iteration if the continuation criterion is met 00139 00140 eoRankingSelect< Route > selectionStrategy2; // selection strategy - applied at each iteration for selecting parent individuals 00141 eoSelectNumber< Route > eaSelect2( selectionStrategy2, POP_SIZE ); // selection object - POP_SIZE individuals are selected at each iteration 00142 00143 // transform operator - includes the crossover and the mutation operators with a specified associated rate 00144 eoSGATransform< Route > transform2( crossover, CROSS_RATE, mutation, MUT_RATE ); 00145 peoSeqTransform< Route > eaTransform2( transform2 ); // ParadisEO transform operator (please remark the peo prefix) - wraps an e EO transform object 00146 00147 eoPlusReplacement< Route > eaReplace2; // replacement strategy - for replacing the initial population with offspring individuals 00148 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00149 00150 00151 00152 00153 // migration policy and components ---------------------------------------------------------------------------------------------------------------- 00154 00155 eoPeriodicContinue< Route > mig_cont2( MIG_FREQ ); // migration occurs periodically 00156 00157 eoRandomSelect< Route > mig_select_one2; // emigrants are randomly selected 00158 eoSelectNumber< Route > mig_select2( mig_select_one2, MIG_SIZE ); 00159 00160 eoPlusReplacement< Route > mig_replace2; // immigrants replace the worse individuals 00161 00162 peoSyncIslandMig< Route > mig2( MIG_FREQ, mig_select2, mig_replace2, topology, population2, population2 ); 00163 //peoAsyncIslandMig< Route > mig2( mig_cont2, mig_select2, mig_replace2, topology, population2, population2 ); 00164 00165 eaCheckpointContinue2.add( mig2 ); 00166 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00167 00168 00169 00170 00171 00172 // ParadisEO-PEO evolutionary algorithm ----------------------------------------------------------------------------------------------------------- 00173 00174 peoEA< Route > eaAlg2( eaCheckpointContinue2, eaPopEval2, eaSelect2, eaTransform2, eaReplace2 ); 00175 00176 mig2.setOwner( eaAlg2 ); 00177 00178 eaAlg2( population2 ); // specifying the initial population for the algorithm, to be iteratively evolved 00179 // ------------------------------------------------------------------------------------------------------------------------------------------------ 00180 00181 00182 00183 peo :: run( ); 00184 peo :: finalize( ); 00185 // shutting down the ParadisEO-PEO environment 00186 00187 return 0; 00188 }