[rules-users] Travelling Salesman

[Lukáš Petrovický]

Hello,

I've been making myself familiar with Drools Planner and in the process
of doing so, I've hacked together a simple algorithm for optimizing the
Travelling Salesman Problem:

https://github.com/triceo/DroolingTSP

At this point, I get a 7 % improvement over a route with 71 stops, which
was previously assembled using a nearest-neighbor algorithm. The reason
why the improvement isn't bigger is that I'm stuck with Tabu search only
- for my use case, simulated annealing doesn't work at all. (Exits
forcefully after 1 to 7 steps, resulting in only a minimal improvement.)

I'll be interested in any comments and suggestions you might be able to
provide.

Best regards!

-- 
Lukáš Petrovický
QA Engineer, JBoss Enterprise BRMS

JBoss by Red Hat,
Czech Republic