git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1329 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
6a3cdb4910
commit
8c6554b415
20 changed files with 137 additions and 157 deletions
|
|
@ -50,8 +50,8 @@ IF(ENABLE_CMAKE_EXAMPLE OR CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CM
|
||||||
${MO_SRC_DIR}/tutorial/Lesson5/param
|
${MO_SRC_DIR}/tutorial/Lesson5/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson5/param
|
${MO_BIN_DIR}/tutorial/Lesson5/param
|
||||||
COMMAND ${CMAKE_COMMAND} -E copy_if_different
|
COMMAND ${CMAKE_COMMAND} -E copy_if_different
|
||||||
${MO_SRC_DIR}/tutorial/Lesson6/param
|
${MO_SRC_DIR}/tutorial/HybridLesson/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson6/param
|
${MO_BIN_DIR}/tutorial/HybridLesson/param
|
||||||
)
|
)
|
||||||
ENDIF(ENABLE_CMAKE_EXAMPLE OR CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ENDIF(ENABLE_CMAKE_EXAMPLE OR CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
|
|
@ -116,8 +116,8 @@ MACRO(ADD_COMMANDS_MO)
|
||||||
ADD_CUSTOM_COMMAND(
|
ADD_CUSTOM_COMMAND(
|
||||||
OUTPUT ${MO_BIN_DIR}/tutorial/Lesson6/param
|
OUTPUT ${MO_BIN_DIR}/tutorial/Lesson6/param
|
||||||
COMMAND ${CMAKE_COMMAND} -E copy_if_different
|
COMMAND ${CMAKE_COMMAND} -E copy_if_different
|
||||||
${MO_SRC_DIR}/tutorial/Lesson6/param
|
${MO_SRC_DIR}/tutorial/HybridLesson/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson6
|
${MO_BIN_DIR}/tutorial/HybridLesson
|
||||||
)
|
)
|
||||||
ENDMACRO(ADD_COMMANDS_MO)
|
ENDMACRO(ADD_COMMANDS_MO)
|
||||||
|
|
||||||
|
|
@ -125,12 +125,17 @@ MACRO(ADD_TARGET_MO n)
|
||||||
IF(${n} STREQUAL "lesson1")
|
IF(${n} STREQUAL "lesson1")
|
||||||
ADD_CUSTOM_TARGET(lesson1 DEPENDS
|
ADD_CUSTOM_TARGET(lesson1 DEPENDS
|
||||||
${MO_BIN_DIR}/tutorial/Lesson1/param
|
${MO_BIN_DIR}/tutorial/Lesson1/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson1/minimize_function
|
${MO_BIN_DIR}/tutorial/Lesson1/hill_climbing
|
||||||
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/rl5915.tsp
|
||||||
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
ELSEIF(${n} STREQUAL "lesson2")
|
ELSEIF(${n} STREQUAL "lesson2")
|
||||||
ADD_CUSTOM_TARGET(lesson2 DEPENDS
|
ADD_CUSTOM_TARGET(lesson2 DEPENDS
|
||||||
${MO_BIN_DIR}/tutorial/Lesson2/param
|
${MO_BIN_DIR}/tutorial/Lesson2/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson2/hill_climbing
|
${MO_BIN_DIR}/tutorial/Lesson2/tabu_search
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
|
|
@ -140,7 +145,7 @@ MACRO(ADD_TARGET_MO n)
|
||||||
ELSEIF(${n} STREQUAL "lesson3")
|
ELSEIF(${n} STREQUAL "lesson3")
|
||||||
ADD_CUSTOM_TARGET(lesson3 DEPENDS
|
ADD_CUSTOM_TARGET(lesson3 DEPENDS
|
||||||
${MO_BIN_DIR}/tutorial/Lesson3/param
|
${MO_BIN_DIR}/tutorial/Lesson3/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson3/tabu_search
|
${MO_BIN_DIR}/tutorial/Lesson3/simulated_annealing
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
|
|
@ -150,27 +155,17 @@ MACRO(ADD_TARGET_MO n)
|
||||||
ELSEIF(${n} STREQUAL "lesson4")
|
ELSEIF(${n} STREQUAL "lesson4")
|
||||||
ADD_CUSTOM_TARGET(lesson4 DEPENDS
|
ADD_CUSTOM_TARGET(lesson4 DEPENDS
|
||||||
${MO_BIN_DIR}/tutorial/Lesson4/param
|
${MO_BIN_DIR}/tutorial/Lesson4/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson4/simulated_annealing
|
${MO_BIN_DIR}/tutorial/Lesson4/iterated_local_search
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/rl5915.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/rl5915.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/usa13509.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
ELSEIF(${n} STREQUAL "lesson5")
|
ELSEIF(${n} STREQUAL "hybridlesson")
|
||||||
ADD_CUSTOM_TARGET(lesson5 DEPENDS
|
ADD_CUSTOM_TARGET(hybridlesson DEPENDS
|
||||||
${MO_BIN_DIR}/tutorial/Lesson5/param
|
${MO_BIN_DIR}/tutorial/HybridLesson/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson5/iterated_local_search
|
${MO_BIN_DIR}/tutorial/HybridLesson/hybrid_ga
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/rl5915.tsp
|
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/usa13509.tsp
|
|
||||||
)
|
|
||||||
ELSEIF(${n} STREQUAL "lesson6")
|
|
||||||
ADD_CUSTOM_TARGET(lesson6 DEPENDS
|
|
||||||
${MO_BIN_DIR}/tutorial/Lesson6/param
|
|
||||||
${MO_BIN_DIR}/tutorial/Lesson6/hybrid_ga
|
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
|
|
@ -184,7 +179,7 @@ MACRO(ADD_TARGET_MO n)
|
||||||
${MO_BIN_DIR}/tutorial/Lesson3/param
|
${MO_BIN_DIR}/tutorial/Lesson3/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson4/param
|
${MO_BIN_DIR}/tutorial/Lesson4/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson5/param
|
${MO_BIN_DIR}/tutorial/Lesson5/param
|
||||||
${MO_BIN_DIR}/tutorial/Lesson6/param
|
${MO_BIN_DIR}/tutorial/HybridLesson/param
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/berlin52.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/eil101.tsp
|
||||||
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
${MO_BIN_DIR}/tutorial/examples/tsp/benchs/pr2392.tsp
|
||||||
|
|
@ -214,4 +209,4 @@ ADD_SUBDIRECTORY(Lesson2)
|
||||||
ADD_SUBDIRECTORY(Lesson3)
|
ADD_SUBDIRECTORY(Lesson3)
|
||||||
ADD_SUBDIRECTORY(Lesson4)
|
ADD_SUBDIRECTORY(Lesson4)
|
||||||
ADD_SUBDIRECTORY(Lesson5)
|
ADD_SUBDIRECTORY(Lesson5)
|
||||||
ADD_SUBDIRECTORY(Lesson6)
|
ADD_SUBDIRECTORY(HybridLesson)
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,79 @@
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 1) Include the sources
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src)
|
||||||
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src/utils)
|
||||||
|
INCLUDE_DIRECTORIES(${MO_SRC_DIR}/src)
|
||||||
|
INCLUDE_DIRECTORIES(${TSP_SRC_DIR})
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 2) Specify where CMake can find the libraries
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${TSP_BIN_DIR}/lib)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 3) Define your target(s): just an executable here
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
SOURCE_GROUP(src FILES hybrid_ga.cpp)
|
||||||
|
|
||||||
|
SOURCE_GROUP(benchs FILES
|
||||||
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/pr2392.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/rl5915.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
|
)
|
||||||
|
|
||||||
|
ADD_EXECUTABLE(hybrid_ga
|
||||||
|
hybrid_ga.cpp
|
||||||
|
${MO_BIN_DIR}/tutorial/Lesson6/param
|
||||||
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/pr2392.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/rl5915.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
|
)
|
||||||
|
ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
ADD_COMMANDS_MO()
|
||||||
|
ADD_TARGET_MO(lesson6)
|
||||||
|
IF(ENABLE_CMAKE_EXAMPLE)
|
||||||
|
ADD_EXECUTABLE(hybrid_ga hybrid_ga.cpp)
|
||||||
|
ELSE(ENABLE_CMAKE_EXAMPLE)
|
||||||
|
ADD_EXECUTABLE(hybrid_ga EXCLUDE_FROM_ALL hybrid_ga.cpp)
|
||||||
|
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
||||||
|
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
|
ADD_DEPENDENCIES(hybrid_ga tsp)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
SET(ITERATEDLOCALSEARCH_VERSION ${GLOBAL_VERSION})
|
||||||
|
SET_TARGET_PROPERTIES(hybrid_ga PROPERTIES VERSION "${HYBRIDGA_VERSION}")
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 5) Link the librairies for your target(s)
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
TARGET_LINK_LIBRARIES(hybrid_ga tsp eo eoutils)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
@ -0,0 +1,194 @@
|
||||||
|
/*
|
||||||
|
* <tsp.cpp>
|
||||||
|
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
|
||||||
|
* (C) OPAC Team, LIFL, 2002-2007
|
||||||
|
*
|
||||||
|
* Sébastien Cahon, Thomas Legrand
|
||||||
|
*
|
||||||
|
* This software is governed by the CeCILL license under French law and
|
||||||
|
* abiding by the rules of distribution of free software. You can use,
|
||||||
|
* modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
* license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
* "http://www.cecill.info".
|
||||||
|
*
|
||||||
|
* As a counterpart to the access to the source code and rights to copy,
|
||||||
|
* modify and redistribute granted by the license, users are provided only
|
||||||
|
* with a limited warranty and the software's author, the holder of the
|
||||||
|
* economic rights, and the successive licensors have only limited liability.
|
||||||
|
*
|
||||||
|
* In this respect, the user's attention is drawn to the risks associated
|
||||||
|
* with loading, using, modifying and/or developing or reproducing the
|
||||||
|
* software by the user in light of its specific status of free software,
|
||||||
|
* that may mean that it is complicated to manipulate, and that also
|
||||||
|
* therefore means that it is reserved for developers and experienced
|
||||||
|
* professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
* encouraged to load and test the software's suitability as regards their
|
||||||
|
* requirements in conditions enabling the security of their systems and/or
|
||||||
|
* data to be ensured and, more generally, to use and operate it in the
|
||||||
|
* same conditions as regards security.
|
||||||
|
* The fact that you are presently reading this means that you have had
|
||||||
|
* knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
*
|
||||||
|
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
* Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <tsp>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string instancePath, crossoverType, selectionType;
|
||||||
|
unsigned int seed, populationSize, maxIterations, selectedParentNumber;
|
||||||
|
double crossoverRate, mutationRate, elitismRate, tournamentRate;
|
||||||
|
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
|
||||||
|
instancePath=parser.getParamWithLongName("instancePath")->getValue();
|
||||||
|
populationSize=atoi( (parser.getParamWithLongName("popSize")->getValue()).c_str() );
|
||||||
|
maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
|
||||||
|
crossoverRate=atof( (parser.getParamWithLongName("crossRate")->getValue()).c_str() );
|
||||||
|
mutationRate=atof( (parser.getParamWithLongName("mutRate")->getValue()).c_str() );
|
||||||
|
selectedParentNumber=atoi( (parser.getParamWithLongName("nbSelPar")->getValue()).c_str() );
|
||||||
|
elitismRate=atof( (parser.getParamWithLongName("elitismRate")->getValue()).c_str() );
|
||||||
|
tournamentRate=atof( (parser.getParamWithLongName("tournRate")->getValue()).c_str() );
|
||||||
|
crossoverType=parser.getParamWithLongName("crossType")->getValue();
|
||||||
|
selectionType=parser.getParamWithLongName("selectionType")->getValue();
|
||||||
|
|
||||||
|
srand (seed);
|
||||||
|
Graph::load(instancePath.c_str());
|
||||||
|
|
||||||
|
RouteInit init ;
|
||||||
|
|
||||||
|
RouteEval full_evaluation ;
|
||||||
|
|
||||||
|
eoPop <Route> population (populationSize, init) ;
|
||||||
|
apply <Route> (full_evaluation, population) ;
|
||||||
|
|
||||||
|
std :: cout << "[From] " << population.best_element () << std :: endl ;
|
||||||
|
|
||||||
|
eoGenContinue <Route> continu (maxIterations) ;
|
||||||
|
|
||||||
|
eoStochTournamentSelect <Route> select_one ;
|
||||||
|
|
||||||
|
eoSelectNumber <Route> select (select_one, selectedParentNumber) ;
|
||||||
|
|
||||||
|
eoQuadOp <Route>*crossover;
|
||||||
|
|
||||||
|
if(crossoverType.compare("Partial")==0)
|
||||||
|
{
|
||||||
|
crossover=new PartialMappedXover();
|
||||||
|
}
|
||||||
|
else if (crossoverType.compare("Order")==0)
|
||||||
|
{
|
||||||
|
crossover=new OrderXover();
|
||||||
|
}
|
||||||
|
else if (crossoverType.compare("Edge")==0)
|
||||||
|
{
|
||||||
|
crossover=new EdgeXover();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[tsp.cpp]: the crossover type '"+crossoverType+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
TwoOptInit two_opt_initializer;
|
||||||
|
|
||||||
|
TwoOptNext two_opt_next_move_generator;
|
||||||
|
|
||||||
|
TwoOptIncrEval two_opt_incremental_evaluation;
|
||||||
|
|
||||||
|
moMoveSelect<TwoOpt>* two_opt_selection;
|
||||||
|
|
||||||
|
if(selectionType.compare("Best")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moBestImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("First")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moFirstImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("Random")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moRandImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[hill_climbing.cpp]: the type of selection '"+selectionType+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
moHC <TwoOpt> hill_climbing_mutation (two_opt_initializer, two_opt_next_move_generator, two_opt_incremental_evaluation,
|
||||||
|
*two_opt_selection, full_evaluation);
|
||||||
|
|
||||||
|
eoSGATransform <Route> transform (*crossover, crossoverRate, hill_climbing_mutation, mutationRate) ;
|
||||||
|
|
||||||
|
eoElitism <Route> merge (elitismRate) ;
|
||||||
|
|
||||||
|
eoStochTournamentTruncate <Route> reduce (tournamentRate) ;
|
||||||
|
|
||||||
|
eoEasyEA <Route> ea (continu, full_evaluation, select, transform, merge, reduce) ;
|
||||||
|
|
||||||
|
ea (population) ;
|
||||||
|
|
||||||
|
std :: cout << "[To] " << population.best_element () << std :: endl ;
|
||||||
|
|
||||||
|
delete(crossover);
|
||||||
|
delete(two_opt_selection);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam(std::string("../examples/tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)100, "popSize", "Size of the population.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)1.0, "crossRate", "Probability of crossover.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)0.01, "mutRate", "Probability of mutation.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)100, "nbSelPar", "Number of selected parents.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)1.0, "elitismRate", "Percentage of the best individuals kept.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)0.7, "tournRate", "Percentage of the individuals used during the tournament.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam(std::string("Partial"), "crossType", "Crossover to use, it can be 'Partial', 'Order' or 'Edge'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
|
||||||
|
_parser.getORcreateParam(std::string("Best"), "selectionType", "Type of the selection: 'Best', 'First' or 'Random'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[tsp.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
17
branches/cmakemodif/paradiseo-mo/tutorial/HybridLesson/param
Normal file
17
branches/cmakemodif/paradiseo-mo/tutorial/HybridLesson/param
Normal file
|
|
@ -0,0 +1,17 @@
|
||||||
|
|
||||||
|
###### General ######
|
||||||
|
# --help=0 # -h : Prints this message
|
||||||
|
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
||||||
|
|
||||||
|
###### Configuration ######
|
||||||
|
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
||||||
|
# --seed=1224599328 # Seed for rand.
|
||||||
|
# --popSize=100 # Size of the population.
|
||||||
|
# --maxIter=1000 # Maximum number of iterations.
|
||||||
|
# --crossRate=1 # Probability of crossover.
|
||||||
|
# --mutRate=0.01 # Probability of mutation.
|
||||||
|
# --nbSelPar=100 # Number of selected parents.
|
||||||
|
# --elitismRate=1 # Percentage of the best individuals kept.
|
||||||
|
# --tournRate=0.7 # Percentage of the individuals used during the tournament.
|
||||||
|
# --crossType=Partial # Crossover to use, it can be 'Partial', 'Order' or 'Edge'.
|
||||||
|
# --selectionType=Best # Type of the selection: 'Best', 'First' or 'Random'.
|
||||||
|
|
@ -5,54 +5,65 @@
|
||||||
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src)
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src)
|
||||||
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src/utils)
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src/utils)
|
||||||
INCLUDE_DIRECTORIES(${MO_SRC_DIR}/src)
|
INCLUDE_DIRECTORIES(${MO_SRC_DIR}/src)
|
||||||
INCLUDE_DIRECTORIES(${FUNCTION_SRC_DIR})
|
INCLUDE_DIRECTORIES(${TSP_SRC_DIR})
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 2) Specify where CMake can find the libraries
|
### 2) Specify where CMake can find the libraries
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${FUNCTION_BIN_DIR}/lib)
|
LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${TSP_BIN_DIR}/lib)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 3) Define your target(s): just an executable here
|
### 3) Define your target(s): just an executable here
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
SOURCE_GROUP(src FILES minimize_function.cpp)
|
SOURCE_GROUP(src FILES hill_climbing.cpp)
|
||||||
ADD_EXECUTABLE(minimize_function
|
|
||||||
minimize_function.cpp
|
SOURCE_GROUP(benchs FILES
|
||||||
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/pr2392.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/rl5915.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
|
)
|
||||||
|
|
||||||
|
ADD_EXECUTABLE(hill_climbing
|
||||||
|
hill_climbing.cpp
|
||||||
${MO_BIN_DIR}/tutorial/Lesson1/param
|
${MO_BIN_DIR}/tutorial/Lesson1/param
|
||||||
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/pr2392.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/rl5915.tsp
|
||||||
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
ADD_COMMANDS_MO()
|
ADD_COMMANDS_MO()
|
||||||
ADD_TARGET_MO(lesson1)
|
ADD_TARGET_MO(lesson1)
|
||||||
IF(ENABLE_CMAKE_EXAMPLE)
|
IF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(minimize_function minimize_function.cpp)
|
ADD_EXECUTABLE(hill_climbing hill_climbing.cpp)
|
||||||
ELSE(ENABLE_CMAKE_EXAMPLE)
|
ELSE(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(minimize_function EXCLUDE_FROM_ALL minimize_function.cpp)
|
ADD_EXECUTABLE(hill_climbing EXCLUDE_FROM_ALL hill_climbing.cpp)
|
||||||
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
ADD_DEPENDENCIES(minimize_function function)
|
|
||||||
|
|
||||||
|
ADD_DEPENDENCIES(hill_climbing tsp)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
SET(HILLCLIMBING_VERSION ${GLOBAL_VERSION})
|
||||||
SET(MINIMIZEFUNCTION_VERSION ${GLOBAL_VERSION})
|
SET_TARGET_PROPERTIES(hill_climbing PROPERTIES VERSION "${HILLCLIMBING_VERSION}")
|
||||||
SET_TARGET_PROPERTIES(minimize_function PROPERTIES VERSION "${MINIMIZEFUNCTION_VERSION}")
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -61,6 +72,7 @@ SET_TARGET_PROPERTIES(minimize_function PROPERTIES VERSION "${MINIMIZEFUNCTION_V
|
||||||
### 5) Link the librairies for your target(s)
|
### 5) Link the librairies for your target(s)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
TARGET_LINK_LIBRARIES(minimize_function function eo eoutils)
|
TARGET_LINK_LIBRARIES(hill_climbing tsp eo eoutils)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,134 @@
|
||||||
|
/*
|
||||||
|
<hill_climbing.cpp>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
(C) OPAC Team, LIFL, 2002-2008
|
||||||
|
|
||||||
|
Sébastien Cahon, Jean-Charles Boisson
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can use,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
As a counterpart to the access to the source code and rights to copy,
|
||||||
|
modify and redistribute granted by the license, users are provided only
|
||||||
|
with a limited warranty and the software's author, the holder of the
|
||||||
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <tsp>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string instancePath, selectionType;
|
||||||
|
unsigned int seed;
|
||||||
|
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
|
||||||
|
instancePath=parser.getParamWithLongName("instancePath")->getValue();
|
||||||
|
selectionType=parser.getParamWithLongName("selectionType")->getValue();
|
||||||
|
|
||||||
|
srand (seed);
|
||||||
|
Graph::load(instancePath.c_str());
|
||||||
|
|
||||||
|
Route solution;
|
||||||
|
|
||||||
|
RouteInit initializer;
|
||||||
|
initializer (solution);
|
||||||
|
|
||||||
|
RouteEval full_evaluation;
|
||||||
|
full_evaluation (solution);
|
||||||
|
|
||||||
|
std :: cout << "[From] " << solution << std :: endl;
|
||||||
|
|
||||||
|
/* Tools for an efficient (? :-))
|
||||||
|
local search ! */
|
||||||
|
|
||||||
|
TwoOptInit two_opt_initializer;
|
||||||
|
|
||||||
|
TwoOptNext two_opt_next_move_generator;
|
||||||
|
|
||||||
|
TwoOptIncrEval two_opt_incremental_evaluation;
|
||||||
|
|
||||||
|
moMoveSelect<TwoOpt>* two_opt_selection;
|
||||||
|
|
||||||
|
if(selectionType.compare("Best")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moBestImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("First")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moFirstImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("Random")==0)
|
||||||
|
{
|
||||||
|
two_opt_selection= new moRandImprSelect<TwoOpt>();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[hill_climbing.cpp]: the type of selection '"+selectionType+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
moHC <TwoOpt> hill_climbing (two_opt_initializer, two_opt_next_move_generator, two_opt_incremental_evaluation,
|
||||||
|
*two_opt_selection, full_evaluation);
|
||||||
|
hill_climbing (solution) ;
|
||||||
|
|
||||||
|
std :: cout << "[To] " << solution << std :: endl;
|
||||||
|
|
||||||
|
delete(two_opt_selection);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam(std::string("../examples/tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam(std::string("Best"), "selectionType", "Type of the selection: 'Best', 'First' or 'Random'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[hill_climbing.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
|
|
@ -4,7 +4,6 @@
|
||||||
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
||||||
|
|
||||||
###### Configuration ######
|
###### Configuration ######
|
||||||
# --initialBound=1 # Bound for the initial affectation.
|
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
||||||
# --searchBound=1 # Bound for neighbourhood exploration.
|
# --seed=1203517190 # Seed for rand.
|
||||||
# --searchStep=1 # Step between two values during the neighbourhood exploration.
|
# --selectionType=Best # Type of the selection: 'Best', 'First' or 'Random'.
|
||||||
# --selectionType=First # Type of the selection: 'Best', 'First' or 'Random'.
|
|
||||||
|
|
|
||||||
|
|
@ -1,3 +1,5 @@
|
||||||
|
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 1) Include the sources
|
### 1) Include the sources
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
@ -22,8 +24,10 @@ LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${TSP_BIN_DIR}/lib)
|
||||||
### 3) Define your target(s): just an executable here
|
### 3) Define your target(s): just an executable here
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
SOURCE_GROUP(src FILES hill_climbing.cpp)
|
SOURCE_GROUP(src FILES tabu_search.cpp)
|
||||||
|
|
||||||
SOURCE_GROUP(benchs FILES
|
SOURCE_GROUP(benchs FILES
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
|
@ -33,8 +37,8 @@ IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "
|
||||||
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
|
|
||||||
ADD_EXECUTABLE(hill_climbing
|
ADD_EXECUTABLE(tabu_search
|
||||||
hill_climbing.cpp
|
tabu_search.cpp
|
||||||
${MO_BIN_DIR}/tutorial/Lesson2/param
|
${MO_BIN_DIR}/tutorial/Lesson2/param
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
${TSP_BIN_DIR}/benchs/eil101.tsp
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
|
@ -46,14 +50,13 @@ ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL
|
||||||
ADD_COMMANDS_MO()
|
ADD_COMMANDS_MO()
|
||||||
ADD_TARGET_MO(lesson2)
|
ADD_TARGET_MO(lesson2)
|
||||||
IF(ENABLE_CMAKE_EXAMPLE)
|
IF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(hill_climbing hill_climbing.cpp)
|
ADD_EXECUTABLE(tabu_search tabu_search.cpp)
|
||||||
ELSE(ENABLE_CMAKE_EXAMPLE)
|
ELSE(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(hill_climbing EXCLUDE_FROM_ALL hill_climbing.cpp)
|
ADD_EXECUTABLE(tabu_search EXCLUDE_FROM_ALL tabu_search.cpp)
|
||||||
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
|
ADD_DEPENDENCIES(tabu_search tsp)
|
||||||
ADD_DEPENDENCIES(hill_climbing tsp)
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -62,8 +65,8 @@ ADD_DEPENDENCIES(hill_climbing tsp)
|
||||||
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
SET(HILLCLIMBING_VERSION ${GLOBAL_VERSION})
|
SET(TABUSEARCH_VERSION ${GLOBAL_VERSION})
|
||||||
SET_TARGET_PROPERTIES(hill_climbing PROPERTIES VERSION "${HILLCLIMBING_VERSION}")
|
SET_TARGET_PROPERTIES(tabu_search PROPERTIES VERSION "${TABUSEARCH_VERSION}")
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -72,7 +75,7 @@ SET_TARGET_PROPERTIES(hill_climbing PROPERTIES VERSION "${HILLCLIMBING_VERSION}"
|
||||||
### 5) Link the librairies for your target(s)
|
### 5) Link the librairies for your target(s)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
TARGET_LINK_LIBRARIES(hill_climbing tsp eo eoutils)
|
TARGET_LINK_LIBRARIES(tabu_search tsp eo eoutils)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -4,6 +4,8 @@
|
||||||
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
||||||
|
|
||||||
###### Configuration ######
|
###### Configuration ######
|
||||||
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance
|
||||||
# --seed=1203517190 # Seed for rand.
|
# --seed=1202917905 # Seed for rand
|
||||||
# --selectionType=Best # Type of the selection: 'Best', 'First' or 'Random'.
|
# --tabuListSize=10 # Size of the tabu list
|
||||||
|
# --maxIter=1000 # Maximum number of iterations
|
||||||
|
# --tabuListType=TwoOpt # Type of the tabu list: 'TwoOpt', 'SimpleMove' or 'SimpleSolution'
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,145 @@
|
||||||
|
/*
|
||||||
|
<tabu_search.cpp>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
(C) OPAC Team, LIFL, 2002-2008
|
||||||
|
|
||||||
|
Sébastien Cahon, Jean-Charles Boisson
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can use,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
As a counterpart to the access to the source code and rights to copy,
|
||||||
|
modify and redistribute granted by the license, users are provided only
|
||||||
|
with a limited warranty and the software's author, the holder of the
|
||||||
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <tsp>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string instancePath, value;
|
||||||
|
unsigned int seed, maxIterations, tabuListSize;
|
||||||
|
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
|
||||||
|
maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
|
||||||
|
tabuListSize=atoi( (parser.getParamWithLongName("tabuListSize")->getValue()).c_str() );
|
||||||
|
instancePath=parser.getParamWithLongName("instancePath")->getValue();
|
||||||
|
value=parser.getParamWithLongName("tabuListType")->getValue();
|
||||||
|
|
||||||
|
srand (seed);
|
||||||
|
Graph::load(instancePath.c_str());
|
||||||
|
|
||||||
|
Route solution;
|
||||||
|
|
||||||
|
RouteInit initializer;
|
||||||
|
initializer(solution);
|
||||||
|
|
||||||
|
RouteEval full_evaluation;
|
||||||
|
full_evaluation(solution);
|
||||||
|
|
||||||
|
std :: cout << "[From] " << solution << std :: endl;
|
||||||
|
|
||||||
|
/* Tools for an efficient (? :-))
|
||||||
|
local search ! */
|
||||||
|
|
||||||
|
TwoOptInit two_opt_initializer;
|
||||||
|
|
||||||
|
TwoOptNext two_opt_next_move_generator;
|
||||||
|
|
||||||
|
TwoOptIncrEval two_opt_incremental_evaluation;
|
||||||
|
|
||||||
|
moTabuList<TwoOpt> *tabuList;
|
||||||
|
|
||||||
|
if(value.compare("TwoOpt")==0)
|
||||||
|
{
|
||||||
|
tabuList=new TwoOptTabuList();
|
||||||
|
}
|
||||||
|
else if (value.compare("SimpleMove")==0)
|
||||||
|
{
|
||||||
|
tabuList=new moSimpleMoveTabuList<TwoOpt>(tabuListSize);
|
||||||
|
}
|
||||||
|
else if (value.compare("SimpleSolution")==0)
|
||||||
|
{
|
||||||
|
tabuList=new moSimpleSolutionTabuList<TwoOpt>(tabuListSize);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[tabu_search.cpp]: the type of tabu list '"+value+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
moNoAspirCrit <TwoOpt> aspiration_criterion;
|
||||||
|
|
||||||
|
moGenSolContinue <Route> continu (maxIterations);
|
||||||
|
|
||||||
|
moTS <TwoOpt> tabu_search (two_opt_initializer, two_opt_next_move_generator,
|
||||||
|
two_opt_incremental_evaluation, *tabuList, aspiration_criterion, continu, full_evaluation);
|
||||||
|
tabu_search(solution);
|
||||||
|
|
||||||
|
std :: cout << "[To] " << solution << std :: endl;
|
||||||
|
|
||||||
|
delete(tabuList);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam(std::string("../examples/tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)10, "tabuListSize", "Size of the tabu list.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam(std::string("TwoOpt"), "tabuListType", "Type of the tabu list: 'TwoOpt', 'SimpleMove' or 'SimpleSolution'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[tabu_search.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
|
|
@ -1,5 +1,4 @@
|
||||||
|
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 1) Include the sources
|
### 1) Include the sources
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
@ -24,10 +23,8 @@ LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${TSP_BIN_DIR}/lib)
|
||||||
### 3) Define your target(s): just an executable here
|
### 3) Define your target(s): just an executable here
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
SOURCE_GROUP(src FILES tabu_search.cpp)
|
SOURCE_GROUP(src FILES simulated_annealing.cpp)
|
||||||
|
|
||||||
SOURCE_GROUP(benchs FILES
|
SOURCE_GROUP(benchs FILES
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
|
@ -37,8 +34,8 @@ IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "
|
||||||
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
|
|
||||||
ADD_EXECUTABLE(tabu_search
|
ADD_EXECUTABLE(simulated_annealing
|
||||||
tabu_search.cpp
|
simulated_annealing.cpp
|
||||||
${MO_BIN_DIR}/tutorial/Lesson3/param
|
${MO_BIN_DIR}/tutorial/Lesson3/param
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
${TSP_BIN_DIR}/benchs/eil101.tsp
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
|
@ -50,13 +47,13 @@ ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL
|
||||||
ADD_COMMANDS_MO()
|
ADD_COMMANDS_MO()
|
||||||
ADD_TARGET_MO(lesson3)
|
ADD_TARGET_MO(lesson3)
|
||||||
IF(ENABLE_CMAKE_EXAMPLE)
|
IF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(tabu_search tabu_search.cpp)
|
ADD_EXECUTABLE(simulated_annealing simulated_annealing.cpp)
|
||||||
ELSE(ENABLE_CMAKE_EXAMPLE)
|
ELSE(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(tabu_search EXCLUDE_FROM_ALL tabu_search.cpp)
|
ADD_EXECUTABLE(simulated_annealing EXCLUDE_FROM_ALL simulated_annealing.cpp)
|
||||||
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
ADD_DEPENDENCIES(tabu_search tsp)
|
ADD_DEPENDENCIES(simulated_annealing tsp)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -65,8 +62,8 @@ ADD_DEPENDENCIES(tabu_search tsp)
|
||||||
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
SET(TABUSEARCH_VERSION ${GLOBAL_VERSION})
|
SET(SIMULATEDANNEALING_VERSION ${GLOBAL_VERSION})
|
||||||
SET_TARGET_PROPERTIES(tabu_search PROPERTIES VERSION "${TABUSEARCH_VERSION}")
|
SET_TARGET_PROPERTIES(simulated_annealing PROPERTIES VERSION "${SIMULATEDANNEALING_VERSION}")
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -75,7 +72,7 @@ SET_TARGET_PROPERTIES(tabu_search PROPERTIES VERSION "${TABUSEARCH_VERSION}")
|
||||||
### 5) Link the librairies for your target(s)
|
### 5) Link the librairies for your target(s)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
TARGET_LINK_LIBRARIES(tabu_search tsp eo eoutils)
|
TARGET_LINK_LIBRARIES(simulated_annealing tsp eo eoutils)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -4,8 +4,11 @@
|
||||||
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
||||||
|
|
||||||
###### Configuration ######
|
###### Configuration ######
|
||||||
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance
|
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
||||||
# --seed=1202917905 # Seed for rand
|
# --seed=1202919978 # Seed for rand.
|
||||||
# --tabuListSize=10 # Size of the tabu list
|
# --maxIter=1000 # Maximum number of iterations.
|
||||||
# --maxIter=1000 # Maximum number of iterations
|
# --initialTemp=1000 # Initial temperature.
|
||||||
# --tabuListType=TwoOpt # Type of the tabu list: 'TwoOpt', 'SimpleMove' or 'SimpleSolution'
|
# --threshold=0.1 # Minimum temperature allowed.
|
||||||
|
# --expoRatio=0.98 # Ratio used if exponential cooling schedule is chosen.
|
||||||
|
# --lineaRatio=0.5 # Ratio used if linear cooling schedule is chosen.
|
||||||
|
# --coolSchedType=Expo # Type the cooling schedule: 'Expo' or 'Linear'.
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,148 @@
|
||||||
|
/*
|
||||||
|
<simulated_annealing.cpp>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
(C) OPAC Team, LIFL, 2002-2008
|
||||||
|
|
||||||
|
Sébastien Cahon, Jean-Charles Boisson
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can use,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
As a counterpart to the access to the source code and rights to copy,
|
||||||
|
modify and redistribute granted by the license, users are provided only
|
||||||
|
with a limited warranty and the software's author, the holder of the
|
||||||
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <tsp>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string instancePath, value;
|
||||||
|
unsigned int seed, maxIterations;
|
||||||
|
double threshold, exponentialRatio, linearRatio, initialTemperature;
|
||||||
|
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
|
||||||
|
instancePath=parser.getParamWithLongName("instancePath")->getValue();
|
||||||
|
maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
|
||||||
|
initialTemperature=atof( (parser.getParamWithLongName("initialTemp")->getValue()).c_str() );
|
||||||
|
threshold=atof( (parser.getParamWithLongName("threshold")->getValue()).c_str() );
|
||||||
|
exponentialRatio=atof( (parser.getParamWithLongName("expoRatio")->getValue()).c_str() );
|
||||||
|
linearRatio=atof( (parser.getParamWithLongName("lineaRatio")->getValue()).c_str() );
|
||||||
|
value=parser.getParamWithLongName("coolSchedType")->getValue();
|
||||||
|
|
||||||
|
srand (seed);
|
||||||
|
Graph::load(instancePath.c_str());
|
||||||
|
|
||||||
|
Route solution;
|
||||||
|
|
||||||
|
RouteInit initializer;
|
||||||
|
initializer (solution);
|
||||||
|
|
||||||
|
RouteEval full_evaluation;
|
||||||
|
full_evaluation (solution);
|
||||||
|
|
||||||
|
std :: cout << "[From] " << solution << std :: endl;
|
||||||
|
|
||||||
|
/* Tools for an efficient (? :-))
|
||||||
|
local search ! */
|
||||||
|
|
||||||
|
TwoOptRand two_opt_random_move_generator;
|
||||||
|
|
||||||
|
TwoOptIncrEval two_opt_incremental_evaluation;
|
||||||
|
|
||||||
|
TwoOpt move;
|
||||||
|
|
||||||
|
moCoolingSchedule* coolingSchedule;
|
||||||
|
|
||||||
|
if(value.compare("Expo")==0)
|
||||||
|
{
|
||||||
|
coolingSchedule=new moExponentialCoolingSchedule(threshold, exponentialRatio);
|
||||||
|
}
|
||||||
|
else if (value.compare("Linear")==0)
|
||||||
|
{
|
||||||
|
coolingSchedule=new moLinearCoolingSchedule(threshold, linearRatio);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[simulated_annealing.cpp]: the type of cooling schedule '"+value+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
moGenSolContinue <Route> continu (maxIterations);
|
||||||
|
|
||||||
|
moSA <TwoOpt> simulated_annealing (two_opt_random_move_generator, two_opt_incremental_evaluation,
|
||||||
|
continu, initialTemperature, *coolingSchedule, full_evaluation);
|
||||||
|
simulated_annealing (solution);
|
||||||
|
|
||||||
|
std :: cout << "[To] " << solution << std :: endl;
|
||||||
|
|
||||||
|
delete(coolingSchedule);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS ;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam(std::string("../examples/tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)1000, "initialTemp", "Initial temperature.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)0.1, "threshold", "Minimum temperature allowed.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)0.98, "expoRatio", "Ratio used if exponential cooling schedule is chosen.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((double)0.5, "lineaRatio", "Ratio used if linear cooling schedule is chosen.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam(std::string("Expo"), "coolSchedType", "Type the cooling schedule: 'Expo' or 'Linear'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[simulated_annealing.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
|
|
@ -1,4 +1,5 @@
|
||||||
|
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
### 1) Include the sources
|
### 1) Include the sources
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
@ -24,7 +25,7 @@ LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${TSP_BIN_DIR}/lib)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
SOURCE_GROUP(src FILES simulated_annealing.cpp)
|
SOURCE_GROUP(src FILES iterated_local_search.cpp)
|
||||||
|
|
||||||
SOURCE_GROUP(benchs FILES
|
SOURCE_GROUP(benchs FILES
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
|
|
@ -34,8 +35,8 @@ IF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "
|
||||||
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
${TSP_BIN_DIR}/benchs/usa13509.tsp
|
||||||
)
|
)
|
||||||
|
|
||||||
ADD_EXECUTABLE(simulated_annealing
|
ADD_EXECUTABLE(iterated_local_search
|
||||||
simulated_annealing.cpp
|
iterated_local_search.cpp
|
||||||
${MO_BIN_DIR}/tutorial/Lesson4/param
|
${MO_BIN_DIR}/tutorial/Lesson4/param
|
||||||
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
${TSP_BIN_DIR}/benchs/berlin52.tsp
|
||||||
${TSP_BIN_DIR}/benchs/eil101.tsp
|
${TSP_BIN_DIR}/benchs/eil101.tsp
|
||||||
|
|
@ -47,13 +48,14 @@ ELSE(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL
|
||||||
ADD_COMMANDS_MO()
|
ADD_COMMANDS_MO()
|
||||||
ADD_TARGET_MO(lesson4)
|
ADD_TARGET_MO(lesson4)
|
||||||
IF(ENABLE_CMAKE_EXAMPLE)
|
IF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(simulated_annealing simulated_annealing.cpp)
|
ADD_EXECUTABLE(iterated_local_search iterated_local_search.cpp)
|
||||||
ELSE(ENABLE_CMAKE_EXAMPLE)
|
ELSE(ENABLE_CMAKE_EXAMPLE)
|
||||||
ADD_EXECUTABLE(simulated_annealing EXCLUDE_FROM_ALL simulated_annealing.cpp)
|
ADD_EXECUTABLE(iterated_local_search EXCLUDE_FROM_ALL iterated_local_search.cpp)
|
||||||
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
ENDIF(ENABLE_CMAKE_EXAMPLE)
|
||||||
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
ENDIF(CMAKE_GENERATOR STREQUAL "Visual Studio 8 2005" OR CMAKE_GENERATOR STREQUAL "Visual Studio 9 2008")
|
||||||
|
|
||||||
ADD_DEPENDENCIES(simulated_annealing tsp)
|
ADD_DEPENDENCIES(iterated_local_search tsp)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -62,8 +64,8 @@ ADD_DEPENDENCIES(simulated_annealing tsp)
|
||||||
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
SET(SIMULATEDANNEALING_VERSION ${GLOBAL_VERSION})
|
SET(ITERATEDLOCALSEARCH_VERSION ${GLOBAL_VERSION})
|
||||||
SET_TARGET_PROPERTIES(simulated_annealing PROPERTIES VERSION "${SIMULATEDANNEALING_VERSION}")
|
SET_TARGET_PROPERTIES(iterated_local_search PROPERTIES VERSION "${ITERATEDLOCALSEARCH_VERSION}")
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -72,7 +74,6 @@ SET_TARGET_PROPERTIES(simulated_annealing PROPERTIES VERSION "${SIMULATEDANNEALI
|
||||||
### 5) Link the librairies for your target(s)
|
### 5) Link the librairies for your target(s)
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
TARGET_LINK_LIBRARIES(simulated_annealing tsp eo eoutils)
|
TARGET_LINK_LIBRARIES(iterated_local_search tsp eo eoutils)
|
||||||
|
|
||||||
######################################################################################
|
######################################################################################
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,117 @@
|
||||||
|
/*
|
||||||
|
<iterated_local_search.cpp>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
(C) OPAC Team, LIFL, 2002-2008
|
||||||
|
|
||||||
|
Sébastien Cahon, Jean-Charles Boisson
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can use,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
As a counterpart to the access to the source code and rights to copy,
|
||||||
|
modify and redistribute granted by the license, users are provided only
|
||||||
|
with a limited warranty and the software's author, the holder of the
|
||||||
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <tsp>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string instancePath;
|
||||||
|
unsigned int seed, maxIterations;
|
||||||
|
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
seed=atoi( (parser.getParamWithLongName("seed")->getValue()).c_str() );
|
||||||
|
instancePath=parser.getParamWithLongName("instancePath")->getValue();
|
||||||
|
maxIterations=atoi( (parser.getParamWithLongName("maxIter")->getValue()).c_str() );
|
||||||
|
|
||||||
|
srand(seed);
|
||||||
|
Graph::load (instancePath.c_str());
|
||||||
|
|
||||||
|
Route solution;
|
||||||
|
|
||||||
|
RouteInit initializer;
|
||||||
|
initializer (solution);
|
||||||
|
|
||||||
|
RouteEval full_evaluation;
|
||||||
|
full_evaluation (solution);
|
||||||
|
|
||||||
|
std :: cout << "[From] " << solution << std :: endl;
|
||||||
|
|
||||||
|
TwoOptInit two_opt_initializer;
|
||||||
|
|
||||||
|
TwoOptNext two_opt_next_move_generator;
|
||||||
|
|
||||||
|
TwoOptIncrEval two_opt_incremental_evaluation;
|
||||||
|
|
||||||
|
moBestImprSelect <TwoOpt> two_opt_selection;
|
||||||
|
|
||||||
|
moGenSolContinue <Route> continu(maxIterations);
|
||||||
|
|
||||||
|
moFitComparator<Route> comparator;
|
||||||
|
|
||||||
|
CitySwap perturbation;
|
||||||
|
|
||||||
|
moILS<TwoOpt> iterated_local_search (two_opt_initializer, two_opt_next_move_generator, two_opt_incremental_evaluation,
|
||||||
|
two_opt_selection, continu, comparator, perturbation, full_evaluation) ;
|
||||||
|
iterated_local_search(solution);
|
||||||
|
|
||||||
|
std :: cout << "[To] " << solution << std :: endl;
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam(std::string("../examples/tsp/benchs/berlin52.tsp"), "instancePath", "Path to the instance.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)time(0), "seed", "Seed for rand.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.getORcreateParam((unsigned int)1000, "maxIter", "Maximum number of iterations.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[iterated_local_search.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
|
|
@ -5,10 +5,5 @@
|
||||||
|
|
||||||
###### Configuration ######
|
###### Configuration ######
|
||||||
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
||||||
# --seed=1202919978 # Seed for rand.
|
# --seed=1203080388 # Seed for rand.
|
||||||
# --maxIter=1000 # Maximum number of iterations.
|
# --maxIter=1000 # Maximum number of iterations.
|
||||||
# --initialTemp=1000 # Initial temperature.
|
|
||||||
# --threshold=0.1 # Minimum temperature allowed.
|
|
||||||
# --expoRatio=0.98 # Ratio used if exponential cooling schedule is chosen.
|
|
||||||
# --lineaRatio=0.5 # Ratio used if linear cooling schedule is chosen.
|
|
||||||
# --coolSchedType=Expo # Type the cooling schedule: 'Expo' or 'Linear'.
|
|
||||||
|
|
|
||||||
|
|
@ -1,9 +0,0 @@
|
||||||
|
|
||||||
###### General ######
|
|
||||||
# --help=0 # -h : Prints this message
|
|
||||||
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
|
||||||
|
|
||||||
###### Configuration ######
|
|
||||||
# --instancePath=../examples/tsp/benchs/berlin52.tsp # Path to the instance.
|
|
||||||
# --seed=1203080388 # Seed for rand.
|
|
||||||
# --maxIter=1000 # Maximum number of iterations.
|
|
||||||
|
|
@ -0,0 +1,51 @@
|
||||||
|
######################################################################################
|
||||||
|
### 1) Include the sources
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src)
|
||||||
|
INCLUDE_DIRECTORIES(${EO_SRC_DIR}/src/utils)
|
||||||
|
INCLUDE_DIRECTORIES(${MO_SRC_DIR}/src)
|
||||||
|
INCLUDE_DIRECTORIES(${FUNCTION_SRC_DIR})
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 2) Specify where CMake can find the libraries
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${FUNCTION_BIN_DIR}/lib)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 3) Define your target(s): just an executable here
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
ADD_EXECUTABLE(minimize_function
|
||||||
|
ADD_DEPENDENCIES(minimize_function function)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 4) Optionnal: define your target(s)'s version: no effect for windows
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
SET(MINIMIZEFUNCTION_VERSION ${GLOBAL_VERSION})
|
||||||
|
SET_TARGET_PROPERTIES(minimize_function PROPERTIES VERSION "${MINIMIZEFUNCTION_VERSION}")
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
### 5) Link the librairies for your target(s)
|
||||||
|
######################################################################################
|
||||||
|
|
||||||
|
TARGET_LINK_LIBRARIES(minimize_function function eo eoutils)
|
||||||
|
|
||||||
|
######################################################################################
|
||||||
|
|
@ -0,0 +1,136 @@
|
||||||
|
/*
|
||||||
|
<minimize_function.cpp>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2008
|
||||||
|
(C) OPAC Team, LIFL, 2002-2008
|
||||||
|
|
||||||
|
Sébastien Cahon, Jean-Charles Boisson
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can use,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
As a counterpart to the access to the source code and rights to copy,
|
||||||
|
modify and redistribute granted by the license, users are provided only
|
||||||
|
with a limited warranty and the software's author, the holder of the
|
||||||
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <eo>
|
||||||
|
#include <mo>
|
||||||
|
#include <function>
|
||||||
|
|
||||||
|
void manage_configuration_file(eoParser & _parser);
|
||||||
|
|
||||||
|
int
|
||||||
|
main (int _argc, char* _argv [])
|
||||||
|
{
|
||||||
|
std::string selectionType;
|
||||||
|
double initialBound, searchBound, searchStep;
|
||||||
|
eoParser parser(_argc, _argv);
|
||||||
|
|
||||||
|
manage_configuration_file(parser);
|
||||||
|
|
||||||
|
initialBound=atof( (parser.getParamWithLongName("initialBound")->getValue()).c_str() );
|
||||||
|
searchBound=atof( (parser.getParamWithLongName("searchBound")->getValue()).c_str() );
|
||||||
|
searchStep=atof( (parser.getParamWithLongName("searchStep")->getValue()).c_str() );
|
||||||
|
selectionType=parser.getParamWithLongName("selectionType")->getValue();
|
||||||
|
|
||||||
|
Affectation solution;
|
||||||
|
|
||||||
|
AffectationInit initialize(initialBound);
|
||||||
|
initialize (solution);
|
||||||
|
|
||||||
|
AffectationEval evaluation;
|
||||||
|
evaluation (solution);
|
||||||
|
|
||||||
|
std::cout << "Initial affectation : " << std::endl;
|
||||||
|
std::cout << "\t x1 = " << solution.first << std::endl;
|
||||||
|
std::cout << "\t x2 = " << solution.second << std::endl;
|
||||||
|
std::cout << "\t f(x1,x2) = " << solution.fitness() << std::endl;
|
||||||
|
|
||||||
|
DeviationInit deviation_initializer(searchBound);
|
||||||
|
|
||||||
|
DeviationNext deviation_next_move_generator(searchBound, searchStep);
|
||||||
|
|
||||||
|
DeviationIncrEval deviation_incremental_evaluation;
|
||||||
|
|
||||||
|
moMoveSelect<Deviation>* deviation_selection;
|
||||||
|
|
||||||
|
if(selectionType.compare("Best")==0)
|
||||||
|
{
|
||||||
|
deviation_selection= new moBestImprSelect<Deviation>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("First")==0)
|
||||||
|
{
|
||||||
|
deviation_selection= new moFirstImprSelect<Deviation>();
|
||||||
|
}
|
||||||
|
else if (selectionType.compare("Random")==0)
|
||||||
|
{
|
||||||
|
deviation_selection= new moRandImprSelect<Deviation>();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[minimize_function.cpp]: the type of selection '"+selectionType+"' is not correct.");
|
||||||
|
}
|
||||||
|
|
||||||
|
moHC <Deviation> hill_climbing (deviation_initializer, deviation_next_move_generator, deviation_incremental_evaluation,
|
||||||
|
*deviation_selection, evaluation);
|
||||||
|
hill_climbing (solution) ;
|
||||||
|
|
||||||
|
std::cout << "Final affectation : " << std::endl;
|
||||||
|
std::cout << "\t x1 = " << solution.first << std::endl;
|
||||||
|
std::cout << "\t x2 = " << solution.second << std::endl;
|
||||||
|
std::cout << "\t f(x1,x2) = " << solution.fitness() << std::endl;
|
||||||
|
|
||||||
|
delete(deviation_selection);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
void
|
||||||
|
manage_configuration_file(eoParser & _parser)
|
||||||
|
{
|
||||||
|
std::ofstream os;
|
||||||
|
|
||||||
|
_parser.createParam((double)1, "initialBound", "Bound for the initial affectation.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.createParam((double)1, "searchBound", "Bound for neighbourhood exploration.", 0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.createParam((double)1, "searchStep", "Step between two values during the neighbourhood exploration.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
_parser.createParam(std::string("First"), "selectionType", "Type of the selection: 'Best', 'First' or 'Random'.",
|
||||||
|
0, "Configuration", false);
|
||||||
|
|
||||||
|
if (_parser.userNeedsHelp())
|
||||||
|
{
|
||||||
|
_parser.printHelp(std::cout);
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
|
||||||
|
os.open("current_param");
|
||||||
|
if(!os.is_open())
|
||||||
|
{
|
||||||
|
throw std::runtime_error("[minimize_function.cpp]: the file current_param cannot be created.");
|
||||||
|
}
|
||||||
|
os <<_parser;
|
||||||
|
os.close();
|
||||||
|
}
|
||||||
10
branches/cmakemodif/paradiseo-mo/tutorial/OldLesson/param
Normal file
10
branches/cmakemodif/paradiseo-mo/tutorial/OldLesson/param
Normal file
|
|
@ -0,0 +1,10 @@
|
||||||
|
|
||||||
|
###### General ######
|
||||||
|
# --help=0 # -h : Prints this message
|
||||||
|
# --stopOnUnknownParam=1 # Stop if unkown param entered
|
||||||
|
|
||||||
|
###### Configuration ######
|
||||||
|
# --initialBound=1 # Bound for the initial affectation.
|
||||||
|
# --searchBound=1 # Bound for neighbourhood exploration.
|
||||||
|
# --searchStep=1 # Step between two values during the neighbourhood exploration.
|
||||||
|
# --selectionType=First # Type of the selection: 'Best', 'First' or 'Random'.
|
||||||
Loading…
Reference in a new issue