کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6853190 658316 2015 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Bi-goal evolution for many-objective optimization problems
ترجمه فارسی عنوان
تکامل بی هدف برای مشکلات بهینه سازی چند هدف
کلمات کلیدی
بهینه سازی چند هدفه تکاملی، بسیاری از اهداف بهینه سازی، نزدیکی، تنوع تکامل بی اهداف،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
This paper presents a meta-objective optimization approach, called Bi-Goal Evolution (BiGE), to deal with multi-objective optimization problems with many objectives. In multi-objective optimization, it is generally observed that 1) the conflict between the proximity and diversity requirements is aggravated with the increase of the number of objectives and 2) the Pareto dominance loses its effectiveness for a high-dimensional space but works well on a low-dimensional space. Inspired by these two observations, BiGE converts a given multi-objective optimization problem into a bi-goal (objective) optimization problem regarding proximity and diversity, and then handles it using the Pareto dominance relation in this bi-goal domain. Implemented with estimation methods of individuals' performance and the classic Pareto nondominated sorting procedure, BiGE divides individuals into different nondominated layers and attempts to put well-converged and well-distributed individuals into the first few layers. From a series of extensive experiments on four groups of well-defined continuous and combinatorial optimization problems with 5, 10 and 15 objectives, BiGE has been found to be very competitive against five state-of-the-art algorithms in balancing proximity and diversity. The proposed approach is the first step towards a new way of addressing many-objective problems as well as indicating several important issues for future development of this type of algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 228, November 2015, Pages 45-65
نویسندگان
, , ,