Archivers for the representation of the set of approximate solutions for MOPs

作者：Schutze, O.; Hernandez, C.^*; Talbi, E-G.; Sun, J. Q.; Naranjani, Y.; Xiong, F. -R.

来源：Journal of Heuristics, 2019, 25(1): 71-105.

DOI：10.1007/s10732-018-9383-z

• Multi-objective optimization
• Pareto set
• Approximate solutions
• Convergence
• Stochastic search algorithm

In this paper we address the problem of computing suitable representations of the set of approximate solutions of a given multi-objective optimization problem via stochastic search algorithms. For this, we will propose different archiving strategies for the selection of the candidate solutions maintained by the generation process of the stochastic search process, and investigate them further on analytically and empirically. For all archivers we will provide upper bounds on the approximation quality as well as on the cardinality of the limit solution set. We conclude this work by a comparative study on some test problems in order to visualize the effect of all novel archiving strategies.

• 出版日期2019-2
• 单位天津大学