An effective PSO-inspired algorithm for the team orienteering problem - Archive ouverte HAL
Journal Articles European Journal of Operational Research Year : 2013

An effective PSO-inspired algorithm for the team orienteering problem

Abstract

The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profi t gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired algorithm (PSOiA) to solve the problem. Experiments conducted on the standard benchmark of TOP clearly show that our algorithm outperforms the existing solving methods. PSOiA reached a relative error of 0.0005% whereas the best known relative error in the literature is 0.0394%. Our algorithm detects all but one of the best known solutions. Moreover, a strict improvement was found for one instance of the benchmark and a new set of larger instances was introduced.
Fichier principal
Vignette du fichier
paper-top-psoia.pdf (351.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00934974 , version 1 (22-01-2014)

Identifiers

Cite

Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim. An effective PSO-inspired algorithm for the team orienteering problem. European Journal of Operational Research, 2013, 229 (2), pp.332 - 344. ⟨10.1016/j.ejor.2013.02.049⟩. ⟨hal-00934974⟩
283 View
605 Download

Altmetric

Share

More