nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

replaced examples's results

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1004 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
legrand 2008-02-25 16:27:12 +00:00
commit cd32aa8d26
8 changed files with 63 additions and 38 deletions
Download patch file Download diff file Expand all files Collapse all files

23
utilities/trunk/practices/paradiseo_practices_0208/lesson4/lesson4.tex
View file

@ -41,16 +41,23 @@ Lesson 4: Implement a tabu search using ParadisEO}}
\smallskip
\noindent
\texttt{>> Loading [../tsp/benchs/berlin52.tsp]}\\
\texttt{[From] -29414 52 1 20 40 48 9 27 13 22 5 28 24 29 21 26 44 38 33 37 45 31 42 18 12 3 14}\\
\texttt{36 30 6 51 32 17 11 0 34 4 10 4350 16 2 23 35 19 46 49 39 25 15 41 8 7 47}\\
\texttt{[To] -8724 52 1 6 41 29 22 19 49 15 28 46 13 51 12 25 26 27 11 10 50 32 42 9 8 7 40 18}\\
\texttt{44 2 16 20 30 17 21 0 31 48 35 3438 39 37 36 33 43 45 24 3 5 4 14 23 47}\\
\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*{1cm}-the length of the route
\\ \hspace*{1cm}-the number of cities
\\ \hspace*{1cm}-the route itself (notice that the city index starts from 0).
\\ \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}