Brest State Technical University, Course "Contemporary Intelligent Information Technology (CIIT)"

From Students' Works (2013)



  • In TSP with 5 cities, e.g., we can calculate the tour of minimum length by hand ... By Krivitski Andrei
    => A little unusual but he create distance matrix at random instead of creating cities at random.




    • => (Left) Distance matrix of a random creation of 5 cities; (Center ) The length of all possible (5-1)!/2=12 cities; (Right) GA converges to the minimum tour of 138.8
  • Yet another minimum length tour of 5 cities TSP ... By Popko Andrey
    Assuming the starting city Brest at (0,0), 4 cities to be visited are created at random as Minsk (10,5), Pinsk (7,9), Kobrin (5,4), Prygani (3,2)

  • In TSP with 5 cities, e.g., we can calculate the tour of minimum length by hand ... By Evhuh Alexandr




    • => (Left) The shortest route in each generation, which suggest the search is somehow random and seems a lucky success
  • In TSP with 5 cities, e.g., we can calculate the tour of minimum length by hand ... By Boiko Svetlana




    • => In this case the evolution is rather normal but the route might be not smallest, i.e., trapped to a local minimum
  • A challenge to the TSP with 100 cities. ... By Danilchyk Roman




    • => Does the tour look like minimum?
  • What if all cities exactly on a circle ... By Alexander Mokin