I want to find a suitable algorithm to solve the travelling salesman problem...but the algorithm must irrelevant to the evolutionary algorithms which mean not belongs to evolutionary algorithms but it can solve the problem and make an optimum solution.
.
some good resources there :
https://developers.google.com/optimization/routing/tsp
.
Look at Branch and Bound, which at least will guarantee an optimal solution. It may take time though:) https://en.wikipedia.org/wiki/Branch_and_bound
.
some good resources there :
https://developers.google.com/optimization/routing/tsp
.
For small instances you can try also:
https://en.wikipedia.org/wiki/Travelling_salesman_problem#Integer_linear_programming_formulation
The open source solver CONCORDE can solve large scale instances to proven optimality. See:
http://www.math.uwaterloo.ca/tsp/concorde.html
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Algorithms