How can I solve the TSP according to Lin–Kernighan algorithm?

6 vues (au cours des 30 derniers jours)

Ang Vas le 18 Avr 2016

Modifié(e) : Walter Roberson le 18 Avr 2016

Hello everybody

I want to use a program in order to solve the Travel Salesman Problem and I found this one http://www.mathworks.com/matlabcentral/fileexchange/24857-another-tsp-solver/content/solveTSP.m which is working perfectly. What I want to ask, due to I am not very keen with Matlab is whether this program solves the TSP according to Lin–Kernighan algorithm or not

MATLAB Mathematics Graph and Network Algorithms Shortest Path Traveling Salesman (TSP)

En savoir plus sur Traveling Salesman (TSP) dans Help Center et File Exchange

Find the treasures in MATLAB Central and discover how the community can help you!

Translated by