 |
Results of the
|
 |
|
|
Results of the
|
|
Congratulations go to the winner: Martin Byröd,
and to the close contenders:
Rok Sibanc, Jiaqiao Hu, and José Antonio Martín H.
Also of note is Bob MacCallum's GP evolved controller
The table below shows the best solution from each entrant, together with links to that solution, and a PDF file briefly describing the method.
Some observations:
Many use multi-stage optimisation methods
Variation operators are crucial (e.g. swap operator of Byröd).
All methods use mutation only (not crossover).
Some methods optimise the route incrementally from beginning to end (e.g. sliding window method of Byröd).
| Name + PDF | Route (nVectors, nForces, file) | Route Map |
|---|---|---|
| Martin Byröd [PDF] | 648, 636 [route.txt] |
 |
| Rok Sibanc [PDF] | 652, 652 [route.txt] |  |
| Jiaqiao Hu [PDF] | 689, 681 [route.txt] |
 |
| José Antonio Martín H. [PDF] | 692, 669 [route.txt] |  |
| Bob MacCallum [PDF] | 942, 941 [route.txt] |  |
Simon M. Lucas
Competitions Chair
GECCO 2005