a novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. it is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. in this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (alns) with several specifically designed operators and features to solve the capacitated vehicle routing problem (cvrp). the effectiveness of the proposed algorithm was illustrated on the benchmark problems. the algorithm provides a better performance on large-scaled instances and gained advantage in terms of cpu time. in addition, we solved a real-life cvrp using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.