Abstract
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem into a number of scalar optimization subproblems and optimizes them simultaneously in a collaborative manner in one run. The recently proposed stable matching (STM)-based selection is a variant of MOEA/D that achieves one-to-one STM between subproblems and solutions on the basis of mutual preferences. However, the STM has a high probability of matching a good convergence solution with a subproblem, which results in an imbalance between convergence and diversity of selection result. In this study, we propose a new variant of MOEA/D with dual-information and dual-selection (DS) strategy (MOEA/D-DIDS). Different from other evolutionary operations, we use an adaptive historical and neighboring information in generating new individuals to avoid local optima and accelerate convergence rate. In the selection operation, we use the adaptive limited STM (\( \beta {\text{LSTM}} \)) strategy, where parameter β is adaptive in accordance with the evolutionary process, as a guideline to select a population from the mixed population that survives as the next parent population. In addition to \( \beta {\text{LSTM}} \), we use an STM to select competitive individuals as the members of the next mixed population. This DS strategy not only balances convergence and diversity but also holds the elite solutions. The effectiveness and competitiveness of MOEA/D-DIDS are validated and compared with several state-of-the-art evolutionary multiobjective optimization algorithms on benchmark problems.
Similar content being viewed by others
References
Arias-Montano A, Coello CAC (2012) Multiobjective evolutionary algorithms in aeronautical and aerospace engineering. IEEE Trans Evol Comput 16(5):662–694
Bader J, Zitzler E (2014) Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76
Beumea N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653–1669
Bosman PAN, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174–188
Cai Q, Gong M, Ruan S, Miao Q (2015) Network structural balance based on evolutionary multiobjective optimization: a two-step approach. IEEE Trans Evol Comput 19(6):903–916
Cai X, Yang Z, Fan Z, Zhang Q (2016) Decomposition-based-sorting and angle-based-selection for evolutionary multiobjective and many-objective optimization. IEEE Trans Cybern 47(9):2824–2837
Cai X, Mei Z, Fan Z (2018a) A decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors. IEEE Trans Cybern 48(8):2335–2348
Cai X, Mei Z, Fan Z, Zhang Q (2018b) A constrained decomposition approach with grids for evolutionary multiobjective optimization. IEEE Trans Evol Comput 22(4):564–577
Cai X, Sun H, Zhang Q, Huang Y (2018c) A grid weighted sum pareto local search for combinatorial multi and many-objective optimization. IEEE Trans Cybern 48:1–13
Cai X, Sun H, Fan Z (2018d) A diversity indicator based on reference vectors for many-objective optimization. Inf Sci 430–431:467–486
Coello CAC (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28–36
Coello CAC, Lamont GB, Veldhuizen DAV (2007) Evolutionary algorithms for solving multi-objective problems. Springer, New York
Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631–657
Deb K (2008) Multiobjective optimization using evolutionary algorithms. Comput Optim Appl 39(1):75–96
Deb K, Jain H (2014) 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
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary multiobjective optimization, pp 105–145
Durillo JJ, Nebro AJ, Luna F, Alba E (2009) On the effect of the steady-state selection scheme in multi-objective genetic algorithms. In: International conference on evolutionary multi-criterion optimization. Springer, pp 183–197
Fonseca CM, Fleming PJ (1995) An overview of evolutionary algorithms in multiobjective optimization. Evol Comput 3(1):1–16
Gale D, Shapley LS (2013) College admissions and the stability of marriage. Am Math Mon 120(5):386–391
Hughes EJ (2004) Multiple single objective pareto sampling. In: The 2003 congress on evolutionary computation, 2003. CEC’03, vol 4, pp 2678–2684
Hughes EJ (2007) MSOPS-II: a general-purpose many-objective optimiser. In: IEEE congress on evolutionary computation, 2007. CEC 2007, pp 3944–3951
Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302
Li K, Fialho A, Kwong S, Zhang Q (2014a) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114–130
Li K, Zhang Q, Kwong S, Li M (2014b) Stable matching-based selection in evolutionary multiobjective optimization. IEEE Trans Evol Comput 18(6):909–923
Li K, Kwong S, Zhang Q, Deb K (2015) Interrelationship-based selection for decomposition multiobjective optimization. IEEE Trans Cybern 45(10):2076–2088
Li B, Tang K, Li J, Yao X (2016) Stochastic ranking algorithm for many-objective optimization based on multiple indicators. IEEE Trans Evol Comput PP(99):1
Schaffer JD, Grefenstette JJ (1989) Multi-objective learning via genetic algorithms. In: International joint conference on artificial intelligence. Morgan Kaufmann, pp 1989:593–595
Shen X, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224
Strang G (2010) Introduction to linear algebra. Notes 28(1):1–19
Wang J, Zhou Y, Wang Y, Chen C, Zheng Z (2017) Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms. IEEE Trans Cybern 46(3):582–594
Wu M, Kwong S, Zhang Q, Li K, Wang R, Liu B (2015) Two-level stable matching-based selection in MOEA/D. IEEE Conference on Systems. IEEE press, Mans and Cybernetics, pp 1720–1725
Wu M, Li K, Kwong S, Zhang Q (2017) Matching-based selection with incomplete lists for decomposition multiobjective optimization. IEEE Trans Evol Comput 21(4):554–568
Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization test instances for the CEC 2009 special session and competition. University of Essex, Colchester
Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In: IEEE congress on evolutionary computation, 2009. CEC’09, pp 203–208
Zhang X, Tian Y, Cheng R, Jin Y (2015) An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans Evol Comput 19(2):201–213
Zhang S, Zheng L, Liu L, Zheng S (2016) Decomposition-based multi-objective evolutionary algorithm with mating neighborhood sizes and reproduction operators adaptation. Soft Comput 21(21):6381–6392
Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. Lect Notes Comput Sci 3242:832–842
Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the Eurogen’ 2001 evolutionary methods for design, optimization and control with applications to industrial problems, Athens, Greece
Zitzler E, Thiele L, Laumanns M, Fonseca VGD (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132
Acknowledgements
Dr. Qibing Zhu and Dr. Min Huang gratefully acknowledge the financial support from the National Natural Science Foundation of China (Grant Nos. 61772240, 61775086), the Prospective Joint Research Foundation of Jiangsu Province of China (BY2016022-32), the 111 Project (B12018) and sponsored by Qing Lan Project.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by V. Loia.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yang, Y., Huang, M., Wang, ZY. et al. Dual-information-based evolution and dual-selection strategy in evolutionary multiobjective optimization. Soft Comput 24, 3193–3221 (2020). https://doi.org/10.1007/s00500-019-04081-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-04081-5