#6031. A decomposition-based evolutionary algorithm for scalable multi/many-objective optimization

July 2026publication date
Proposal available till 28-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Control and Optimization;
Computer Science (all);
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6031.1 Contract №6031.2 Contract №6031.3 Contract №6031.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
The aim of evolutionary multi/many-objective optimization is to obtain a set of Pareto-optimal solutions with good trade-off among the multiple conflicting objectives. However, the convergence and diversity of multiobjective evolutionary algorithms often seriously decrease with the number of objectives and decision variables increasing. In this paper, we present a decomposition-based evolutionary algorithm for solving scalable multi/many-objective problems. The key features of the algorithm include the following three aspects: (1) a resource allocation strategy to coordinate the utility value of subproblems for good coverage; (2) a multioperator and multiparameter strategy to improve adaptability and diversity of the population; and (3) a bidirectional local search strategy to prevent the decrease in exploration capability during the early stage and increase the exploitation capability during the later stage of the search process. The performance of the proposed algorithm is benchmarked extensively on a set of scalable multi/many-objective optimization problems.
Keywords:
Bidirectional local search; Decomposition-based evolutionary algorithm; Many-objective optimization; Multiobjective optimization; Multioperator and multiparameter; Resource allocation

Contacts :
0