Critical-edge based tabu search algorithm for solving large-scale multi-vehicle Chinese postman problem

Abstract

Abstract The min–max multi-vehicle Chinese postman problem is an NP-hard problem, which is widely used in path planning problems based on road network graphs, such as urban road structure probing planning, urban road underground cavity detection planning, high-voltage line inspection planning, and so on. With the rapid increase in the number of nodes and connections of road network graph, the solution time and path equilibrium constraints pose new challenges to the problem solving. In this paper, we propose a critical-edge tabu search algorithm, CTA-kroutes, for solving the min–max multi-vehicle postman problem for large-scale road networks. First, the initial solution with balanced path lengths is obtained by segmenting the Eulerian paths; second, the critical edges are moved in the initial solution to construct the neighborhood solution, and the tabu search algorithm is used to find the optimal solution iteratively; and lastly, the solution optimization algorithm is used at the end of each iteration to de-duplicate and optimally reconstruct the current search result. Experiments show that the CTA-kroutes algorithm can effectively improve the equalization of multi-vehicle paths and its applicability to large-scale road networks.