Journal
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
Volume 22, Issue 2, Pages 260-275Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2017.2704782
Keywords
Large-scale optimization (LSO); many-variable optimization; metaheuristic framework; multiobjective optimization; variable grouping; weighting
Funding
- German Academic Exchange Service (DAAD)
Ask authors/readers for more resources
In this paper, we propose a new method for solving multiobjective optimization problems with a large number of decision variables. The proposed method called weighted optimization framework is intended to serve as a generic method that can be used with any population-based metaheuristic algorithm. After explaining some general issues of large-scale optimization, we introduce a problem transformation scheme that is used to reduce the dimensionality of the search space and search for improved solutions in the reduced subspace. This involves so-called weights that are applied to alter the decision variables and are also subject to optimization. Our method relies on grouping mechanisms and employs a population-based algorithm as an optimizer for both original variables and weight variables. Different grouping mechanisms and transformation functions within the framework are explained and their advantages and disadvantages are examined. Our experiments use test problems with 2-3 objectives 40-5000 variables. Using our approach on three well-known algorithms and comparing its performance with other large-scale optimizers, we show that our method can significantly outperform most existing methods in terms of solution quality as well as convergence rate on almost all tested problems for many-variable instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available