A particle swarm optimization approach to the orienteering problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish (US)
Title of host publication2006 IIE Annual Conference and Exposition
StatePublished - 2006
Event2006 IIE Annual Conference and Exposition - Orlando, FL, United States
Duration: May 20 2006May 24 2006

Other

Other2006 IIE Annual Conference and Exposition
CountryUnited States
CityOrlando, FL
Period5/20/065/24/06

Fingerprint

Particle swarm optimization (PSO)
Traveling salesman problem
Birds
Fish
Computational complexity

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Dallarad, H., Lam, S. S. Y., & Kulturel-Konak, S. (2006). A particle swarm optimization approach to the orienteering problem. In 2006 IIE Annual Conference and Exposition
Dallarad, Herby ; Lam, Sarah S Y ; Kulturel-Konak, Sadan. / A particle swarm optimization approach to the orienteering problem. 2006 IIE Annual Conference and Exposition. 2006.
@inproceedings{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)",
booktitle = "2006 IIE Annual Conference and Exposition",

}

Dallarad, H, Lam, SSY & Kulturel-Konak, S 2006, A particle swarm optimization approach to the orienteering problem. in 2006 IIE Annual Conference and Exposition. 2006 IIE Annual Conference and Exposition, Orlando, FL, United States, 5/20/06.

A particle swarm optimization approach to the orienteering problem. / Dallarad, Herby; Lam, Sarah S Y; Kulturel-Konak, Sadan.

2006 IIE Annual Conference and Exposition. 2006.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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 - Conference contribution

BT - 2006 IIE Annual Conference and Exposition

ER -

Dallarad H, Lam SSY, Kulturel-Konak S. A particle swarm optimization approach to the orienteering problem. In 2006 IIE Annual Conference and Exposition. 2006