Hybrid Simulated annealing method with local search for the Capacitated vehicle routing problem

Source abstract

The paper considers the Capacitated Vehicle Routing Problem (CVRP), which belongs to the class of NP-hard combinatorial optimization problems. A hybrid algorithm based on simulated annealing with integrated local search, probabilistic TOP-k selection and reheating mechanism is proposed. Computational experiments were carried out on benchmark instances sets. Experimental results demonstrate that the proposed approach provides more stable convergence and improves solution quality in comparison with classical simulated annealing.