A two-phase evolutionary algorithm framework for multi-objective optimization

This paper proposes a two-phase evolutionary algorithm framework for solving multi-objective optimization problems (MOPs), which allows different users to flexibly handle MOPs with different existing algorithms. In the first phase, a specific multi-objective evolutionary algorithm (MOEA) with a smal...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Jiang, S., Chen, Zefeng
مؤلفون آخرون: School of Computer Science and Engineering
التنسيق: مقال
اللغة:English
منشور في: 2021
الموضوعات:
الوصول للمادة أونلاين:https://hdl.handle.net/10356/154500
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
المؤسسة: Nanyang Technological University
اللغة: English
الوصف
الملخص:This paper proposes a two-phase evolutionary algorithm framework for solving multi-objective optimization problems (MOPs), which allows different users to flexibly handle MOPs with different existing algorithms. In the first phase, a specific multi-objective evolutionary algorithm (MOEA) with a smaller population size is adopted to fast obtain a population converging to the true Pareto front. Then, in the second phase, a simple environmental selection mechanism based on a measure function and a well-designed crowdedness function is used to promote the uniformity of population in the objective space. Based on the proposed framework, we form four instantiations by embedding four distinct MOEAs into the first phase of the proposed framework. In the experimental study, different experiments are conducted on a variety of well-known benchmark problems from 3 to 10 objectives, and experimental results demonstrate the effect of the proposed framework. Furthermore, compared with several state-of-the-art multi-objective evolutionary algorithms, the four instantiations of the proposed framework have better performance and can obtain well-distributed solution sets. In short, the proposed framework has the strong ability to promote the performance of existing algorithms.