My thesis including scripts about the Vehicle Routing Problem. In short: MCMC algorithms outperform local search in solution quality, speed and general applicability. Use them wisely. All code is in R. Tabu Search, PAralell Tempering, Simulated Annealling.