Greeating!
I am wondering how to specify the problem of the traveling salesman problem (TSP) with different starting and ending nodes. I am able to replicate the proc optnetwork example below described in the SAS manual:
proc optnetwork direction = directed logLevel = moderate links = mycas.LinkSetIn outNodes = mycas.NodeSetOut; tsp out = mycas.TSPTour; run;
But the example only applies to a TSP problem where the salesman goes back to the same node he started from. The problem I want to solve relaxes that requirement -- he only need to go to every node without returning to the starting point.
Any help would be highly appreciated!
Bo
Thanks, Rob!
Calling @RobPratt
Thanks, Rob!
Available on demand!
Missed SAS Innovate Las Vegas? Watch all the action for free! View the keynotes, general sessions and 22 breakouts on demand.
Learn how to run multiple linear regression models with and without interactions, presented by SAS user Alex Chaplin.
Find more tutorials on the SAS Users YouTube channel.