Improved Ant Colony Algorithm for Solving VRP Problem under Capcity and Distance Constrains

In this paper,we start with the defects of slow convergence and being easy to fall into local optimum of ant colony algorithm in solving the practical problems.We present a modified version of the algorithm applied to the problem DCVRP by improving the transfer rules and local pheromonses,as well as introducing the candidate lists and 2-opt local search strategy to reduce computational time and eliminate bad path.By comparing different meta-heuristic methods,the experimental results indicate that the improved ACO has more advantags than other four main meta-heuristic algorithms.