Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

A hybrid Jumping Particle Swarm Optimization method for high dimensional unconstrained discrete 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
$31 $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

1 Author(s)
Seren, C. ; Centre de Toulouse, ONERA - The French Aerosp. Lab., Toulouse, France

Abstract-This article presents an original adaptation of particle swarm for solving high dimensional optimization problems with discrete variables. The proposed method combines Particle Swarm Optimization (PSO) theory with both Variable Neighbourhood Search (VNS) and Stretching Technique (ST) principles. A dedicated mathematical formalism used to handle real-coded discrete variables is defined previously to the theoretical background section which ends with a full description of the developed hybrid local/global optimization algorithm (Jumping PSO + VNS local heuristic + ST). Its performances for solving low and high combinatorial unconstrained optimization problems are evaluated. These latter are obtained from a specific benchmark composed of several reference multimodal functions whose search domains have been disadvantageously discretized. Some comments and perspectives dealing with the future works conclude this paper.

Published in:

Evolutionary Computation (CEC), 2011 IEEE Congress on

Date of Conference:

5-8 June 2011