moved utilities and contribution in branchez

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

branches/utilities/trunk/practices/paradiseo_practices_0208/lesson4/CMakeLists.txt

@@ -0,0 +1,41 @@
+
+
+######################################################################################
+### 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(${CMAKE_SOURCE_DIR}/tsp/src)
+######################################################################################
+
+
+######################################################################################
+### 2) Specify where CMake can find the libraries
+######################################################################################
+
+LINK_DIRECTORIES(${EO_BIN_DIR}/lib ${CMAKE_BINARY_DIR}/tsp/src)
+
+######################################################################################
+
+
+######################################################################################
+### 3) Define your target(s): just an executable here
+######################################################################################
+
+ADD_EXECUTABLE(simulated_annealing simulated_annealing.cpp) 
+
+ADD_DEPENDENCIES(simulated_annealing tsp)
+######################################################################################
+
+
+######################################################################################
+### 4) Link the librairies for your target(s)
+######################################################################################
+
+TARGET_LINK_LIBRARIES(simulated_annealing tsp eo eoutils) 
+
+######################################################################################
+
+

branches/utilities/trunk/practices/paradiseo_practices_0208/lesson4/lesson4.tex

@@ -0,0 +1,95 @@
+\documentclass[a4paper]{article}
+
+\usepackage[english]{babel}
+\usepackage{epsf}
+\usepackage{amssymb}
+\usepackage{here}
+\usepackage{comment}
+\usepackage{graphicx}
+
+\topmargin -2.5cm
+\textheight 25,5cm
+\textwidth 16cm
+\oddsidemargin 0cm
+\evensidemargin 0cm
+
+
+\begin{document}
+
+\textbf{ParadisEO Practices}  {\copyright Franck Seynhaeve,
+Jean-Charles Boisson, Thomas Legrand} \Large{\textbf{\\\\
+Lesson 4: Implement a tabu search using ParadisEO}}
+
+\normalsize
+
+\vspace{-0,3cm}
+
+\section{Example}
+
+    The archive {\tt paradiseo\_practices\_0208.tgz} installed
+    on your computer contains a tabu search implemented using ParadisEO-MO~
+    (see {\tt tabu\_search} in the {\bf build/lesson4} directory).
+
+    \medskip
+    To run it, please go in {\bf build/lesso4} and start the program {\tt tabu\_search} by giving
+    one of the TSP instances located in {\bf tsp/benchs}.
+
+
+    \medskip
+    When entering {\tt ./tabu\_search ../../tsp/benchs/berlin52.tsp}, you should end up with the
+    following outputs:
+
+    \smallskip
+    \noindent
+    \texttt{>>> Loading [../../tsp/benchs/eil101.tsp]}\\
+    \texttt{> [From] -3347  101 84 20 57 71 92 19 59 10 30 55 27 63 36 26 18 21 46}\\
+    \texttt{>72 96 35 39 24 29 86 60 40 34 48 67 38 13 0 5 11 16 83 49 50 6 7 87}\\
+    \texttt{>1 53 90 74 52 58 15 8 95 25 68 61 70 65 45 33 79 23 62 4 37 91 85 78}\\
+    \texttt{>89 47 69 28 32 66 80 75 94 41 100 44 73 22 9 76 64 97 31 88 51 93 43}\\
+    \texttt{>2 3 14 56 99 12 82 81 42 17 54 98 77}\\
+    \texttt{>[To] -703  101 84 92 98 95 58}\\
+    \texttt{>91 36 97 90 99 41 86 96 94 12 93 5 88 17 51 68 0 49 76 75 27 26 100}\\
+    \texttt{>52 57 39 25 11 79 67 2 78 28 23 53 54 24 3 38 66 22 55 74 21 40 73}\\
+    \texttt{>71 20 72 1 56 14 42 13 43 37 85 15 60 4 59 82 83 16 44 45 7 81 6 47}\\
+    \texttt{>18 46 35 48 63 10 62 89 31 9 61 87 30 69 29 19 50 32 80 8 70 65 64}\\
+    \texttt{>34 33 77}\\
+
+    The printed-out results show for the initial best solution and the final one~:
+    \\ \hspace*{0.5cm}-the length of the route
+    \\ \hspace*{0.5cm}-the number of cities
+    \\ \hspace*{0.5cm}-the route itself (notice that the city index starts from 0).
+
+
+\section{Study the tabu search dedicated components}
+
+     Study the {\tt tabu\_search.cpp} file located in the {\bf lesson4} directory
+    using~:
+    \begin{itemize}
+       \item[$\bullet$] the ParadisEO-MO API documentation available at~:
+
+       \hspace{1cm}http$\,:$//paradiseo.gforge.inria.fr/addon/paradiseo-mo/doc/index.html
+       \item[$\bullet$] the source files located in the {\bf tsp/src/} directory
+    \end{itemize}
+
+\section{Customize the tabu search}
+
+   Make a backup (copy) of the cpp file {\tt tabu\_search.cpp}. You can now modify the
+   original {\tt tabu\_search.cpp} and use the existing makefiles to compile it.
+
+   Edit and modify the {\tt tabu\_search.cpp} file~:
+    \begin{itemize}
+       \item[$\bullet$] Try to tune a few parameters of the tabu search.
+       \item[$\bullet$] Change the initialization of the solution by
+       modifying the file {\tt route\_init.cpp}.
+    \end{itemize}
+
+    \smallskip
+    To compile {\tt tabu\_search.cpp},you should use the
+    command {\tt make} from {\bf build/lesson4}.
+
+    \medskip
+    Finally, test your modifications on several TSP instances ({\tt berlin52},
+    {\tt eil101} ...) and compare the results you get.
+
+
+\end{document}

branches/utilities/trunk/practices/paradiseo_practices_0208/lesson4/simulated_annealing.cpp

@@ -0,0 +1,67 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+// "simulated_annealing.cpp"
+
+// (c) OPAC Team, LIFL, 2003-2006
+
+/* LICENCE TEXT
+
+   Contact:  paradiseo-help@lists.gforge.inria.fr
+*/
+
+#include <mo.h>
+
+#include <graph.h>
+#include <route.h>
+#include <route_eval.h>
+#include <route_init.h>
+
+#include <two_opt.h>
+#include <two_opt_rand.h>
+#include <two_opt_incr_eval.h>
+
+int
+main (int __argc, char * __argv []) 
+{
+  if (__argc != 2) 
+    {
+      std :: cerr << "Usage : ./simulated_annealing [instance]" << std :: endl ;
+      return 1 ;
+    }
+  
+  Graph :: load (__argv [1]) ; // Instance
+
+  Route route ; // Solution
+  
+  RouteInit init ; // Sol. Random Init.
+  init (route) ;
+
+  RouteEval full_eval ; // Full. Eval.
+  full_eval (route) ;
+  
+  std :: cout << "[From] " << route << std :: endl ;
+  
+  /* Tools for an efficient (? :-))
+     local search ! */
+  
+  TwoOptRand two_opt_rand ; // Route Random. Gen.
+     
+  TwoOptIncrEval two_opt_incr_eval ; // Eff. eval.
+  
+  TwoOpt move ;
+  
+  moExponentialCoolingSchedule cool_sched (0.1, 0.98) ; // Exponential Cooling Schedule 
+  //moLinearCoolingSchedule cool_sched (0.1, 0.5) ; // Linear Cooling Schedule 
+  
+  moGenSolContinue <Route> cont (1000) ; /* Temperature Descreasing
+					    will occur each 1000
+					    iterations */ 
+  
+  moSA <TwoOpt> simulated_annealing (two_opt_rand, two_opt_incr_eval, cont, 1000, cool_sched, full_eval) ;
+  simulated_annealing (route) ;
+
+  std :: cout << "[To] " << route << std :: endl ;
+  
+  return 0 ;
+}
+