Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/13816
Title: Multi-Line distance minimization: A visualized many-objective test problem suite
Authors: Li, M
Grosan, C
Yang, S
Liu, X
Yao, X
Keywords: Many-objective optimization;Evolutionary algorithms;Test problems;Visualization;Search behavior examination
Issue Date: 2017
Publisher: IEEE
Citation: IEEE Transactions on Evolutionary Computation, (2017)
Abstract: Studying the search behavior of evolutionary many objective optimization is an important, but challenging issue. Existing studies rely mainly on the use of performance indicators which, however, not only encounter increasing difficulties with the number of objectives, but also fail to provide the visual information of the evolutionary search. In this paper, we propose a class of scalable test problems, called multi-line distance minimization problem (ML-DMP), which are used to visually examine the behavior of many-objective search. Two key characteristics of the ML-DMP problem are: 1) its Pareto optimal solutions lie in a regular polygon in the two-dimensional decision space, and 2) these solutions are similar (in the sense of Euclidean geometry) to their images in the high-dimensional objective space. This allows a straightforward understanding of the distribution of the objective vector set (e.g., its uniformity and coverage over the Pareto front) via observing the solution set in the two-dimensional decision space. Fifteen well-established algorithms have been investigated on three types of 10 ML-DMP problem instances. Weakness has been revealed across classic multi-objective algorithms (such as Pareto-based, decomposition based and indicator-based algorithms) and even state-of-the-art algorithms designed especially for many-objective optimization. This, together with some interesting observations from the experimental studies, suggests that the proposed ML-DMP may also be used as a benchmark function to challenge the search ability of optimization algorithms.
URI: http://bura.brunel.ac.uk/handle/2438/13816
ISSN: 1089-778X
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf6.14 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.