Logistic Planning, 12 tour-conductors

The number of possibilities grows exponentially with the size of the problem. For twelve tour-conductors it is already undoable to find the optimum solution manually.

479 million odd combinations are simply impossible. A size 12 planning problem for tour-conductors

  • Even a fast computer that evaluates 1,000 solutions per second will need more than five days, nonstop.
  • For fifteen tour-conductors the computing time will be more than 41 years.
  • For twenty it will take more than 77 million years!
Brute computing force is not the solution here. This type of questions demands smart algorithms. SUMit's JAVA applet solves this type of problem in a fraction of a second.

SUMit has experience with this type of puzzle. Contact SUMit to explore possibilities.