A fast sampling based evolutionary algorithm for million-dimensional multiobjective optimization
With their complexity and vast search space, large-scale multiobjective optimization problems (LSMOPs) challenge existing multiobjective evolutionary algorithms (MOEAs). Recently, several large-scale multiobjective evolutionary algorithms have been developed to tackle LSMOPs. Unlike conventional MOEAs that concentrate on selection operations in the objective space, large-scale MOEAs emphasize operations in the decision space, such as offspring generation, to tackle the large number of decision variables. Nevertheless, most present large-scale MOEAs experience difficulty effectively and efficiently solving LSMOPs with tens of thousands or more decision variables or exhibit poor versatility in solving different LSMOPs. We propose a fast large-scale MOEA framework with reference-guided offspring generation, named FLEA, aiming at these issues. Generally, FLEA constructs several reference vectors in the decision space to steer the sampling of promising solutions during offspring generation. A parameter is used to allocate computation resources between the convergence and diversity of the offspring population adaptively. Without computationally expensive problem reformulation or decision variable analysis techniques, the proposed method can significantly accelerate the search speed of conventional MOEAs in solving LSMOPs. FLEA is examined on various LSMOPs with up to 1.6 million decision variables, demonstrating its superior effectiveness, efficiency, and versatility in large-scale multiobjective optimization.
National Natural Science Foundation of China;National Natural Science Foundation of China;National Natural Science Foundation of China;Fundamental Research Funds for the Central Universities[HUST: 2021JYCXJJ039];National Natural Science Foundation of China[U20A20306];
|WOS Research Area|
Computer Science, Artificial Intelligence ; Computer Science, Theory & Methods
|WOS Accession No|
Cited Times [WOS]:0
|Document Type||Journal Article|
|Department||Department of Computer Science and Engineering|
1.Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China,School of Artificial Intelligence and Automation,Huazhong University of Science and Technology,Wuhan,430074,China
2.School of Electrical and Electronic Engineering,Huazhong University of Science and Technology,Wuhan,430074,China
3.Department of Computer Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China
4.Faculty of Technology,Bielefeld University,Bielefeld,33619,Germany
Li，Lianghao,He，Cheng,Cheng，Ran,et al. A fast sampling based evolutionary algorithm for million-dimensional multiobjective optimization[J]. Swarm and Evolutionary Computation,2022,75.
Li，Lianghao,He，Cheng,Cheng，Ran,Li，Hongbin,Pan，Linqiang,&Jin，Yaochu.(2022).A fast sampling based evolutionary algorithm for million-dimensional multiobjective optimization.Swarm and Evolutionary Computation,75.
Li，Lianghao,et al."A fast sampling based evolutionary algorithm for million-dimensional multiobjective optimization".Swarm and Evolutionary Computation 75(2022).
|Files in This Item:||There are no files associated with this item.|
|Recommend this item|
|Export to Endnote|
|Export to Excel|
|Export to Csv|
|Similar articles in Google Scholar|
|Similar articles in Baidu Scholar|
|Similar articles in Bing Scholar|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.