- Main Page
- Namespaces
- Classes
- Files

- Search for |

# main.cpp

    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 #include "merge_route_eval.h"
    00047 #include "part_route_eval.h"
    00048
    00049
    00050 #include <peo>
    00051
    00052
    00053 #define POP_SIZE 10
    00054 #define NUM_GEN 100
    00055 #define CROSS_RATE 1.0
    00056 #define MUT_RATE 0.01
    00057
    00058 #define NUM_PART_EVALS 2
    00059
    00060
    00061 // by default, parallel evaluation of the population is performed;
    00062 // for parallel fitness evaluation, uncomment the following line
    00063
    00064 // #define PARALLEL_FIT_EVALUATION
    00065
    00066
    00067 int main( int __argc, char** __argv ) {
    00068
    00069         // initializing the ParadisEO-PEO environment
    00070         peo :: init( __argc, __argv );
    00071
    00072
    00073         // processing the command line specified parameters
    00074         loadParameters( __argc, __argv );
    00075
    00076
    00077         // init, eval operators, EA operators -------------------------------------------------------------------------------------------------------------
    00078
    00079         RouteInit route_init;   // random init object - creates random Route objects
    00080         RouteEval full_eval;    // evaluator object - offers a fitness value for a specified Route object
    00081
    00082         OrderXover crossover;   // crossover operator - creates two offsprings out of two specified parents
    00083         CitySwap mutation;      // mutation operator - randomly mutates one gene for a specified individual
    00084         // ------------------------------------------------------------------------------------------------------------------------------------------------
    00085
    00086
    00087         // evolutionary algorithm components --------------------------------------------------------------------------------------------------------------
    00088
    00089         eoPop< Route > population( POP_SIZE, route_init );      // initial population for the algorithm having POP_SIZE individuals
    00090
    00091
    00092         #ifdef PARALLEL_FIT_EVALUATION
    00093
    00094                 MergeRouteEval merge_eval;
    00095
    00096                 std :: vector< eoEvalFunc< Route >* > part_eval;
    00097                 for ( unsigned index = 1; index <= NUM_PART_EVALS; index++ )
    00098                         part_eval.push_back( new PartRouteEval( ( float )( index - 1 ) / NUM_PART_EVALS, ( float )index / NUM_PART_EVALS ) );
    00099
    00100                 peoParaPopEval< Route > ox_pop_eval( part_eval, merge_eval );
    00101
    00102         #else
    00103
    00104                peoParaPopEval< Route > ox_pop_eval( full_eval );
    00105
    00106         #endif
    00107
    00108
    00109
    00110         peoParaPopEval< Route > eaPopEval( full_eval );         // evaluator object - to be applied at each iteration on the entire population
    00111
    00112         eoGenContinue< Route > eaCont( NUM_GEN );               // continuation criterion - the algorithm will iterate for NUM_GEN generations
    00113         eoCheckPoint< Route > eaCheckpointContinue( eaCont );   // checkpoint object - verify at each iteration if the continuation criterion is met
    00114
    00115         eoRankingSelect< Route > selectionStrategy;             // selection strategy - applied at each iteration for selecting parent individuals
    00116         eoSelectNumber< Route > eaSelect( selectionStrategy, POP_SIZE ); // selection object - POP_SIZE individuals are selected at each iteration
    00117
    00118         // transform operator - includes the crossover and the mutation operators with a specified associated rate
    00119         eoSGATransform< Route > transform( crossover, CROSS_RATE, mutation, MUT_RATE );
    00120         peoSeqTransform< Route > eaTransform( transform );      // ParadisEO transform operator (please remark the peo prefix) - wraps an e EO transform object
    00121
    00122         eoPlusReplacement< Route > eaReplace;                   // replacement strategy - for replacing the initial population with offspring individuals
    00123         // ------------------------------------------------------------------------------------------------------------------------------------------------
    00124
    00125
    00126         // ParadisEO-PEO evolutionary algorithm -----------------------------------------------------------------------------------------------------------
    00127
    00128         peoEA< Route > eaAlg( eaCheckpointContinue, eaPopEval, eaSelect, eaTransform, eaReplace );
    00129
    00130         eaAlg( population );    // specifying the initial population for the algorithm, to be iteratively evolved
    00131         // ------------------------------------------------------------------------------------------------------------------------------------------------
    00132
    00133
    00134         peo :: run( );
    00135         peo :: finalize( );
    00136         // shutting down the ParadisEO-PEO environment
    00137
    00138         return 0;
    00139 }