Discrete particle swarm optimization for the team orienteering problem

Authors

AİŞE ZÜLAL ŞEVKLİ
FATİH ERDOĞAN SEVİLGEN

DOI

10.3906/elk-1101-1008

Abstract

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.

Keywords

Particle swarm optimization, reduced variable neighborhood search, team orienteering problem, vehicle routing problem with profits

First Page

231

Last Page

239

Recommended Citation

ŞEVKLİ, AİŞE ZÜLAL and SEVİLGEN, FATİH ERDOĞAN (2012) "Discrete particle swarm optimization for the team orienteering problem," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 20: No. 2, Article 4. https://doi.org/10.3906/elk-1101-1008
Available at: https://journals.tubitak.gov.tr/elektrik/vol20/iss2/4