Date Added: Jan 2012
In this paper proposed variant of Simulated Annealing algorithm (SA) for solving Capacitated Vehicle Routing Problem (CVRP). The main difference between the authors' approach and the classical SA is that, their approach dynamically changes the temperature during the search process. The adaptive temperature control is used that changes temperature based on the number of consecutive improving moves. The Capacitated Vehicle Routing Problem (CVRP) is a well known problem and it has been one of the most studied combinatorial optimization problems during the last decades. Simulation results are reported on twenty large-scale benchmark instances. Results show that the proposed approach to be very competitive with the best-known methods.