By Topic

Applying a Discrete Particle Swarm Optimization Algorithm to Combinatorial Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Matheus Rosendo ; Dept. of Comput. Sci., Fed. Univ. of Parana, Curitiba, Brazil ; Aurora Pozo

Particle Swarm Optimization (PSO) is a population based stochastic algorithm for continuous optimization inspired by social behavior of bird flocking or fish schooling that has been successfully applied in different areas. However, its potential in discrete problems has not been sufficiently explored. Recent works have proposed hybridization of PSO using local search and Path relinking algorithms with promising results. This paper aims to present a hybrid PSO algorithm that uses local search and Path relinking too, but differently to the previous approaches, this work maintains the main PSO concept for the update of the velocity of the particle. The paper describes the proposed algorithm and a set of experiments with the Traveling Salesman Problem (TSP). The hybrid algorithm shows competitive results compared to other state of the art metaheuristics.

Published in:

2010 Eleventh Brazilian Symposium on Neural Networks

Date of Conference:

23-28 Oct. 2010