摘要：In this paper, a capacitated vehicle routing problem with time windows (CVRPTW) is presented. In this work, a new idea for calculating the heuristic value to improve the performance of ant colony algorithms when solving capacitated vehicle routing problems with hard time windows is proposed. The performance of the model and the heuristic approach are evaluated by Solomons VRPTW benchmark problems. The results show that in 14 problem instances, our solutions are better than the best solutions reported for the VRPTW by other researchers in both total traveling distance and number of used vehicles. Our solutions superiority over the best solutions published in the literature are in instances R1, R2 and Particularly RC2 such a way that the average number of used vehicles are considerably less.
关键词：Capacitated vehicle routing problem with time windows (CVRPTW);ant colony optimization (ACO);combinatorial optimization problems;metaheuristics
