An Algorithmic Framework for Multiobjective Optimization

Abstract EN

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally.

Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems.

Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two).

In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms.

This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms.

This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization.