paradiseo/utilities/trunk/practices/paradiseo_practices_0208/lesson4/lesson4.tex
legrand cd32aa8d26 replaced examples's results
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1004 331e1502-861f-0410-8da2-ba01fb791d7f
2008-02-25 16:27:12 +00:00

95 lines
3.4 KiB
TeX

\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}