Discrete particle swarm optimization for the team orienteering problem

摘要

In this paper, a novel discrete particle swarm optimization(PSO) algorithm is proposed to solve the team orienteering problem(TOP). Discrete evaluation is achieved by redefining all operatorsand operands used in PSO. To obtain better results, a strengthenedPSO, which improves both exploration and exploitation during thesearch process, is employed. Our algorithm achieves the best knownsolutions in a short time compared to previous heuristics for the TOP.