In this paper, we examine the effectiveness of an EMO (Evolutionary Multi-criterion Optimization) algorithm using a correlation based weighted sum for many objective optimization problems. Recently many EMO algorithms are proposed for various multi-objective problems. However, it is known that the convergence performance to the Pareto-frontier becomes weak in approaches using archives for non-dominated solutions since the size of archives becomes large as the number of objectives becomes large. In this paper, we show the effectiveness of using a correlation information between objectives to construct groups of objectives. Our simulation results show that while an archive-based approach, such as NSGA-II, produces a set of non-dominated solutions with better objective values in each objective, the correlation-based weighted sum approach can produce better compromise solutions that has averagely better objective values in every objective. © Springer-Verlag 2009.
CITATION STYLE
Murata, T., & Taki, A. (2010). Many-objective optimization for knapsack problems using correlation-based weighted sum approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5467 LNCS, pp. 468–480). https://doi.org/10.1007/978-3-642-01020-0_37
Mendeley helps you to discover research relevant for your work.