抄録
This paper is concerned with the discrete combinatorial optimization problem. A modified hybrid algorithm that combines the max-min ant system and set-based particle swarm optimization (MSPSO) is proposed to solve the traveling salesman problem (TSP). To avoid a local solution, the cooperative mechanism among individuals is applied in MSPSO. MSPSO is based on set-based particle swarm optimization (SPSO). Before the execution of SPSO, max-min ant system (MMAS) is executed to accelerate the convergence of the algorithm. The results of the numerical experiments show that the proposed approach is effective for solving the TSP.
