Solving the Constrained Nonlinear Optimization based on Imperialist Competitive Algorithm

In this work a strong framework is presented for solving the constrained nonlinear optimization problem that is a relatively complicated problem. These problems arise in a diverse range of sciences. There are a number of different approaches have been proposed. In this work, we employ the imperialist competitive algorithm (ICA) for solving constrained nonlinear optimization problems. Some well-known problems are presented to demonstrate the efficiency of this new robust optimization method in comparison to other known methods.