Balancing Exploration and Exploitation for Solving Large-scale Multiobjective Optimization via Attention Mechanism
Not on the map. Why?
Abstract (arXiv)
Large-scale multiobjective optimization problems (LSMOPs) refer to optimization problems with multiple conflicting optimization objectives and hundreds or even thousands of decision variables. A key point in solving LSMOPs is how to balance exploration and exploitation so that the algorithm can search in a huge decision space efficiently. Large-scale multiobjective evolutionary algorithms consider the balance between exploration and exploitation from the individual's perspective. However, these algorithms ignore the significance of tackling this issue from the perspective of decision variables, which makes the algorithm lack the ability to search from different dimensions and limits the performance of the algorithm. In this paper, we propose a large-scale multiobjective optimization algorithm based on the attention mechanism, called (LMOAM). The attention mechanism will assign a unique weight to each decision variable, and LMOAM will use this weight to strike a balance between exploration and exploitation from the decision variable level. Nine different sets of LSMOP benchmarks are conducted to verify the algorithm proposed in this paper, and the experimental results validate the effectiveness of our design.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 May 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.
- 2023Multimodal Optimization with k-Cluster Big Bang-Big Crunch Algorithm and Postprocessing Methods for Identification and Quantification of Optimacited by 1
- 2023Efficiently Tackling Million-Dimensional Multiobjective Problems: A Direction Sampling and Fine-Tuning Approachcited by 0
- 2024Multiple Global Peaks Big Bang-Big Crunch Algorithm for Multimodal Optimizationcited by 0
- 2024Multiple Global Peaks Big Bang-Big Crunch Algorithm for Multimodal Optimization8 Oct 2024
- 2023Multimodal Optimization with k-Cluster Big Bang-Big Crunch Algorithm and Postprocessing Methods for Identification and Quantification of Optima21 Dec 2023
- 2023Efficiently Tackling Million-Dimensional Multiobjective Problems: A Direction Sampling and Fine-Tuning Approach8 Apr 2023