By Topic

An evolutionary algorithm of contracting search space based on partial ordering relation for constrained optimization 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

3 Author(s)
Zeng, S.Y. ; Dept. of Comput. Sci., Zhuzhou Inst. of Technol., China ; Ding, L.X. ; Kang, L.S.

A new evolutionary algorithm, which can contract search space based on the partial ordering relation and is designed to solve nonlinear programming (NLP), is proposed in this paper. Firstly, the partial ordering relation is used for evaluating an individual, which ensures that individual competition is more impartial. Secondly, by taking advantage of incomplete evolution, which provides good individuals in short time, we can locate regions of optimal solutions and contract the search space and thus reduce the search space and increase the convergence rate. Thirdly, we prove that the algorithm can find optimal solutions. Finally, the algorithm can be easily parallelized. Numerical experiments demonstrate that our techniques are superior to other methods in terms of solution quality and robustness.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002