Research on Generalized Traveling Salesman Problem based on Modified Ant Colony Optimization

The generalized traveling salesman problem(GTSP) is a typical combinatorial optimization problem. Many practical problems involving the allocation and optimization of multiple tasks can be reduced to the generalized traveling salesman problem. A modified ant colony optimization is proposed for GTSP. The modified ant colony algorithm combines 2-opt algorithm to minimize the total path length, while considering the task balance of different travelers. Simulation results show that the modified ant colony optimization has good optimization accuracy and stability in solving the generalized traveling salesman problem.