About this Journal Submit a Manuscript Table of Contents
Advances in Artificial Intelligence
Volume 2012 (2012), Article ID 540861, 7 pages
http://dx.doi.org/10.1155/2012/540861
Research Article

A Novel Approach to Improve the Performance of Evolutionary Methods for Nonlinear Constrained Optimization

Center of Excellence on Soft Computing and Intelligent Information Processing (SCIIP), Ferdowsi University of Mashhad, Mashhad, Iran

Received 24 May 2012; Revised 16 July 2012; Accepted 16 July 2012

Academic Editor: Joanna Józefowska

Copyright © 2012 Alireza Rowhanimanesh and Sohrab Efati. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Evolutionary methods are well-known techniques for solving nonlinear constrained optimization problems. Due to the exploration power of evolution-based optimizers, population usually converges to a region around global optimum after several generations. Although this convergence can be efficiently used to reduce search space, in most of the existing optimization methods, search is still continued over original space and considerable time is wasted for searching ineffective regions. This paper proposes a simple and general approach based on search space reduction to improve the exploitation power of the existing evolutionary methods without adding any significant computational complexity. After a number of generations when enough exploration is performed, search space is reduced to a small subspace around the best individual, and then search is continued over this reduced space. If the space reduction parameters (red_gen and red_factor) are adjusted properly, reduced space will include global optimum. The proposed scheme can help the existing evolutionary methods to find better near-optimal solutions in a shorter time. To demonstrate the power of the new approach, it is applied to a set of benchmark constrained optimization problems and the results are compared with a previous work in the literature.