Geek Answers Handbook

Salesman Problem Constraint Presentation

I read a couple of articles and sample code on how to solve TSP with genetic algorithms and Ant colony optimization, etc. But all I found did not include time limits (windows), for example. "I have to be with client x until 12 in the morning," and took symmetry.

Can someone point me to some sample code or article that explains how I can add restrictions to TSP and how I can represent them in code.

Thanks!

+6
algorithm genetic-algorithm traveling-salesman
source share
2 answers

Professor Reynelt of the University of Heidelburg in Germany is one of the leading experts in TSP. He has a collection of papers on various TSP options.

see http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

I think your option is called the problem of routing cars with Time Windows. ( http://en.wikipedia.org/wiki/Vehicle_routing_problem )

+6
source share

You should take a look at what the most up-to-date in Domain Independent Planning can do for you: http://ipc.informatik.uni-freiburg.de/

+2
source share

More articles:


All Articles