Skip to content

Commit e052111

Browse files
committed
Modifies README
1 parent cbbdaa7 commit e052111

File tree

1 file changed

+6
-8
lines changed

1 file changed

+6
-8
lines changed

README.md

+6-8
Original file line numberDiff line numberDiff line change
@@ -16,18 +16,16 @@ A TSP user friendly Solver.
1616

1717
TSPSolver allows to plot the solutions found with the algorithms. Here we present some examples on the instance eil101, with 101 cities. More TSP problems can be found in [TSPLIB](http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/index.html).
1818

19-
### Optimal Solution
19+
### Optimal Solution - Objective function: 629
2020
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-SolucionOptima-629.png)
21-
### Snug GA
22-
23-
### Simulating Annealing
21+
### ACO (with Lin-Kernighan local search) - Objective function: 631
22+
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-ACO-1.93seg-631.png)
23+
### Simulating Annealing - Objective function: 665
2424
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-SA-665.68-1.3seg-10000iter.png)
25-
### GRASP
25+
### GRASP - Objective function: 677
2626
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-GRASP-300iteraciones-677-1.37seg.png)
27-
### ILS
27+
### ILS - Objective function: 690
2828
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-ILS-120iteraciones-690-1%2C49sec.png)
29-
### Nearest Neighbor Algorithm
30-
![](https://github.com/andreshp/TSPSolver/blob/master/Images/eil101-VMC-736.368-0.01636seg.png)
3129

3230

3331
## Authors

0 commit comments

Comments
 (0)