How to get the shortest path through multiple stops based on a raster cost layer?

Discussion created by roger7467 on Mar 28, 2014
Latest reply on Apr 8, 2014 by roger7467
To solve this problem, I need to find a way combine the Travelling salesman problem with cost path function.
I can run the cost path between each two stops which is quite inefficient and time consuming, and merge those path to create a road network. Then  run the shortest path.
I came up with two theories that could be faster, but I don't know how to do it.
1. make delaunay triangulation of all the stops based on the cost raster to generate a network automatically(batch for cost path function).
2. integrate the shortest path algorithm in network analysis into cost path function.

Does anyone have some other solutions?