Search

For the capacitated vehicle routing problem(CVRP),this paper proposed an imperialist competitive algorithm which integrated a split mechanism to solve the problem.Firstly,combined with the characteristics of CVRP,this algorithm used the encoding and decoding strategies based on greedy criteria to switch from the algorithm space to the solution space.Secondly,this algorithm presented an imperialist splitting mechanism to improve the global search ability of the algorithm,and simultaneously combined with the 2-Opt algorithm to enhance the local search ability.Finally,the results of simulation experiments with 25 benchmark examples indicate that:the proposed algorithm can effectively solve CVRP,and the optimization errors of all examples are less than 1.0%.Furthermore,the proposed algorithm is more efficiently than the existing imperialist competitive algorithms,particle swarm optimization algorithm,genetic algorithm and cuckoo search algorithm. [ABSTRACT FROM AUTHOR]