ant3s.gif (2445 bytes)

Ant Colony System

Home Parameters Source Code Sample Runs Graphs

We supplied 7 Sample graphs with this applet:

graph13.tsp - A very simple graph with 13 cities. Solved very quickly.
input1.gif (8967 bytes)

graph12.tsp - Also a simple graph with 12 cities.
input2.gif (8869 bytes)

graph26.tsp - 26 Cities in this graph.
input3.gif (4305 bytes)

graph364.tsp - 364 cities in this graph! Kids - don't try this at home - it's going to take you a LONG time ! run this sample only if you have a VERY strong computer, and a LOT of patience. This diagram shows the best solution for this graph.
input4.gif (4448 bytes)

graph44.tsp - Graph with 44 cities. Very nice to see the algorithm progress on this graph.
input5.gif (3516 bytes)

graph88.tsp - A not so simple graph, with 88 cities. Even though it is usually solved within about 10 cycles. Very nice progress can be seen in this graph.
input6.gif (3855 bytes)

graph26b.tsp - Graph with 26 cities.
input7.gif (2268 bytes)

The next graphs were taken from TSPLIB. Please note that the best tour length might not be the same as you find in the applet, even if the applet finds the best tour.

Graph Best Tour Best Tour Length
st70.tsp st70.opt.tour 675
a280.tsp a280.opt.tour 2579
att48.tsp att48.opt.tour 10628
eil51.tsp eil51.opt.tour 426
berlin52.tsp berlin52.opt.tour 7542
eil101.tsp eil101.opt.tour 629
eil76.tsp eil76.opt.tour 538
kroA100.tsp kroA100.opt.tour 21282
kroA150.tsp   26524
kroA200.tsp   29368
kroB100.tsp   22141
kroB150.tsp   26130
kroB200.tsp   29437
kroC100.tsp kroC100.opt.tour 20749
kroD100.tsp kroD100.opt.tour 21294
kroE100.tsp   22068
lin105.tsp lin105.opt.tour 14379
lin318.tsp   42029
linhp318.tsp   41345
pr76.tsp pr76.opt.tour 108159
rat195.tsp   2323
rat99.tsp   1211
tsp225.tsp tsp225.opt.tour 126643
ulysses16.tsp ulysses16.opt.tour 6859
ulysses22.tsp ulysses22.opt.tour 7013
 

Click Here to Go Back Up