Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Abstract EN

As we all know, there are a great number of optimization problems in the world.

One of the relatively complicated and high-level problems is the vehicle routing problem (VRP).

Dynamic vehicle routing problem (DVRP) is a major variant of VRP, and it is closer to real logistic scene.

In DVRP, the customers’ demands appear with time, and the unserved customers’ points must be updated and rearranged while carrying out the programming paths.

Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades.

In this paper, we have two main contributions to solving DVRP.

Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO), which is the traditional Ant Colony Optimization (ACO) fusing improved K-means and crossover operation.

K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely.

Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method.

In the experiment, the results for different scale problems are compared to those of previously published papers.

Experimental results show that the algorithm is feasible and efficient.