Abstract
It has been widely recognized that evolutionary computation is one of the most effective techniques for solving complex optimization problems. As a group of meta-heuristics inspired by nature, the superiority of evolutionary algorithms is mainly attributed to the evolution of multiple candidate solutions, which can strike a balance between exploration and exploitation. However, the effectiveness of evolutionary algorithms is generally at the expense of efficiency, which reduces the prevalence of evolutionary algorithms in solving real-world optimization problems. In 2017, we proposed the evolutionary multi-objective optimization platform PlatEMO to facilitate the use of multi-objective evolutionary algorithms (MOEAs), where some delicate techniques were developed to improve the computational efficiency of MOEAs. These techniques have not been introduced before, since users need not care about them when using existing MOEAs or developing new MOEAs. To deepen the understanding of the core mechanisms of PlatEMO, this paper gives a comprehensive introduction to these techniques, including new non-dominated sorting approaches, matrix calculation, and parallel computing. Several comparative experiments are conducted for a quantitative understanding of the efficiency improvement brought by these techniques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.