Travelling Salesman Problem; Vehicle Routing Problem

Today I added some algorithms for graphs. I also tried to find a suitable solution for the travelling salesman - problem. The problem is, that the default-rekursion takes too much time to find the solution. When the number of towers exceeds 15, it will take years to calculate the result, so a heuristic-mechanism is required to find out a quite suitable solution. Therefore the Minimum-Spanning-Tree-Heuristik or the Christofides-Heuristik may be suitable. I also tried to find a suitable algorithm for the vehicle-routing problem. The following site delivers lots of additional information: VRP-Web