Abstract
In this paper, a metaheuristic hybridized for solving the Capacity Vehicle Routing Problem (CVRP) is proposed. The classical simulated annealing is combined with Saving’s Algorithm (Clarke-Wright Algorithm) in order to obtain solution of CVRP with stochastic demand. This approach was tested with different solomon’s instances of CVRP. Simulated Annealing is a simulation of heating and cooling of a metal to solve an optimization problem. Saving’s algorithm is a deterministic heuristic for solving the Capacity Vehicle Routing Problem. In order to generate high quality solution of CVRP, our approach applies Saving’s algorithm into Metropolis Cycle of Simulated Annealing. Initial solution of Simulated Annealing is also generated by Saving’s Algorithm. This new approach has lead to increase the quality of the solution to CVRP with respect to the classical Simulated Annealing algorithm and classical Saving’s Algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call