Hybrid heuristic algorithm for two-echelon vehicle routing problem
双层车辆路径问题的混合启发式算法

Aiming at the two-echelon vehicle routing problem 2E-VRP closely related to city logistics, the paper put forward a kind of hybrid heuristic algorithm to solve 2E-VRP. In order to improve the solution quality and accelerate the convergence of algorithm, the algorithm took advantage of the rapidness of greedy algorithm, the search diversity of ant colony algorithm and the strong local optimization ability of local search algorithm. It applied the algorithm to 22 benchmark examples and 3 large-scale examples, and compared the results with similar studies. The experimental results show that the hybrid heuristic algorithm can not only guarantee a high accuracy, but also have high efficiency. Compare with the similar algorithm of the highest accuracy, although the hybrid heuristic algorithm performs somewhat less well in solution quality, but shows great advantage as far as the solving speed is concerned. The experimental results also show potential benefit of constructing the two-echelon city logistics system, and that setting satellites in certain conditions can significantly improve the city logistics effici-ency.