Accelerating the Decomposition-Based Multiobjective Evolutionary Algorithm via Evolutionary Direction Vector
In the process of multi-objective optimization, a large amount of data is generated, which contains the problem-related information. Learning knowledge from this data and applying it to the evolutionary process can improve the quality of the offspring solutions. Most existing knowledge learning methods suffer from high algorithm complexity, and there are still few methods designed specifically for the decomposition-based MOEAs. This paper proposes an evolutionary direction vector (EDV)-guided multiobjective evolutionary algorithm based on decomposition (MOEA/D-EDV). It collects the high-quality evolutionary process data based on the solution's performance in the objective space and their movement directions in the decision space. It then extracts the problem-related knowledge using an efficient learning method to accelerate the evolutionary process. Experimental results on 30 benchmark problems demonstrate that the EDV-guided evolution can significantly accelerate the evolutionary process, and the overall performance of the proposed MOEA/D-EDV is significantly better than the comparative algorithms in the literature.
Authors
- Zhiming Dong (ORCID: https://orcid.org/0000-0002-1021-506X)
- Xianpeng Wang (ORCID: https://orcid.org/0000-0001-8132-9446)
- Jingchuan Zhang (ORCID: https://orcid.org/0000-0002-5386-1491)
- Yaxue Liu
Institutions
- Northeastern University (CN)
Publication Details
- Published
- 2024-08-16
- DOI
- https://doi.org/10.1109/docs63458.2024.10704289
- Primary Topic
- Advanced Multi-Objective Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00