April 15, 2014 3:37 pm

Travelling salesman problem

 

Travelling salesman problem

In literature is TSP often used as test problem.”Salesman” have to visit every “city” from his list. Distances from-to each city are known. Salesman’s goal is to find shortest way and each city has to be visited just once. By solving this problem we mean looking for optimal order of cities. It’s clear that it is in fact combinatoric problem with N! solutions (where N is number of the cities). Fitness is sum of all distances between visited cities:

 

Sample input :

 

Framework pyGene

 

fitness/time

best fitnesses of 10 evolution executions

Best solution found (fitness 3534):

 Download:

 

Framework AForge.NET

 

fitness/time

best fitnesses of 10 evolution executions

Best solution found (fitness 3404):

 Download:

 

Framework AjGa

 

fitness/time

best fitnesses of 10 evolution executions

Best solution found (fitness 3198):

 Download:

 

Tagy:

@cisary on twitter


Bitcoin, web applications, constraint processing, AI, soft-computing - evolution inspired algorithms, integration with the blockchain technology and more.    


Contact



Agile Software Development


cisary @ Github cisary @ Bitbutcket






Newest articles





Twitter & Delicious




  • New (beta) website