Large‐Scale Multi‐Objective Optimization Algorithms: A Decade Survey
ABSTRACT Large‐scale multi‐objective optimization problems (LSMOPs) are characterised by concurrent optimization of multiple conflicting objectives and no fewer than 100 decision variables. They widely exist in the fields of practical engineering and scientific research. Over the past decade, many l...
Uloženo v:
| Vydáno v: | Expert systems Ročník 42; číslo 12 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Blackwell Publishing Ltd
01.12.2025
|
| Témata: | |
| ISSN: | 0266-4720, 1468-0394 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | ABSTRACT
Large‐scale multi‐objective optimization problems (LSMOPs) are characterised by concurrent optimization of multiple conflicting objectives and no fewer than 100 decision variables. They widely exist in the fields of practical engineering and scientific research. Over the past decade, many large‐scale multi‐objective evolutionary algorithms (LSMOEAs) have emerged to address LSMOPs. This paper systematically reviews and comprehensively analyzes the ideas, advantages, disadvantages, and latest developments of these LSMOEAs. Firstly, it introduces the relevant concepts of LSMOEAs. Then classify them into four categories: decision variable grouping‐based LSMOEAs, non‐grouping dimensionality reduction‐based LSMOEAs, effective offspring generation‐based LSMOEAs, and learning models‐based LSMOEAs. It analyzes representative algorithms in each category, elaborating on their core strategies, advantages, and disadvantages. Finally, it explores the applications of LSMOEAs in computer vision, like tackling pixel‐level correlation, high‐resolution feature redundancy, dynamic target tracking, and complex visual modelling. This paper provides readers with a comprehensive and systematic overview of LSMOEAs, serving as a valuable reference for both researchers entering this field and practitioners seeking to select appropriate algorithms for practical problems. |
|---|---|
| Bibliografie: | Funding This work was supported by National Natural Science Foundation of China (No. 62362056), the Key R&D Program of Ningxia (No. 2023BSB03016), and the Natural Science Foundation of Ningxia Province (No. 2023AAC05010). ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0266-4720 1468-0394 |
| DOI: | 10.1111/exsy.70157 |