کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6904376 | 1446999 | 2017 | 39 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Utopian point based decomposition for multi-objective optimization problems with complicated Pareto fronts
ترجمه فارسی عنوان
تجزیه نقطه مبتنی بر اوتوپی برای مشکلات بهینه سازی چند هدفه با جبهه پیچیده پاروتو
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
بهینه سازی چند هدفه تکاملی، روش تجزیه نقطه اوتوپی، جبهه پیچیده پاروتو،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has been considered as a promising method for solving multi-objective optimization problems (MOPs). It devotes most of its effort on convergence by optimizing a set of scalar optimization subproblems in a collaborative manner, while maintaining the diversity by using a set of uniformly distributed weight vectors. However, more recent studies illustrated that MOEA/D faces difficulties on MOPs with complicated Pareto fronts, mainly because the uniformity of weight vectors no longer lead to an evenly scattered approximation of the Pareto fronts in these cases. To remedy this, we suggest replacing the ideal point in the reciprocal Tchebycheff decomposition method with a more optimistic utopian point, with the aim of alleviating the sensitivity of MOEA/D to the Pareto front shape of MOPs. Experimental studies on benchmark and real-world problems have shown that such simple modification can significantly improve the performances of MOEA/D with reciprocal Tchebycheff decomposition on MOPs with complicated Pareto fronts.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 61, December 2017, Pages 844-859
Journal: Applied Soft Computing - Volume 61, December 2017, Pages 844-859
نویسندگان
Yutao Qi, Qingsai Zhang, Xiaoliang Ma, Yining Quan, Qiguang Miao,