By Topic

A Multi-Populated Differential Evolution Algorithm for Solving Constrained Optimization Problem

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)
M. F. Tasgetiren ; Department of Management, Fatih University, 34500, Buyukcekmece, Istanbul, Turkey, email: ; P. N. Suganthan

This paper presents a multi-populated differential evolution algorithm to solve real-parameter constrained optimization problems. The notion of the "near feasibility threshold" is employed in the proposed algorithm to penalize the infeasible solutions. The algorithm was tested using benchmark instances in Congress on Evolutionary Computation 2006. For these benchmark problems, the problem definition file, codes and evaluation criteria are available in The performance of the multi-populated differential evolution algorithm is evaluated with the best known or optimal solutions provided in the literature. The experimental results with detailed statistics required for this session show that the proposed multi-populated differential algorithm was able to solve 22 out of 24 benchmark instances to either optimality or best known solutions in the literature. In addition, 6 out of 24 best known solutions are ultimately improved by the proposed multi-populated differential evolution algorithm.

Published in:

2006 IEEE International Conference on Evolutionary Computation

Date of Conference:

0-0 0