A novel multiobjective evolutionary algorithm based on decomposition and multi-reference points strategy
Many real-world optimization problems such as engineering design can be eventually modeled as the corresponding multiobjective optimization problems (MOPs) which must be solved to obtain approximate Pareto optimal fronts. Multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been regarded as a significantly promising approach for solving MOPs. Recent studies have shown that MOEA/D with uniform weight vectors is well-suited to MOPs with regular Pareto optimal fronts, but its performance in terms of diversity usually deteriorates when solving MOPs with irregular Pareto optimal fronts. In this way, the solution set obtained by the algorithm can not provide more reasonable choices for decision makers. In order to efficiently overcome this drawback, we propose an improved MOEA/D algorithm by virtue of the well-known Pascoletti-Serafini scalarization method and a new strategy of multi-reference points. Specifically, this strategy consists of the setting and adaptation of reference points generated by the techniques of equidistant partition and projection. For performance assessment, the proposed algorithm is compared with existing four state-of-the-art multiobjective evolutionary algorithms on benchmark test problems with various types of Pareto optimal fronts. According to the experimental results, the proposed algorithm exhibits better diversity performance than that of the other compared algorithms. Finally, our algorithm is applied to two real-world MOPs in engineering optimization successfully.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversityEvolutionary AlgorithmsMultiobjective OptimizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Search Trajectories Networks of Multiobjective Evolutionary Algorithms
Understanding the search dynamics of multiobjective evolutionary algorithms (MOEAs) is still an open problem. This paper extends a recent network-based tool, search trajectory networks (STNs), to model the behavior of MO…
Evolutionary AlgorithmsPareto Set Learning for Neural Multi-objective Combinatorial Optimization
Multiobjective combinatorial optimization (MOCO) problems can be found in many real-world applications. However, exactly solving these problems would be very challenging, particularly when they are NP-hard. Many handcraf…
Combinatorial OptimizationTraveling Salesman ProblemExperimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms
In this paper we systematically study the importance, i.e., the influence on performance, of the main design elements that differentiate scalarizing functions-based multiobjective evolutionary algorithms (MOEAs). This cl…
Combinatorial OptimizationEvolutionary AlgorithmsMODRL/D-EL: Multiobjective Deep Reinforcement Learning with Evolutionary Learning for Multiobjective Optimization
Learning-based heuristics for solving combinatorial optimization problems has recently attracted much academic attention. While most of the existing works only consider the single objective problem with simple constraint…
Combinatorial OptimizationDeep Reinforcement LearningMultiobjective Optimizationreinforcement-learning+1Multi-task multi-constraint differential evolution with elite-guided knowledge transfer for coal mine integrated energy system dispatching
The dispatch optimization of coal mine integrated energy system is challenging due to high dimensionality, strong coupling constraints, and multiobjective. Existing constrained multiobjective evolutionary algorithms stru…
DiversityEvolutionary AlgorithmsMultiobjective OptimizationTransfer Learning