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, ...