VNS-annealing Algorithm for CVRPTW

When VRP(vehicle routing problem) is solved with the traditional single method,the quality of the results is usually low,so this paper presents a novel hybrid-heuristic algorithm.Firstly,the initial solution is generated with the nearest neighbor heuristic algorithm,then it is improved with VNS——Annealing algorithm.Experimental results show that the hybrid algorithm can solve the VRP effectively and efficiently.