-2

I am searching some open-source Java code that can be used to solve Traveling Salesman Problem with Time Windows for a single vehicle. Since the problem is very typical, I hope that some open-source libraries are available. Probably, something related to "dynamic programming" or "column generation" methods.

So far, I have used Lagrangean Relaxation algorithm to find shortest route, however in case of time windows this approach is not proper.

Klausos Klausos
  • 12,932
  • 43
  • 120
  • 206
  • 1
    Did you consider using Simulated Annealing? – John Jun 20 '14 at 11:34
  • @John: no, do you have some link to this algorithm configured for solving TSPTW? – Klausos Klausos Jun 20 '14 at 11:44
  • Yeah @John is right.Try searching for implementation based on Simulated Annealing! I think this helps you :- http://www.theprojectspot.com/tutorial-post/simulated-annealing-algorithm-for-beginners/6 – Am_I_Helpful Jun 20 '14 at 11:44
  • _Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam._ – Beau Grantham Jun 20 '14 at 12:18

1 Answers1

4

Just take any Vehicle Routing Problem with Time Windows (VRPTW) implementation and add only 1 vehicle to get a TSP with TW.

Here's an open source (Apache License), Java implementation of VRPTW: Code - Docs - Video. But there are plenty more, just google for VRPTW.

Geoffrey De Smet
  • 22,431
  • 8
  • 59
  • 106