Turkish Journal of Electrical Engineering and Computer Sciences
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 operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solutions in a short time compared to previous heuristics for the TOP.
Particle swarm optimization, reduced variable neighborhood search, team orienteering problem, vehicle routing problem with profits
ŞEVKLİ, AİŞE ZÜLAL and SEVİLGEN, FATİH ERDOĞAN
"Discrete particle swarm optimization for the team orienteering problem,"
Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 20:
2, Article 4.
Available at: https://journals.tubitak.gov.tr/elektrik/vol20/iss2/4
Computer Engineering Commons, Computer Sciences Commons, Electrical and Computer Engineering Commons