Yunhao Li, Huazhong University of Science and Technology

Abstract

In this paper, we propose an efficient heuristic algorithm for solving the vehicle routing problem with time windows. To minimize the total distance of the route, it is necessary to try out solutions with different numbers of routes. Therefore, the algorithm mainly includes two parts, the first part minimizes the number of routes, and the second one minimizes the total length of the route under given route numbers. In the first part, our algorithm is based on ejection pool (EP) [3] and customers’ penalty [4], routes weighting is applied in repair. In the second part, our algorithm is based on EAMA [5] and the ruin method [1].

[Challenge Paper]   [Video]