First, simulated annealing is a metaheuristic method, it need operators to carry out the changes in the solution, so there is no "simulated annealing alone", it is always coupled with other methods, the better the mix, the better the solutions generated. Second, except for very small instances, a VRP is hardly "solved" to optimality. Regardless, simulated annealing with very simple operators (such as inter-route change and insertion) does not give such good results.

E. H. L. Aarts has written:

'Simulated annealing and Boltzmann machines' -- subject(s): Machine theory, Neural computers, Simulated annealing (Mathematics)

pleas send to me a sample program fro SA by Matlab

Simulated annealing is a probabilistic optimization technique inspired by the annealing process in metallurgy. It is used to find good solutions to problems with large search spaces by exploring a diverse set of potential solutions and gradually reducing the search space over time. The method involves iteratively adjusting the temperature parameter to balance exploration of new solutions with exploitation of promising ones.

Mark Jerrum has written:

'Simulated annealing for graph bisection' -- subject(s): Simulated annealing (Mathematics)

'Counting, sampling and integrating'

'Uniform sampling modulo a group of symmetries using Markov chain simulation' -- subject(s): Simulation methods, Distribution (Probability theory), Markov processes

'Fast uniform generation of regular graphs'