Results 1  10
of
197
A Fast and Elitist MultiObjective Genetic Algorithm: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing param ..."
Abstract

Cited by 1707 (58 self)
 Add to MetaCart
(Show Context)
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a nondominated sorting based multiobjective evolutionary algorithm (we called it the Nondominated Sorting GAII or NSGAII) which alleviates all the above three difficulties. Specifically, a fast nondominated sorting approach with O(MN ) computational complexity is presented. Second, a selection operator is presented which creates a mating pool by combining the parent and child populations and selecting the best (with respect to fitness and spread) N solutions. Simulation results on a number of difficult test problems show that the proposed NSGAII, in most problems, is able to find much better spread of solutions and better convergence near the true Paretooptimal front compared to PAES and SPEA  two other elitist multiobjective EAs which pay special attention towards creating a diverse Paretooptimal front. Moreover, we modify the definition of dominance in order to solve constrained multiobjective problems eciently. Simulation results of the constrained NSGAII on a number of test problems, including a fiveobjective, sevenconstraint nonlinear problem, are compared with another constrained multiobjective optimizer and much better performance of NSGAII is observed. Because of NSGAII's low computational requirements, elitist approach, parameterless niching approach, and simple constrainthandling strategy, NSGAII should find increasing applications in the coming years.
A Fast Elitist NonDominated Sorting Genetic Algorithm for MultiObjective Optimization: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) 4 computational complexity (where is the number of objectives and is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing ..."
Abstract

Cited by 634 (15 self)
 Add to MetaCart
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) 4 computational complexity (where is the number of objectives and is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a nondominated sorting based multiobjective evolutionary algorithm (we called it the Nondominated Sorting GAII or NSGAII) which alleviates all the above three difficulties. Specifically, a fast nondominated sorting approach with computational complexity is presented. Second, a selection operator is presented which creates a mating pool by combining the parent and child populations and selecting the best (with respect to fitness and spread) solutions. Simulation results on five difficult test problems show that the proposed NSGAII is able to find much better spread of solutions in all problems compared to PAESanother elitist multiobjective EA which pays special attention towards creating a diverse Paretooptimal front. Because of NSGAII's low computational requirements, elitist approach, and parameterless sharing approach, NSGAII should find increasing applications in the years to come.
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
, 2000
"... In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in conver ..."
Abstract

Cited by 605 (39 self)
 Add to MetaCart
(Show Context)
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in converging to the Paretooptimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand, the experimental results indicate a hierarchy of the algorithms under consideration. Furthermore, the emerging effects are evidence that the suggested test functions provide sufficient complexity to compare multiobjective optimizers. Finally, elitism is shown to be an important factor for improving evolutionary multiobjective search.
Multiobjective Evolutionary Algorithms: Analyzing the StateoftheArt
, 2000
"... Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mideighties in an attempt to stochastically solve problems of this generic class. During the past decade, ..."
Abstract

Cited by 424 (7 self)
 Add to MetaCart
(Show Context)
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mideighties in an attempt to stochastically solve problems of this generic class. During the past decade, a variety of multiobjective EA (MOEA) techniques have been proposed and applied to many scientific and engineering applications. Our discussion's intent is to rigorously define multiobjective optimization problems and certain related concepts, present an MOEA classification scheme, and evaluate the variety of contemporary MOEAs. Current MOEA theoretical developments are evaluated; specific topics addressed include fitness functions, Pareto ranking, niching, fitness sharing, mating restriction, and secondary populations. Since the development and application of MOEAs is a dynamic and rapidly growing activity, we focus on key analytical insights based upon critical MOEA evaluation of c...
A Comprehensive Survey of EvolutionaryBased Multiobjective Optimization Techniques
 Knowledge and Information Systems
, 1998
"... . This paper presents a critical review of the most important evolutionarybased multiobjective optimization techniques developed over the years, emphasizing the importance of analyzing their Operations Research roots as a way to motivate the development of new approaches that exploit the search cap ..."
Abstract

Cited by 286 (22 self)
 Add to MetaCart
(Show Context)
. This paper presents a critical review of the most important evolutionarybased multiobjective optimization techniques developed over the years, emphasizing the importance of analyzing their Operations Research roots as a way to motivate the development of new approaches that exploit the search capabilities of evolutionary algorithms. Each technique is briefly described mentioning its advantages and disadvantages, their degree of applicability and some of their known applications. Finally, the future trends in this discipline and some of the open areas of research are also addressed. Keywords: multiobjective optimization, multicriteria optimization, vector optimization, genetic algorithms, evolutionary algorithms, artificial intelligence. 1 Introduction Since the pioneer work of Rosenberg in the late 60s regarding the possibility of using geneticbased search to deal with multiple objectives, this new area of research (now called evolutionary multiobjective optimization) has grown c...
Scalable Test Problems for Evolutionary MultiObjective Optimization
 Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH
, 2001
"... After adequately demonstrating the ability to solve di#erent twoobjective optimization problems, multiobjective evolutionary algorithms (MOEAs) must now show their e#cacy in handling problems having more than two objectives. In this paper, we have suggested three di#erent approaches for systema ..."
Abstract

Cited by 150 (22 self)
 Add to MetaCart
(Show Context)
After adequately demonstrating the ability to solve di#erent twoobjective optimization problems, multiobjective evolutionary algorithms (MOEAs) must now show their e#cacy in handling problems having more than two objectives. In this paper, we have suggested three di#erent approaches for systematically designing test problems for this purpose. The simplicity of construction, scalability to any number of decision variables and objectives, knowledge of exact shape and location of the resulting Paretooptimal front, and introduction of controlled di#culties in both converging to the true Paretooptimal front and maintaining a widely distributed set of solutions are the main features of the suggested test problems. Because of the above features, they should be found useful in various research activities on MOEAs, such as testing the performance of a new MOEA, comparing di#erent MOEAs, and better understanding of the working principles of MOEAs.
Covariance Matrix Adaptation for Multiobjective Optimization
 Evolutionary Computation
"... The covariance matrix adaptation evolution strategy (CMAES) is one of the most powerful evolutionary algorithms for realvalued singleobjective optimization. In this paper, we develop a variant of the CMAES for multiobjective optimization (MOO). We first introduce a singleobjective, elitist C ..."
Abstract

Cited by 114 (13 self)
 Add to MetaCart
The covariance matrix adaptation evolution strategy (CMAES) is one of the most powerful evolutionary algorithms for realvalued singleobjective optimization. In this paper, we develop a variant of the CMAES for multiobjective optimization (MOO). We first introduce a singleobjective, elitist CMAES using plusselection and step size control based on a success rule. This algorithm is compared to the standard CMAES. The elitist CMAES turns out to be slightly faster on unimodal functions, but is more prone to getting stuck in suboptimal local minima. In the new multiobjective CMAES (MOCMAES) a population of individuals that adapt their search strategy as in the elitist CMAES is maintained. These are subject to multiobjective selection. The selection is based on nondominated sorting using either the crowdingdistance or the contributing hypervolume as second sorting criterion. Both the elitist singleobjective CMAES and the MOCMAES inherit important invariance properties, in particular invariance against rotation of the search space, from the original CMAES. The benefits of the new MOCMAES in comparison to the wellknown NSGAII and to NSDE, a multiobjective differential evolution algorithm, are experimentally shown.
MOPSO : A Proposal for Multiple Objective Particle Swarm
, 2002
"... This paper introduces a proposal to extend the heuristic called "particle swarm optimization" (PSO) to deal with multiobjective optimization problems. Our approach uses the concept of Pareto dominance to determine the flight direction of a particle and it maintains previously found nondomi ..."
Abstract

Cited by 113 (3 self)
 Add to MetaCart
This paper introduces a proposal to extend the heuristic called "particle swarm optimization" (PSO) to deal with multiobjective optimization problems. Our approach uses the concept of Pareto dominance to determine the flight direction of a particle and it maintains previously found nondominated vectors in a global repository that is later used by other particles to guide their own flight. The approach is validated using several standard test functions from the specialized literature. Our results indicate that our approach is highly competitive with current evolutionary multiobjective optimization techniques.
Scalable MultiObjective Optimization Test Problems
 in Congress on Evolutionary Computation (CECâ€™2002
, 2002
"... After adequately demonstrating the ability to solve different twoobjective optimization problems, multiobjective evolutionary algorithms (MOEAs) must now show their efficacy in handling problems having more than two objectives. In this paper, we suggest three different approaches for systematicall ..."
Abstract

Cited by 112 (8 self)
 Add to MetaCart
(Show Context)
After adequately demonstrating the ability to solve different twoobjective optimization problems, multiobjective evolutionary algorithms (MOEAs) must now show their efficacy in handling problems having more than two objectives. In this paper, we suggest three different approaches for systematically designing test problems for this purpose. The simplicity of construction, scalability to any number of decision variables and objectives, knowledge of exact shape and location of the resulting Paretooptimal front, and ability to control difficulties in both converging to the true Paretooptimal front and maintaining a widely distributed set of solutions are the main features of the suggested test problems. Because of these features, they should be found useful in various research activities on MOEAs, such as testing the performance of a new MOEA, comparing different MOEAs, and having a better understanding of the working principles of MOEAs.
The Pareto Envelopebased Selection Algorithm for Multiobjective Optimization
 Proceedings of the Parallel Problem Solving from Nature VI Conference
, 2000
"... . We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelopebased Selection Algorithm), in which selection and diversity maintenance are controlled via a simple hypergrid based scheme. PESA's selection method is relatively unusual in comparison with current ..."
Abstract

Cited by 94 (2 self)
 Add to MetaCart
. We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelopebased Selection Algorithm), in which selection and diversity maintenance are controlled via a simple hypergrid based scheme. PESA's selection method is relatively unusual in comparison with current well known multiobjective evolutionary algorithms, which tend to use counts based on the degree to which solutions dominate others in the population. The diversity maintenance method is similar to that used by certain other methods. The main attraction of PESA is the integration of selection and diversity maintenance, whereby essentially the same technique is used for both tasks. The resulting algorithm is simple to describe, with full pseudocode provided here and real code available from the authors. We compare PESA with two recent strongperforming MOEAs on some multiobjective test problems recently proposed by Deb. We find that PESA emerges as the best method overall on these problems...