Abstract

When solving large-scale many-objective optimization problems (LMaOPs), due to the large number of variables and objectives involved, the algorithm is faced with a very high-dimensional and complex search space, which is difficult to be explored with limited resources. To address these issues, this paper proposes a universal large-scale many-objective optimization framework based on cultural learning (UCLMO). First, a universal framework is proposed, and multi-objective optimizers can be embedded into the framework to accelerate the convergence. Moreover, inspired by cultural learning, an individual selection strategy based on historical knowledge is proposed to promote the diversity of the population, and an assisted evolution strategy based on normative knowledge is presented to accelerate the convergence of the algorithm. Experiments have been conducted on multi-objective knapsack problems and LMaOPs with decision variables ranging from 500 to 1500, and the number of objectives ranging from 5 to 15. The experimental results verify the superiority and competitiveness of the proposed UCLMO framework in solving LMaOPs compared with state-of-the-art algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.