Multiobjective Imperialist Competitive Algorithm for Solving Nonlinear Constrained Optimization Problems

Abstract Nonlinear constrained optimization problem (NCOP) has been arisen in a diverse range of sciences such as portfolio, economic management, airspace engineering and intelligence system etc. In this paper, a new multiobjective imperialist competitive algorithm for solving NCOP is proposed. First, we review some existing excellent algorithms for solving NOCP; then, the nonlinear constrained optimization problem is transformed into a biobjective optimization problem. Second, in order to improve the diversity of evolution country swarm, and help the evolution country swarm to approach or land into the feasible region of the search space, three kinds of different methods of colony moving toward their relevant imperialist are given. Thirdly, the new operator for exchanging position of the imperialist and colony is given similar as a recombination operator in genetic algorithm to enrich the exploration and exploitation abilities of the proposed algorithm. Fourth, a local search method is also presented in order to accelerate the convergence speed. At last, the new approach is tested on thirteen well-known NP-hard nonlinear constrained optimization functions, and the experiment evidences suggest that the proposed method is robust, efficient, and generic when solving nonlinear constrained optimization problem. Compared with some other state-of-the-art algorithms, the proposed algorithm has remarkable advantages in terms of the best, mean, and worst objective function value and the standard deviations.

[1]  Feng-Sheng Wang,et al.  A hybrid method of evolutionary algorithms for mixed-integer nonlinear optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[3]  Jianjun Jiao,et al.  An exploration-enhanced grey wolf optimizer to solve high-dimensional numerical optimization , 2018, Eng. Appl. Artif. Intell..

[4]  Martin Kiefel,et al.  Quasi-Newton Methods: A New Direction , 2012, ICML.

[5]  Ling Wang,et al.  An effective co-evolutionary differential evolution for constrained optimization , 2007, Appl. Math. Comput..

[6]  Reza Tavakkoli-Moghaddam,et al.  A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem , 2011 .

[7]  Ion Necoara,et al.  A cutting plane method for solving convex optimization problems over the cone of nonnegative polynomials , 2009 .

[8]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[9]  Himani Joshi,et al.  Enhanced Grey Wolf Optimization Algorithm for Global Optimization , 2017, Fundam. Informaticae.

[10]  Rituparna Datta,et al.  A surrogate-assisted evolution strategy for constrained multi-objective optimization , 2016, Expert Syst. Appl..

[11]  Himani Joshi,et al.  Enhanced grey wolf optimisation algorithm for constrained optimisation problems , 2017 .

[12]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[13]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[14]  Morten Hovd,et al.  Multi-Level Programming for Designing Penalty Functions for MPC Controllers , 2011 .

[15]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

[16]  Satvir Singh,et al.  A modified butterfly optimization algorithm for mechanical design optimization problems , 2018 .

[17]  Ya-xiang,et al.  A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD , 2006 .

[18]  Efrén Mezura-Montes,et al.  Constraint-handling techniques in surrogate-assisted evolutionary optimization. An empirical study , 2018, Appl. Soft Comput..

[19]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[20]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[21]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.

[22]  Graham C. Goodwin,et al.  Constrained Control and Estimation: an Optimization Approach , 2004, IEEE Transactions on Automatic Control.

[23]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[24]  Ling Wang,et al.  A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization , 2007, Appl. Math. Comput..

[25]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[26]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[27]  Zbigniew Michalewicz,et al.  A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems , 1996, Evolutionary Programming.

[28]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[29]  Sankalap Arora,et al.  Chaotic grey wolf optimization algorithm for constrained optimization problems , 2018, J. Comput. Des. Eng..

[30]  Marc Schoenauer,et al.  ASCHEA: new results using adaptive segregational constraint handling , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[31]  Ayaz Isazadeh,et al.  Imperialist competitive algorithm for solving systems of nonlinear equations , 2013, Comput. Math. Appl..

[32]  Carlos A. Coello Coello,et al.  Handling constraints using multiobjective optimization concepts , 2004 .