Many-objective optimization with dynamic constraint handling for constrained optimization problems
- 351 Downloads
In real-world applications, the optimization problems are usually subject to various constraints. To solve constrained optimization problems (COPs), this paper presents a new methodology, which incorporates a dynamic constraint handling mechanism into many-objective evolutionary optimization. Firstly we convert a COP into a dynamic constrained many-objective optimization problem (DCMaOP), which is equivalent to the COP, then the proposed many-objective optimization evolutionary algorithm with dynamic constraint handling, called MaDC, is realized to solve the DCMaOP. MaDC uses the differential evolution (DE) to generate individuals, and a reference-point-based nondominated sorting approach to select individuals. The effectiveness of MaDC is verified on 22 test instances. The experimental results show that MaDC is competitive to several state-of-the-art algorithms, and it has better global search ability than its peer algorithms.
KeywordsConstrained optimization Many-objective optimization Dynamic constraint optimization Reference-point-based nondominated sorting
The research in this paper was supported by the National Natural Science Foundation of China (Nos.: 61203306, 61271140 and 61305086).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Helsinki declaration and its later amendments or comparable ethical standards. This article does not contain any studies with animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
- Coello CAC (2006) Multi-objective optimization: a history view of the field. IEEE Comput Intell Mag 1(1):28–36Google Scholar
- Deb K, Datta R (2010) A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach. In: IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, pp 1–8Google Scholar
- Deb K, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197Google Scholar
- Hsieh M, Chiang T, Fu L (2011) A hybrid constraint handling mechanism with differential evolution for constrained multiobjective optimization. In: IEEE Congress on Evolutionary Computation, CEC 2011, New Orleans, pp 1785–1792Google Scholar
- Li X, Zeng SY, Qin S, Liu KQ (2015) Constrained optimization problem solved by dynamic constrained NSGA-III multiobjective optimizational techniques. In: IEEE Congress on Evolutionary Computation, CEC 2015, Sendai, pp 2923–2928Google Scholar
- Liang JJ (2006) Problem definitions and evaluation criteria for the cec2006 special session on constrained real-parameter optimization. Website, http://www.ntu.edu.sg/home/epnsugan/
- Montes EM, Coello CAC (2011) Constraint handling in nature-inspired numerical optimization: past, present and future. Swarm Evolut Comput 1(4):173–194Google Scholar
- Takahama T, Sakai S (2006) Constrained optimization by the \(\epsilon \)-constrained differential evolution with gradient-based mutation and feasible elites. In: IEEE Congress on Evolutionary Computation, CEC 2006, Vancouver, pp 1–8Google Scholar
- Wang Y, Cai ZX (2012) A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans Syst, Man, Cybern part B: Cybern 42(1):560–575Google Scholar
- Zapotecas Martínez S, Aguirre HE, Tanaka K, Coello CAC (2015) On the low-discrepancy sequences and their use in MOEA/D for high-dimensional objective spaces. In: IEEE Congress on Evolutionary Computation, CEC 2015, Sendai, pp 2835–2842Google Scholar
- Zeng SY, Chen S, Zhao J, Zhou A, Li Z, Jing H (2011) Dynamic constrained multi-objective model for solving constrained optimization problem. In: IEEE Congress on Evolutionary Computation, CEC 2011, New Orleans, pp 2041–2046Google Scholar