KTSP Solution Based on Workload Balance and Genetic

This paper focuses on the KTSP (K-person Traveling Salesman Problem) programming problem of workload balance. By adding a virtual central node, the KTSP problem is described as a TSP(Travelling Salesman Problem) problem with workload balance constraints. Then, 3-opt(3-optimization) is used for local optimization and genetic method is used to search the global optimal solution. Finally, the qualified solution is limited by workload balance constraints, and the workload balance algorithm is used to correct the results. The planning method in this paper is effective for the medium-sized workload balancing KTSP problem, and can obtain the ideal solution.