Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem

  • Clerc M
N/ACitations
Citations of this article
166Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The particle swarm optimizer (PSO) is a stochastic, population-based optimization technique that can be applied to a wide range of problems, including neural network training. This paper presents a variation on the traditional PSO algorithm, called the cooperative particle swarm optimizer, or CPSO, employing cooperative behavior to significantly improve the performance of the original algorithm. This is achieved by using multiple swarms to optimize different components of the solution vector cooperatively. Application of the new PSO algorithm on several benchmark optimization problems shows a marked improvement in performance over the traditional PSO. © 2004 IEEE.

Cite

CITATION STYLE

APA

Clerc, M. (2004). Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem (pp. 219–239). https://doi.org/10.1007/978-3-540-39930-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free