8
1
I have about 300 addresses in a city and I'm trying to find software that can solve the travelling salesman problem for it. I've tried OptiMap a browser based solution that uses the Google API but it's capped at 100 destinations (Even when you change hard coded limits) and the browsers I try eventually run out of memory. I know the problem is NP hard but this isn't a new problem, surely someone has written software already. The only commercial solutions I've seen are US based only (it's an Australian city) or have low limits.
Is there free or commercial software to accomplish this task and it's size?
2Perhaps you can solve the problem in chunks of 100. Can you break the locations into clusters and feed them to OptiMap in chunks. Then handle the transitions manually? – uSlackr – 2012-01-09T13:53:59.833
I've always seen the traveling salesman problem used as an example, something like a foobarbaz hello world thing. It's amusing to see that it has such a practical potential. By the way, NP hard or not, genetic algorithms will give an excellent (not perfect) solution in minutes or less. Also, 300 addresses? That looks like the kind of WTF situation that OptiMap devs did not account for. File a bug? – Camilo Martin – 2012-02-12T04:39:25.423
Search with these keywords: logistic software delivery optimization. There's many software dedicated for these kind of problem.http://duckduckgo.com/?q=logistic+software+delivery+optimization&t=1
– climenole – 2012-02-23T01:51:01.360