Επίλυση του προβλήματος του πλανόδιου πωλητή με τη χρήση γενετικών αλγορίθμων
Solving travelling salesman problem using genetic algorithms
View/ Open
Keywords
Γενετικοί αλγόριθμοι ; Πρόβλημα πλανόδιου πωλητήAbstract
In this thesis we’re trying to solve the travelling salesman problem or travelling salesperson
problem or TSP using genetic algorithms. The travelling salesman problem asks the following question:
"Given a list of cities and the distances between each pair of cities, what is the shortest possible route
that visits each city exactly once and returns to the origin city?". In our attempt to do an in-depth analysis
of the problem we wrote working code for all the algorithms we used.