replaced examples's results
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1004 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
c2e63fce73
commit
cd32aa8d26
8 changed files with 63 additions and 38 deletions
|
|
@ -41,17 +41,23 @@ Lesson 2: Implement a Hill-Climbing 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] -3435 101 36 55 54 65 50 80 14 27 46 15 93 58 78 47 99 64 68}\\
|
||||
\texttt{49 72 81 82 76 41 16 66 30 29 83 95 71 38 35 19 5 63 26 43 96 79 52}\\
|
||||
\texttt{59 69 7 56 37 3 32 28 9 13 1 91 31 73 11 40 62 17 24 45 88 6 85 22}\\
|
||||
\texttt{18 20 44 94 12 33 60 89 74 42 97 21 100 57 77 92 98 51 2 25 75 10 86}\\
|
||||
\texttt{8 23 67 70 34 90 87 48 53 0 39 4 84 61}\\
|
||||
\texttt{[To] -708 101 36 97 91 58 95}\\
|
||||
\texttt{98 92 84 99 90 43 13 37 85 15 60 16 83 4 59 82 44 7 45 35 48 63 10}\\
|
||||
\texttt{18 46 47 81 17 51 26 27 25 39 57 52 100 88 5 93 94 12 1 56 86 96 41}\\
|
||||
\texttt{42 14 40 21 73 71 72 20 3 55 74 22 66 38 24 54 53 23 28 78 2 76 67}\\
|
||||
\texttt{79 11 75 68 0 49 32 80 77 33 50 8 34 70 64 65 19 29 69 31 89 62 9 30}\\
|
||||
\texttt{87 6 61}\\
|
||||
|
||||
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{Tabu search}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue