A particle swarm optimization approach to the orienteering problem

Herby Dallarad; Sarah S.Y. Lam; Sadan Kulturel-Konak

A particle swarm optimization approach to the orienteering problem

Herby Dallarad, Sarah S.Y. Lam, Sadan Kulturel-Konak

Division of Engineering, Business & Computing (Berks)

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

Abstract

Particle Swarm Optimization (PSO), developed by Kennedy and Eberhart in 1995, was inspired by social behavior of birds flocking or fish schooling. It is a population-based algorithm, where a swarm of particles fly in a multi-dimensional space, guided by their social dynamics while optimizing an objective function. The Orienteering Problem (OP), a variation of the traveling salesman problem, is a 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 addresses the design of a PSO algorithm to solve one of the problem instances of the OP and discusses the preliminary results.

Original language	English (US)
State	Published - 2006
Event	2006 IIE Annual Conference and Exposition - Orlando, FL, United States Duration: May 20 2006 → May 24 2006

Other

Other	2006 IIE Annual Conference and Exposition
Country/Territory	United States
City	Orlando, FL
Period	5/20/06 → 5/24/06

All Science Journal Classification (ASJC) codes

Industrial and Manufacturing Engineering

Cite this

@conference{dbfa01c9f84c4f959f1f49d8e839b0da,

title = "A particle swarm optimization approach to the orienteering problem",

abstract = "Particle Swarm Optimization (PSO), developed by Kennedy and Eberhart in 1995, was inspired by social behavior of birds flocking or fish schooling. It is a population-based algorithm, where a swarm of particles fly in a multi-dimensional space, guided by their social dynamics while optimizing an objective function. The Orienteering Problem (OP), a variation of the traveling salesman problem, is a 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 addresses the design of a PSO algorithm to solve one of the problem instances of the OP and discusses the preliminary results.",

author = "Herby Dallarad and Lam, {Sarah S.Y.} and Sadan Kulturel-Konak",

year = "2006",

language = "English (US)",

note = "2006 IIE Annual Conference and Exposition ; Conference date: 20-05-2006 Through 24-05-2006",

}

TY - CONF

T1 - A particle swarm optimization approach to the orienteering problem

AU - Dallarad, Herby

AU - Lam, Sarah S.Y.

AU - Kulturel-Konak, Sadan

PY - 2006

Y1 - 2006

N2 - Particle Swarm Optimization (PSO), developed by Kennedy and Eberhart in 1995, was inspired by social behavior of birds flocking or fish schooling. It is a population-based algorithm, where a swarm of particles fly in a multi-dimensional space, guided by their social dynamics while optimizing an objective function. The Orienteering Problem (OP), a variation of the traveling salesman problem, is a 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 addresses the design of a PSO algorithm to solve one of the problem instances of the OP and discusses the preliminary results.

AB - Particle Swarm Optimization (PSO), developed by Kennedy and Eberhart in 1995, was inspired by social behavior of birds flocking or fish schooling. It is a population-based algorithm, where a swarm of particles fly in a multi-dimensional space, guided by their social dynamics while optimizing an objective function. The Orienteering Problem (OP), a variation of the traveling salesman problem, is a 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 addresses the design of a PSO algorithm to solve one of the problem instances of the OP and discusses the preliminary results.

UR - http://www.scopus.com/inward/record.url?scp=84858464523&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858464523&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84858464523

T2 - 2006 IIE Annual Conference and Exposition

Y2 - 20 May 2006 through 24 May 2006

ER -

A particle swarm optimization approach to the orienteering problem

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this