I am using a brute force approach to solve a version of the traveling salesman problem. I am looking into ways to optimize it but there are many. Basically I need help further defining the problem and how to solve it optimally.
Given
[path] [start city] [end city] [distance]
P1 C1 C2 100
P2 C2 C1 400
P3 C1 C3 300
P4 C3 C1 200
P5 C2 C3 100
P6 C3 C2 400
Determine the shortest path which tours all the cites. Currently i check all possibilities using all combinations nCk where n = 6 and 3 <= k <= 6, filter these solutions to make sure all cities can be reached and finally choose the one with the lowest cost.
Thanks
