Sorry, no submissions are possible during the upgrade window.
A Scalability Study and New Algorithms for Large-Scale Many-Objective Optimization
Keyword
Multi-objective OptimizationMany-objective Optimization
Computational Intelligence
Pareto Optimality
Optimization Algorithms
Metadata
Show full item recordAbstract
Many real-world optimization problems contain multiple (often conflicting) goals to be optimized concurrently, commonly referred to as multi-objective problems (MOPs). Over the past few decades, a plethora of multi-objective algorithms have been proposed, often tested on MOPs possessing two or three objectives. Unfortunately, when tasked with solving MOPs with four or more objectives, referred to as many-objective problems (MaOPs), a large majority of optimizers experience significant performance degradation. The downfall of these optimizers is that simultaneously maintaining a well-spread set of solutions along with appropriate selection pressure to converge becomes difficult as the number of objectives increase. This difficulty is further compounded for large-scale MaOPs, i.e., MaOPs possessing large amounts of decision variables. In this thesis, we explore the challenges of many-objective optimization and propose three new promising algorithms designed to efficiently solve MaOPs. Experimental results demonstrate the proposed optimizers to perform very well, often outperforming state-of-the-art many-objective algorithms.Collections
Related items
Showing items related by title, author, creator and subject.
-
Comparative Study On Cooperative Particle Swarm Optimization Decomposition Methods for Large-scale OptimizationThe vast majority of real-world optimization problems can be put into the class of large-scale global optimization (LSOP). Over the past few years, an abundance of cooperative coevolutionary (CC) algorithms has been proposed to combat the challenges of LSOP’s. When CC algorithms attempt to address large scale problems, the effects of interconnected variables, known as variable dependencies, causes extreme performance degradation. Literature has extensively reviewed approaches to decomposing problems with variable dependencies connected during optimization, many times with a wide range of base optimizers used. In this thesis, we use the cooperative particle swarm optimization (CPSO) algorithm as the base optimizer and perform an extensive scalability study with a range of decomposition methods to determine ideal divide-and-conquer approaches when using a CPSO. Experimental results demonstrate that a variety of dynamic regrouping of variables, seen in the merging CPSO (MCPSO) and decomposition CPSO (DCPSO), as well varying total fitness evaluations per dimension, resulted in high-quality solutions when compared to six state-of-the-art decomposition approaches.
-
Multi-Guide Particle Swarm Optimization for Large-Scale Multi-Objective Optimization ProblemsMulti-guide particle swarm optimization (MGPSO) is a novel metaheuristic for multi-objective optimization based on particle swarm optimization (PSO). MGPSO has been shown to be competitive when compared with other state-of-the-art multi-objective optimization algorithms for low-dimensional problems. However, to the best of the author’s knowledge, the suitability of MGPSO for high-dimensional multi-objective optimization problems has not been studied. One goal of this thesis is to provide a scalability study of MGPSO in order to evaluate its efficacy for high-dimensional multi-objective optimization problems. It is observed that while MGPSO has comparable performance to state-of-the-art multi-objective optimization algorithms, it experiences a performance drop with the increase in the problem dimensionality. Therefore, a main contribution of this work is a new scalable MGPSO-based algorithm, termed cooperative co-evolutionary multi-guide particle swarm optimization (CCMGPSO), that incorporates ideas from cooperative PSOs. A detailed empirical study on well-known benchmark problems comparing the proposed improved approach with various state-of-the-art multi-objective optimization algorithms is done. Results show that the proposed CCMGPSO is highly competitive for high-dimensional problems.
-
A Comparative Study of Evolutionary Algorithms and Particle Swarm Optimization Approaches for Constrained Multi-Objective Optimization ProblemsMany real-world problems in the fields of science and engineering contain multiple conflicting objectives which need to optimized simultaneously, as well as additional problem constraints. These problems are referred to as constrained multi-objective optimization problems (CMOPs). CMOPs do not have a single optimal solution, but instead a set of optimal trade-off solutions where an improvement in one objective worsens another. Recently, many constrained multi-objective evolutionary algorithms (CMOEAs) have been introduced for solving CMOPs. Each of these computational intelligence algorithms can be classified into one of four different approaches, which are the classic CMOEAs, co-evolutionary approaches, multi-stage approaches, and multi-tasking approaches. An extensive survey and comparative study of the aforementioned algorithms on a variety of benchmark test problems, including real-world CMOPs, is carried out in order to determine the current state-of-the-art CMOEAs. Additionally, this work proposes a multi-guide particle swarm optimization (MGPSO) for the constrained multi-objective problems. MGPSO is a multi-swarm approach, which has previously been effectively applied to other challenging optimization problems in the literature. This work adapts MGPSO for solving CMOPs and compares its performance against the aforementioned existing computational intelligence techniques. The comparative study showed that the algorithmic performance was problem-dependent. Lastly, while the proposed MGPSO approach was likewise problem-dependent, it was found to perform best for some of the real-world problems, namely the process, design and synthesis problems, and had competitive performance in the power system optimization problems.
