摘要：In this paper, a two phase algorithm for solving the dynamic capacitated vehicle routing problems with soft time windows is proposed. In phase one an ant colony optimization algorithm is used to find solution for static data of problem. In second phase, an improved heuristic algorithm based on insertion heuristic is used to solve the problem in presence of dynamic arrivals of new customer orders. The proposed algorithm has been performed on the Solomon R and RC problems. The results are evaluated through a measure denoted as the value of information. Evaluating the solution by two factors (objective function and no. of vehivles) indicate that the results of the proposed algorithm are approximately equal to the solution of static problem for degree of dynamism of 10% in problem R1,R2,RC1 and appropriate for the other situation.
关键词：Dynamic;capacitated;vehicle;routing;windows (DCVRPTW);ant colony optimization (ACO);insertion heuristic;metaheuristics;degree of dynamism
