Home Multiobjective Imperialist Competitive Algorithm for Solving Nonlinear Constrained Optimization Problems
Article
Licensed
Unlicensed Requires Authentication

Multiobjective Imperialist Competitive Algorithm for Solving Nonlinear Constrained Optimization Problems

  • Chun-an Liu EMAIL logo and Huamin Jia
Published/Copyright: December 27, 2019
Become an author with De Gruyter Brill

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.


Supported by the Planning Fund for the Humanities and Social Sciences of the Ministry of Education (18YJA790053) and the National Scholarship Fund in China, the Project Sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars


References

[1] Homaifar A, Lai S H Y, Qi X. Constrained optimization via genetic algorithms. Simulation, 1994, 62(4): 242–254.10.1177/003754979406200405Search in Google Scholar

[2] Coello C A C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Comput. Methods Appl. Mech. Eng., 2002, 191(11–12): 1245–1287.10.1016/S0045-7825(01)00323-1Search in Google Scholar

[3] Hamida S B, Schoenauer M. ASCHEA: New results using adaptive segregational constraint handling. Proc Congr Evol Comput, IEEE Press, 2002.Search in Google Scholar

[4] Graham C G, Mará M S, José A, et al. Constrained control and estimation — An optimisation approach. Springer-Verlag, London, 2005.Search in Google Scholar

[5] Özgür Y. Penalty function methods for constrained optimization with genetic algorithms. Mathematical and Computational Applications, 2005, 10(1): 45–56.10.3390/mca10010045Search in Google Scholar

[6] Dimitri B. Constrained optimization and lagrange multiple methods. Academic Press, USA, 1982.Search in Google Scholar

[7] Joshi H, Arora S. Enhanced grey wolf optimization algorithm for global optimization. Fundamenta Informaticae, 2017, 153(3): 235–264.10.3233/FI-2017-1539Search in Google Scholar

[8] Miranda-Varela M E, Mezura-Montes E. Constraint-handling techniques in surrogate-assisted evolutionary optimization: An empirical study. Applied Soft Computing Journal, 2018, 73: 215–229.10.1016/j.asoc.2018.08.016Search in Google Scholar

[9] Arora S, Singh S, Yetilmezsoy K. A modified butterfly optimization algorithm for mechanical design optimization problems. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 2018, 40(21): 173–185.10.1007/s40430-017-0927-1Search in Google Scholar

[10] Kohli M, Arora S. Chaotic grey wolf optimization algorithm for constrained optimization problems. Journal of Computational Design and Engineering, 2018, 5(4): 458–472.10.1016/j.jcde.2017.02.005Search in Google Scholar

[11] Joshi H, Arora S. Enhanced grey wolf optimisation algorithm for constrained optimisation problems. International Journal of Swarm Intelligence, 2017, 3(2/3): 126–151.10.1504/IJSI.2017.087871Search in Google Scholar

[12] Ion N. A cutting plane method for solving convex optimization problems over the cone of nonnegative polynomials. WSEAS Transactions on Mathematics, 2009, 8(7): 269–279.Search in Google Scholar

[13] Paul H C, Jorge J M. Projected gradient methods for linearly constrained problems. Mathematical Programming, 1987, 39: 93–16.10.1007/BF02592073Search in Google Scholar

[14] Philipp H, Martin K. Quasi-Newton methods: A new direction. Journal of Machine Learning Research, 2013, 14: 843–865.Search in Google Scholar

[15] Yuan Y X. A new stepsize for the steepest descent method. Journal of Computational Mathematics, 2006, 24(2): 149–156.Search in Google Scholar

[16] Hovd M. Multi-level programming for designing penalty functions for MPC controllers. Proc of the 18th IFAC World Congress. Milano, Italy: IEEE Press, 2011.10.3182/20110828-6-IT-1002.00206Search in Google Scholar

[17] Huang F Z, Wang L, He Q. An effective co-evolutionary differential evolution for constrained optimization. Applied Mathematics and Computation, 2007, 186(1): 240–256.10.1016/j.amc.2006.07.105Search in Google Scholar

