[pgrouting-dev] Traveling salesman problem where cost <> reverse cost

[Stephen Woodbridge]

On 6/15/2013 5:21 PM, Dave Potts wrote:
> Hi Stephen,
>
> I will add some tests to that code I wrote.
>
> Are you aware of a tsp algorithm that handles an issue when the cost and
> reverse cost for traveling between two nodes are different?

Yes it is called ATSP or asymmetric TSP. I would like to find code and 
implement that for pgrouting 2.1.

google: asymmetric tsp approximation

http://faculty.cs.tamu.edu/chen/courses/cpsc669/f2005/reading/chrisp.pdf

-Steve