Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Joint Conference on Computational Intelligence, IJCCI 2016; Porto; Porto
Год издания: 2016
Ключевые слова: Binary genetic algorithm, Estimation of Distribution Algorithm, large-scale global optimization, problem decomposition
Аннотация: In recent years many real-world optimization problems have had to deal with growing dimensionality. Optimization problems with many hundreds or thousands of variables are called large-scale global optimization (LSGO) problems. Many well-known real-world LSGO problems are not separable and are complex for detailed analysis, thus they are viewed as the black-box optimization problems. The most advanced algorithms for LSGO are based on cooperative coevolution schemes using the problem decomposition. These algorithms are mainly proposed for the real-valued search space and cannot be applied for problems with discrete or mixed variables. In this paper a novel technique is proposed, that uses a binary genetic algorithm as the core technique. The estimation of distribution algorithm (EDA) is used for collecting statistical data based on the past search experience to provide the problem decomposition by fixing genes in chromosomes. Such an EDA-based decomposition technique has the benefits of the random grouping methods and the dynamic learning methods. The EDA-based decomposition GA using the island model is also discussed. The results of numerical experiments for benchmark problems from the CEC competition are presented and discussed. The experiments show that the approach demonstrates efficiency comparable to other advanced techniques.
Журнал: IJCCI 2016 - Proceedings of the 8th International Joint Conference on Computational Intelligence
Выпуск журнала: 1
Номера страниц: 132-139
Вхождение в базы данных
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.