[18] He Q, Wang L. A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Applied Mathematics and Computation, 2007, 186(2): 1407–1422.10.1016/j.amc.2006.07.134Search in Google Scholar

[19] Lin Y C, Wang F S, Hwang K S. A hybrid method of evolutionary algorithms for mixed-integer nonlinear optimization problems. Proceedings of the 1999 Congress on Evolutionary Computation, Washington, IEEE Press, 1999.Search in Google Scholar

[20] Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation, 2007: 4661–4667.10.1109/CEC.2007.4425083Search in Google Scholar

[21] Mahdi A, Ayaz I, Davoud A. Imperialist competitive algorithm for solving systems of nonlinear equations. Computers and Mathematics with Applications, 2013, 65: 1894–1908.10.1016/j.camwa.2013.04.018Search in Google Scholar

[22] Mohammadi M, Tavakkoli-Moghaddam R, Rostamib H. A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem. International Journal of Industrial Engineering Computations, 2011, 2: 671–688.10.5267/j.ijiec.2010.08.003Search in Google Scholar

[23] Shokrollahpour E, Zandieh M, Dorri B. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research, 2011, 49(11): 3087–3103.10.1080/00207540903536155Search in Google Scholar

[24] Long W, Jiao J J, Liang X M, et al. An exploration-enhanced grey wolf optimizer to solve high-dimensinal numerical optimization. Engineering Applications of Artificial Intelligence, 2018, 68: 63–80.10.1016/j.engappai.2017.10.024Search in Google Scholar

[25] Farmani R, Wright J A. Self-adaptive fitness formulation for constrained optimization. IEEE Trans Evol Comput, 2003, 7(5): 445–455.10.1109/TEVC.2003.817236Search in Google Scholar

[26] Mezura-Montes E, Coello C A C. A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput, 2005, 9(1): 1–17.10.1109/TEVC.2004.836819Search in Google Scholar

[27] Runarsson T P, Yao X. Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput, 2000, 4(3): 284–294.10.1109/4235.873238Search in Google Scholar

[28] Aguirre A H, Rionda S B, Coello C A C, et al. Handling constraints using multiobjective optimization concepts. Int J Numerical Methods in Eng, 2004, 59(15): 1989–2017.10.1002/nme.947Search in Google Scholar

[29] Datta R, Regis R. A surrogate-assisted evolution strategy for constrained multi-objectiveoptimization. Expert Syst Appl, 2016, 57: 270–284.10.1016/j.eswa.2016.03.044Search in Google Scholar

[30] Floundas C, P. Pardalos. A collection of test problems for constrained global optimization. Lecture Notes in Comput Sci. Berlin, Germany: Springer-Verlag, 1987.Search in Google Scholar

[31] Koziel S, Michalewicz Z. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol Comput, 1999, 7(1): 19–44.10.1162/evco.1999.7.1.19Search in Google Scholar PubMed

[32] Michalewicz Z, Nazhiyath G, Michalewicz M. A note on usefulness of geometrical crossover for numerical optimization problems. Proc 5th Annu Conf Evolutionary Programming. Fogel L J, Angeline P J, Bäck T. Cambridge, MA: MIT Press, 1996.Search in Google Scholar

[33] Himmelblau D. Applied nonlinear programming. New York: McGraw-Hill, IEEE Press, 1972.Search in Google Scholar

[34] Hock W, Schittkowski K. Test examples for nonlinear programming codes. Berlin, Germany: Springer-Verlag, 1981.10.1007/978-3-642-48320-2Search in Google Scholar

Received: 2019-03-19
Accepted: 2019-04-26
Published Online: 2019-12-27
Published in Print: 2019-12-18

© 2019 Walter De Gruyter GmbH, Berlin/Boston

Downloaded on 20.11.2025 from https://www.degruyterbrill.com/document/doi/10.21078/JSSI-2019-532-18/html
Scroll to top button