Open Zia- opened 9 years ago
No, I'm not aware of anyone working on this. You could ask on the pgRouting mailing list as well.
I will label this as "Proposed Function", but at the moment this would probably require funding or contribution.
I think is more a feature request
May be there is already a solution inside pgRouting regarding how to solve Travelling Purchaser Problem (TPP). Kindly redirect me there or any old thread where similar issues have been discussed.
Travelling Salesman Problem (TSP) is an special case of TPP (https://en.wikipedia.org/wiki/Traveling_purchaser_problem) where we know all the starting, ending and intermediate nodes. But what if we are not sure which intermediate nodes because of many intermediate node options? I even tried to ask on gis.stackexchange (http://gis.stackexchange.com/questions/123528/solving-traveling-purchaser-problem) but couldn't get much info.
Before saying much I will wait for some comments. Is there any Feature Development already going on in pgRouting?