TY - GEN
T1 - Solving the orienteering problem using attractive and repulsive particle swarm optimization
AU - Dallard, Herby
AU - Lam, Sarah S.
AU - Kulturel-Konak, Sadan
PY - 2007
Y1 - 2007
N2 - The initial study of this research applied the particle swarm optimization (PSO) heuristic to the orienteering problem (OP). PSO is a fairly new evolutionary heuristic-type algorithm created by Drs. Eberhart and Kennedy in 1995. Similar to ant colony optimization, motivation for PSO is nature-based on fish schooling and bees swarming. The OP is a variation of the well-known traveling salesmen problem (TSP) and is an NP-hard benchmark problem. Given a set of nodes with associated scores, the objective of the OP is to find a path that maximizes the total score subject to a given time (or distance) constraint. This paper presents an attractive and repulsive particle swarm optimization (ARPSO), which prevents PSO's weakness of premature convergence by maintaining solution diversity while retaining a rapid convergence. The ARPSO solves the OP with significant improvement in results when compared to PSO and is more competitive to known best published results.
AB - The initial study of this research applied the particle swarm optimization (PSO) heuristic to the orienteering problem (OP). PSO is a fairly new evolutionary heuristic-type algorithm created by Drs. Eberhart and Kennedy in 1995. Similar to ant colony optimization, motivation for PSO is nature-based on fish schooling and bees swarming. The OP is a variation of the well-known traveling salesmen problem (TSP) and is an NP-hard benchmark problem. Given a set of nodes with associated scores, the objective of the OP is to find a path that maximizes the total score subject to a given time (or distance) constraint. This paper presents an attractive and repulsive particle swarm optimization (ARPSO), which prevents PSO's weakness of premature convergence by maintaining solution diversity while retaining a rapid convergence. The ARPSO solves the OP with significant improvement in results when compared to PSO and is more competitive to known best published results.
UR - http://www.scopus.com/inward/record.url?scp=47949126562&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47949126562&partnerID=8YFLogxK
U2 - 10.1109/IRI.2007.4296590
DO - 10.1109/IRI.2007.4296590
M3 - Conference contribution
AN - SCOPUS:47949126562
SN - 1424414997
SN - 9781424414994
T3 - 2007 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2007
SP - 12
EP - 17
BT - 2007 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2007
T2 - 2007 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2007
Y2 - 13 August 2007 through 15 August 2007
ER -