کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6856871 | 1437971 | 2018 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A decomposition-based archiving approach for multi-objective evolutionary optimization
ترجمه فارسی عنوان
یک روش آرشیوی مبتنی بر تجزیه برای بهینه سازی تکامل چند هدف
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
بهینه سازی تکاملی، بهینه سازی چند هدفه، بایگانی، تجزیه،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
External archive can be used to improve the performance of a multi-objective evolutionary algorithm. Various archiving approaches have been developed but with some drawbacks. These drawbacks such as computation-inefficiency, retreating and shrinking, have not yet been well addressed. In this paper, we propose an efficient decomposition-based archiving approach (DAA) inspired from the decomposition strategy for dealing with multi-objective optimization. In DAA, the whole objective space is uniformly divided into a number of subspaces according to a set of weight vectors. At each generation, only one non-dominated solution lying in a subspace is chosen to be used for updating the external archive in consideration of its diversity. A normalized distance-based method, incorporated with the Pareto dominance, is proposed to decide which subspace a new solution should fall into, and whether this solution should replace existing one in this subspace or not. Empirical results on a diverse set of benchmark test problems show that DAA is more efficient than a number of state-of-the-art archiving methods in terms of the diversity of the obtained non-dominated solutions; and DAA can accelerate the convergence speed of the evolutionary search for most test problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volumes 430â431, March 2018, Pages 397-413
Journal: Information Sciences - Volumes 430â431, March 2018, Pages 397-413
نویسندگان
Yong Zhang, Dun-wei Gong, Jian-yong Sun, Bo-yang Qu,