Abstract
Many real-world problems in engineering and process synthesis tend to be highly dimensional and nonlinear, even involve conflicting multiple objectives and subject to many constraints, which makes the feasible regions narrow; hence, it is hard to be solved by traditional constraint handling techniques used in evolutionary algorithms. To handle this issue, this paper presents a multi-objective differential evolution with dynamic hybrid constraint handling mechanism (MODE-DCH) for tackling constrained multi-objective problems (CMOPs). In MODE-DCH, global search model and local search model combined with different constraint handling methods are proposed, and they are executed dynamically based on the feasibility proportion of the population. In the early stage that the feasible ratio is low, the local search model focuses on dragging the population into feasible regions rapidly, while the global search model is used to refine the whole population in the later stage. The two major modules of the algorithm cooperate together to balance the convergence and distribution of Pareto-optimal front. To demonstrate the effectiveness of MODE-DCH, the proposed algorithm is applied on several well-known CMOPs and two engineering problems compared with two other state-of-the-art multi-objective algorithms. The performance indicators show that MODE-DCH is an effective method to solve CMOPs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Castillo O, Trujillo L, Melin P (2007) Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots. Soft Comput A Fusion Found Methodol Appl 11(3):269–279. https://doi.org/10.1007/s00500-006-0068-4
Coello Coello CA (2016). Constraint-handling techniques used with evolutionary algorithms. In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, ACM, pp 563–587. https://doi.org/10.1145/2908961.2926986
Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Method Appl Mech Eng 186(2):311–338. https://doi.org/10.1016/S0045-7825(99)00389-8
Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, Hoboken
Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197. https://doi.org/10.1109/4235.996017
Dimkou TI, Papalexandri KP (1998) A parametric optimization approach for multiobjective engineering problems involving discrete decisions. Comput Chem Eng 22:S951–S954. https://doi.org/10.1016/S0098-1354(98)00188-4
Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybernetics) 26(1):29–41. https://doi.org/10.1109/3477.484436
Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS’95., IEEE. pp 39–43. https://doi.org/10.1007/978-0-387-30164-8_630
Hsieh MN, Chiang TC, Fu LC (2011) A hybrid constraint handling mechanism with differential evolution for constrained multiobjective optimization. In 2011 IEEE congress on evolutionary computation (CEC), IEEE, pp 1785–1792. https://doi.org/10.1109/CEC.2011.5949831
Jia G, Wang Y, Cai Z, Jin Y (2013) An improved (\(\mu +\lambda \))-constrained differential evolution for constrained optimization. Inf Sci 222:302–322. https://doi.org/10.1016/j.ins.2012.01.017
Jiao L, Luo J, Shang R, Liu F (2014) A modified objective function method with feasible-guiding strategy to solve constrained multi-objective optimization problems. Appl Soft Comput 14:363–380. https://doi.org/10.1016/j.asoc.2013.10.008
Knowles JD, Thiele L, Zitzler E (2006) A tutorial on the performance assessment of stochastic multiobjective optimizers. TIK-Report, 214
Lampinen J, Zelinka I (1999) Mixed integer-discrete-continuous optimization by differential evolution. In Proceedings of the 5th international conference on soft computing, pp 71–76
Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evolut Comput 13(2):284–302. https://doi.org/10.1109/TEVC.2008.925798
Liang JJ, Zheng B, Xu FY, Qu BY, Song H (2014) Multi-objective differential evolution algorithm based on fast sorting and a novel constraints handling technique. In 2014 IEEE congress on evolutionary computation (CEC), IEEE, pp 445–450. https://doi.org/10.1109/CEC.2014.6900525
Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evolut Comput 9(1):1–17. https://doi.org/10.1109/TEVC.2004.836819
Muhammad AJ, Rashida AK (2013) A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D. Appl Soft Comput 13(1):128–148. https://doi.org/10.1016/j.asoc.2012.07.027
Nebro AJ, Alba E, Luna F (2007) Multi-objective optimization using grid computing. Soft Comput 11(6):531–540. https://doi.org/10.1007/s00500-006-0096-0
Ning W, Guo B, Yan Y, Wu X, Wu J, Zhao D (2017) Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm. Eng Optim 49(10):1645–1664. https://doi.org/10.1080/0305215X.2016.1271661
Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160–175. https://doi.org/10.1016/0377-2217(95)00037-2
Peng C, Liu HL, Gu F (2017) An evolutionary algorithm with directed weights for constrained multi-objective optimization. Appl Soft Comput 60:613–622. https://doi.org/10.1016/j.asoc.2017.06.053
Powell D, Skolnick MM (1993) Using genetic algorithms in engineering design optimization with non-linear constraints. In Proceedings of the 5th international conference on genetic algorithms, pp 424–431
Qian F, Xu B, Qi R, Tianfield H (2012) Self-adaptive differential evolution algorithm with \(\alpha \)-constrained-domination principle for constrained multi-objective optimization. Soft Comput 16(8):1353–1372. https://doi.org/10.1007/s00500-012-0816-6
Qu BY, Suganthan PN (2011) Constrained multi-objective optimization algorithm with an ensemble of constraint handling methods. Eng Optim 43(4):403–416. https://doi.org/10.1080/0305215X.2010.493937
Ray T, Liew KM (2002) A swarm metaphor for multiobjective design optimization. Eng Optim 34(2):141–153. https://doi.org/10.1080/03052150210915
Segura C, Coello CA, Coello GM, León C (2015) Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization. Ann Oper Res 240(1):217–250. https://doi.org/10.1007/s10479-015-2017-z
Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248. https://doi.org/10.1162/evco.1994.2.3.221
Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359. https://doi.org/10.1023/A:1008202821328
Takahama T, Sakai S, Iwane N (2005) Constrained optimization by the epsilon constrained hybrid algorithm of particle swarm optimization and genetic algorithm. In Australian conference on artificial intelligence, vol 3809, pp. 389–400. https://doi.org/10.1109/TEVC.2005.850256
Tanaka M, Watanabe H, Furukawa Y, Tanino T (1995) GA-based decision support system for multicriteria optimization. In IEEE international conference on systems, man and cybernetics, 1995. Intelligent systems for the 21st century, vol 2, IEEE, pp 1556–1561. https://doi.org/10.1109/ICSMC.1995.537993
Wang Y, Cai Z (2012) A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans Syst Man Cybern Part B (Cybernetics) 42(1):203–217. https://doi.org/10.1109/TSMCB.2011.2161467
Wang Y, Cai Z, Guo G, Zhou Y (2007) Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst Man Cybern Part B (Cybernetics) 37(3):560–575. https://doi.org/10.1109/TSMCB.2006.886164
Wang Y, Wang BC, Li HX, Yen GG (2016) Incorporating objective function information into the feasibility rule for constrained evolutionary optimization. IEEE Trans Cybern 46(12):2938–2952
Woldesenbet YG, Yen GG, Tessema BG (2009) Constraint handling in multiobjective evolutionary optimization. IEEE Trans Evol Comput 13(3):514–525. https://doi.org/10.1109/TEVC.2008.2009032
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67–82. https://doi.org/10.1109/4235.585893
Zamuda A (2017) Adaptive constraint handling and success history differential evolution for CEC 2017 constrained real-parameter optimization. In 2017 IEEE congress on evolutionary computation (CEC), IEEE, pp 2443–2450. https://doi.org/10.1109/CEC.2017.7969601
Acknowledgements
This work is supported by National Key Scientific and Technical Project of China (2015BAF22B02), National Natural Science Foundation of China (Key Program: 61333010) and National Natural Science Foundation of China (61422303).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Lin, Y., Du, W. & Du, W. Multi-objective differential evolution with dynamic hybrid constraint handling mechanism. Soft Comput 23, 4341–4355 (2019). https://doi.org/10.1007/s00500-018-3087-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3087-z