Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/22445
Title: Effective and Efficient Evolutionary Many-Objective Optimization
Authors: Xue, Yani
Advisors: Liu, X
Shepperd, M
Keywords: Evolutionary algorithm;Optimal feature selection;Software product line;Bi-goal evolution;Angle-based crowding degree estimation
Issue Date: 2021
Publisher: Brunel University London
Abstract: Many-objective optimization is core to both artificial intelligence and data analytics as real-world problems commonly involve multiple objectives which are required to be optimized simultaneously. A large number of evolutionary algorithms have been developed to search for a set of Pareto optimal solutions for many-objective optimization problems. It is very rare that a many-objective evolutionary algorithm performs well in terms of both effectiveness and efficiency, two key evaluation criteria. Some algorithms may struggle to guide the solutions towards the Pareto front, e.g., Pareto-based algorithms, while other algorithms may have difficulty in diversifying the solutions evenly over the front on certain problems, e.g., decomposition-based algorithms. Furthermore, some effective algorithms may become very computationally expensive as the number of objectives increases, e.g., indicator-based algorithms. The aim of this thesis is to investigate how to make evolutionary algorithms perform well in terms of effectiveness and efficiency in many-objective optimization. After conducting a review of key concepts and the state of the art in the evolutionary many-objective optimization, this thesis shows how to improve the effectiveness of conventional Pareto-based algorithms on a challenging real-world problem in software engineering. This thesis then explores how to further enhance the effectiveness of leading many-objective evolutionary algorithms in general by extending the capability of a very popular and widely cited bi-goal evolution method. Last but not least, this thesis investigates how to strike a balance between effectiveness and efficiency of evolutionary algorithms when solving many-objective optimization problems. The work reported is based on either real-world or recognized synthetic datasets, and the proposed algorithms are compared and evaluated against leading algorithms in the field. The work does not only demonstrate ways of improving the effectiveness and efficiency of many-objective optimization algorithms but also led to promising areas for future research.
Description: This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London
URI: http://bura.brunel.ac.uk/handle/2438/22445
Appears in Collections:Computer Science
Dept of Computer Science Theses

Files in This Item:
File Description SizeFormat 
FulltextThesis.pdf2.34 MBAdobe PDFView/Open


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