Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only. It is unclear how well these MOEAs will perform on problems with a large number of objectives. Our preliminary study [1] showed that performance of some MOEAs deteriorates significantly as the number of objectives increases. This paper proposes a new MOEA that performs well on problems with a large number of objectives. The new algorithm separates non-dominated solutions into two archives, and is thus called the Two-Archive algorithm. The two archives focused on convergence and diversity, respectively, in optimisation. Computational studies have been carried out to evaluate and compare our new algorithm against the best MOEA for problems with a large number of objectives. Our experimental results have shown that the Two-Archive algorithm outperforms existing MOEAs on problems with a large number of objectives. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Praditwong, K., & Yao, X. (2007). A new multi-objective evolutionary optimisation algorithm: The two-archive algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 95–104). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_11
Mendeley helps you to discover research relevant for your work.