Changes

Routing multiple addresses is quite a puzzle. With 20 destinations the from-to travel distance matrix has roughly 20 x 20 = 400 elements. The number of possible routes is even bigger, approximately 20 x 19 x 18 x ... x 3 x 2 x 1 = 2432902008176640000. Mathematicians call it a "hard" problem and there is no final one-size-fits-all solution available.

Yes indeedMathematicians call it a "hard" problem and there is no final one-size-fits-all solution available. They even have a name for it: ''The Travelling Salesman Problem''. Indeed, we humans can fly to the moon, but we can't solve this problem...

== Method == RouteXL optimizes routes with an search algorithm. That means that our routes may not always be optimal, but they're close enough. We use RouteXL uses a hybrid method, consisting of : * Initial: several insertion methods to build a good initial route from the ground up, continued with a number * Improvement: several of improvement methods and finally a quality inspired by k-opt optimization* Quality check. If : if the quality check fails, the improvement phase is repeated.