Two-type weight adjustments in MOEA/d for highly constrained many-objective optimization. (English) Zbl 1529.90074
Summary: A key issue in evolutionary constrained optimization is how to achieve a balance between feasible and infeasible solutions. The quality of generated solutions in decomposition-based multi-objective evolutionary algorithms (MOEAs) depends strongly on the weights’ setting. To fully utilize both the promising feasible and infeasible solutions, this paper proposes two-type weight adjustments based on MOEA/D for solving highly constrained many-objective optimization problems (CMaOPs). During the course of the search, the number of infeasible weights is dynamically reduced, to guide infeasible solutions with better convergence to cross the infeasible barrier, and also to lead infeasible solutions with better diversity to locate multiple feasible subregions. Feasible weights are evenly distributed and keep unchanged throughout the evolution process, which aims to guide the population to search Pareto optimal solutions. The effectiveness of the proposed algorithm is verified by comparing it against six state-of-the-art CMaOEAs on three sets of benchmark problems. Experimental results show that the proposed algorithm outperforms compared algorithms on majority problems, especially on highly constrained optimization problems. Besides, the effectiveness of the proposed algorithm has also been verified on an antenna array synthesis problem.
MSC:
| 90C29 | Multi-objective and goal programming |
| 90C59 | Approximation methods and heuristics in mathematical programming |
Keywords:
evolutionary computation; constrained many-objective optimization; constraint handling; MOEA/dReferences:
| [1] | Asafuddoula, M.; Ray, T.; Sarker, R., A decomposition-based evolutionary algorithm for many objective optimization, IEEE Trans. Evol. Comput., 19, 3, 445-460 (2014) |
| [2] | Bader, J.; Zitzler, E., HypE: An algorithm for fast hypervolume-based many-objective optimization, Evol. Comput., 19, 1, 45-76 (2011) |
| [3] | Bosman, P. A.N.; Thierens, D., The balance between proximity and diversity in multiobjective evolutionary algorithms, IEEE Trans. Evol. Comput., 7, 2, 174-188 (2003) |
| [4] | Cheng, R.; Jin, Y.; Olhofer, M.; Sendhoff, B., A reference vector guided evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 20, 5, 773-791 (2016) |
| [5] | Das, I.; Dennis, J. E., Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems, SIAM J. Optim., 8, 3, 631-657 (1998) · Zbl 0911.90287 |
| [6] | Deb, K.; Agrawal, R. B., Simulated binary crossover for continuous search space, Complex Systems, 9, 2, 115-148 (1995) · Zbl 0843.68023 |
| [7] | Deb, K.; Goyal, M., A combined genetic adaptive search (geneas) for engineering design, Computer Sci. Inform., 26, 30-45 (1996) |
| [8] | Deb, K.; Jain, H., An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints, IEEE Trans. Evol. Comput., 18, 4, 577-601 (2014) |
| [9] | Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., 6, 2, 182-197 (2002) |
| [10] | Fan, Z.; Fang, Y.; Li, W.; Cai, X.; Wei, C.; Goodman, E. D., MOEA/D with angle-based constrained dominance principle for constrained multi-objective optimization problems, Appl. Soft Computing, 74, 621-633 (2019) |
| [11] | Fan, Z.; Li, W.; Cai, X.; Li, H.; Wei, C.; Zhang, Q.; Deb, K.; Goodman, E., Push and pull search for solving constrained multi-objective optimization problems, Swarm Evol. Comput., 44, 665-679 (2019) |
| [12] | Gao, X.-Z.; Nalluri, M. S.R.; Kannan, K.; Sinharoy, D., Multi-objective optimization of feature selection using hybrid cat swarm optimization, Science China Technol. Sci., 64, 3, 508-520 (2021) |
| [13] | Gitinavard, Hossein; Shirazi, Mohsen Akbarpour; Ghodsypour, Seyed Hassan, A bi-objective multi-echelon supply chain model with pareto optimal points evaluation for perishable products under uncertainty, Scientia Iranica, 26, 5, 2952-2970 (2019) |
| [14] | Ishibuchi, H.; Fukase, T.; Masuyama, N.; Nojima, Y., Dual-grid model of MOEA/D for evolutionary constrained multiobjective optimization, (Proceedings of the Genetic and Evolutionary Computation Conference (2018), ACM), 665-672 |
| [15] | Ishibuchi, H.; Murata, T., A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Trans. Syst., Man, .Cybern., Part C (Appl. Rev.), 28, 3, 392-403 (1998) |
| [16] | Jain, H.; Deb, K., An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: Handling constraints and extending to an adaptive approach, IEEE Trans. Evol. Comput., 18, 4, 602-622 (2014) |
| [17] | Jiao, R.; Zeng, S.; Li, C., A feasible-ratio control technique for constrained optimization, Inf. Sci., 502, 201-217 (2019) · Zbl 1453.90165 |
| [18] | Jiao, R.; Zeng, S.; Li, C.; Pedrycz, W., Evolutionary constrained multi-objective optimization using nsga-ii with dynamic constraint handling, (2019 IEEE Congress on Evolutionary Computation (2019), IEEE), 1635-1642 |
| [19] | Jiao, R.; Zeng, S.; Li, C.; Yang, S.; Ong, Y.-S., Handling constrained many-objective optimization problems via problem transformation, IEEE Trans. Cybern. (2020) |
| [20] | S. Kirkpatrick, M.P Gelatt, C D.and Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983. · Zbl 1225.90162 |
| [21] | Li, B.; Li, J.; Tang, K.; Yao, X., Many-objective evolutionary algorithms: A survey, ACM Computing Surveys (CSUR), 48, 1, 13 (2015) |
| [22] | Li, H.; Zhang, Q., Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II, IEEE Trans. Evol. Comput., 13, 2, 284-302 (2008) |
| [23] | Li, K.; Chen, R.; Fu, G.; Yao, X., Two-archive evolutionary algorithm for constrained multiobjective optimization, IEEE Trans. Evol. Comput., 23, 2, 303-315 (2018) |
| [24] | Li, K.; Deb, K.; Zhang, Q.; Kwong, S., An evolutionary many-objective optimization algorithm based on dominance and decomposition, IEEE Trans. Evol. Comput., 19, 5, 694-716 (2014) |
| [25] | Liu, C.; Zhao, Q.; Yan, B.; Elsayed, S.; Ray, T.; Sarker, R., Adaptive sorting-based evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 23, 2, 247-257 (2018) |
| [26] | Liu, H.-L.; Gu, F.; Zhang, Q., Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems, IEEE Trans. Evol. Comput., 18, 3, 450-455 (2013) |
| [27] | Liu, Z.-Z.; Wang, Y., Handling constrained multiobjective optimization problems with constraints in both the decision and objective spaces, IEEE Trans. Evol. Comput., 23, 5, 870-884 (2019) |
| [28] | Liu, Z.-Z.; Wang, Y.; Huang, P.-Q., And: A many-objective evolutionary algorithm with angle-based selection and shift-based density estimation, Inf. Sci., 509, 400-419 (2020) · Zbl 1456.90144 |
| [29] | Ma, Z.; Wang, Y., Evolutionary constrained multiobjective optimization: Test suite construction and performance comparisons, IEEE Trans. Evol. Comput., 23, 6, 972-986 (2019) |
| [30] | Mezura-Montes, E.; Coello, C. A.C., Constraint-handling in nature-inspired numerical optimization: past, present and future, Swarm Evol. Comput., 1, 4, 173-194 (2011) |
| [31] | Peng, C.; Liu, H.-L.; Goodman, E., A cooperative evolutionary framework based on an improved version of directed weight vectors for constrained multiobjective optimization with deceptive constraints, IEEE Trans. Cybern. (2020), to be published |
| [32] | Peng, C.; Liu, H.-L.; Gu, F., An evolutionary algorithm with directed weights for constrained multi-objective optimization, Appl. Soft Computing, 60, 613-622 (2017) |
| [33] | Peng, C.; Liu, H.-L.; Gu, F., A novel constraint-handling technique based on dynamic weights for constrained optimization problems, Soft. Comput., 22, 12, 3919-3935 (2018) |
| [34] | Singh, H. K.; Alam, K.; Ray, T., Use of infeasible solutions during constrained evolutionary search: A short survey, (Australasian Conference on Artificial Life and Computational Intelligence (2016), Springer), 193-205 |
| [35] | Tian, Y.; Cheng, R.; Zhang, X.; Jin, Y., PlatEMO: A MATLAB platform for evolutionary multi-objective optimization [educational forum], IEEE Comput. Intell. Mag., 12, 4, 73-87 (2017) |
| [36] | Tian, Y.; Zhang, T.; Xiao, J.; Zhang, X.; Jin, Y., A coevolutionary framework for constrained multi-objective optimization problems, IEEE Trans. Evol. Comput., 25, 1, 102-116 (2021) |
| [37] | Trivedi, A.; Srinivasan, D.; Sanyal, K.; Ghosh, A., A survey of multiobjective evolutionary algorithms based on decomposition, IEEE Trans. Evol. Comput., 21, 3, 440-462 (2016) |
| [38] | Vakili, R.; Akbarpour Shirazi, M.; Gitinavard, Hossein, Multi-echelon green open-location-routing problem: A robust-based stochastic optimization approach, Scientia Iranica, 28, 2, 985-1000 (2021) |
| [39] | Von Lücken, C.; Barán, B.; Brizuela, C., A survey on multi-objective evolutionary algorithms for many-objective problems, Comput. Optim. Appl., 58, 3, 707-756 (2014) · Zbl 1334.90219 |
| [40] | Wang, B.-C.; Li, H.-X.; Zhang, Q.; Wang, Y., Decomposition-based multiobjective optimization for constrained evolutionary optimization, IEEE Trans. Syst., Man, Cybern.: Syst., 51, 1, 574-587 (2021) |
| [41] | Wang, J.; Liang, G.; Zhang, J., Cooperative differential evolution framework for constrained multiobjective optimization, IEEE Trans. Cybern., 49, 6, 2060-2072 (2018) |
| [42] | Wang, R.; Zhang, Q.; Zhang, T., Decomposition-based algorithms using pareto adaptive scalarizing methods, IEEE Trans. Evol. Comput., 20, 6, 821-837 (2016) |
| [43] | Xiang, Y.; Zhou, Y.; Li, M.; Chen, Z., A vector angle-based evolutionary algorithm for unconstrained many-objective optimization, IEEE Trans. Evol. Comput., 21, 1, 131-152 (2016) |
| [44] | Xu, Q.; Zeng, S.; Zhao, F.; Jiao, R.; Li, C., On formulating and designing antenna arrays by evolutionary algorithms, IEEE Trans. Antennas Propag., 69, 2, 1118-1129 (2021) |
| [45] | Zeng, S.; Jiao, R.; Li, C.; Li, X.; Alkasassbeh, J. S., A general framework of dynamic constrained multiobjective evolutionary algorithms for constrained optimization, IEEE Transactions on Cybernetics, 47, 9, 2678-2688 (2017) |
| [46] | Zeng, S.; Jiao, R.; Li, C.; Wang, R., Constrained optimisation by solving equivalent dynamic loosely-constrained multiobjective optimisation problem, Int. J. Bio-Inspired Comput., 13, 2, 86-101 (2019) |
| [47] | Zhang, Q.; Li, H., MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput., 11, 6, 712-731 (2007) |
| [48] | Q. Zhang, W. Liu, H. Li. The performance of a new version of MOEA/D on cec09 unconstrained mop test instances. In IEEE Congress on Evolutionary Computation, pages 203-208. IEEE, 2009. |
| [49] | Zhu, Q.; Zhang, Q.; Lin, Q., A constrained multiobjective evolutionary algorithm with detect-and-escape strategy, IEEE Trans. Evol. Comput., 24, 5, 938-947 (2021) |
| [50] | Zitzler, E.; Thiele, L., Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Trans. Evol. Comput., 3, 4, 257-271 (1999) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
