Results 1  10
of
321
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...
Combining convergence and diversity in evolutionary multiobjective optimization
 Evolutionary Computation
, 2002
"... Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to �nd a number of Paretooptimal solutions in a single simulation run. Many studies have depicted different ways evolutionary algorithms c ..."
Abstract

Cited by 156 (15 self)
 Add to MetaCart
(Show Context)
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to �nd a number of Paretooptimal solutions in a single simulation run. Many studies have depicted different ways evolutionary algorithms can progress towards the Paretooptimal set with a widely spread distribution of solutions. However, none of the multiobjective evolutionary algorithms (MOEAs) has a proof of convergence to the true Paretooptimal solutions with a wide diversity among the solutions. In this paper, we discuss why a number of earlier MOEAs do not have such properties. Based on the concept ofdominance, new archiving strategies are proposed that overcome this fundamental problem and provably lead to MOEAs that have both the desired convergence and distribution properties. A number of modi�cations to the baseline algorithm are also suggested. The concept ofdominance introduced in this paper is practical and should make the proposed algorithms useful to researchers and practitioners alike.
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.
MultiObjective Optimization Using Genetic Algorithms: A Tutorial
"... abstract – Multiobjective formulations are a realistic models for many complex engineering optimization problems. Customized genetic algorithms have been demonstrated to be particularly effective to determine excellent solutions to these problems. In many reallife problems, objectives under consid ..."
Abstract

Cited by 104 (0 self)
 Add to MetaCart
(Show Context)
abstract – Multiobjective formulations are a realistic models for many complex engineering optimization problems. Customized genetic algorithms have been demonstrated to be particularly effective to determine excellent solutions to these problems. In many reallife problems, objectives under consideration conflict with each other, and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other objectives. A reasonable solution to a multiobjective problem is to investigate a set of solutions, each of which satisfies the objectives at an acceptable level without being dominated by any other solution. In this paper, an overview and tutorial is presented describing genetic algorithms developed specifically for these problems with multiple objectives. They differ from traditional genetic algorithms by using specialized fitness functions, introducing methods to promote solution diversity, and other approaches. 1.
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
(Show Context)
. 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...
MPAES: A Memetic Algorithm for Multiobjective Optimization
, 2000
"... A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carri ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, comparison is made between the new memetic algorithm, the (1+1)PAES local searcher, and the strength Pareto evolutionary algorithm (SPEA) of Zitzler and Thiele. 1 Introduction In recent years, genetic algorithms (GAs) have been applied more and more to multiobjective problems. For a comprehensive overview, see [2]. Undoubtedly, as an extremely general metaheuristic, GAs are well qualified to tackle problems of a great variety. This asset, coupled with the possession of a population, seems to make them particularly attractive for use in multiobjective problems, where a number of solutions appro...
The SelfAdaptive Pareto Differential Evolution
 In Congress on Evolutionary Computation (CEC’2002
, 2002
"... The Pareto Differential Evolution (PDE) algorithm was introduced last year and showed competitive results. The behavior of PDE, as in many other evolutionary multiobjective optimization (EMO) methods, varies according to the crossover and mutation rates. In this paper, we present a new version of PD ..."
Abstract

Cited by 74 (4 self)
 Add to MetaCart
The Pareto Differential Evolution (PDE) algorithm was introduced last year and showed competitive results. The behavior of PDE, as in many other evolutionary multiobjective optimization (EMO) methods, varies according to the crossover and mutation rates. In this paper, we present a new version of PDE with selfadaptive crossover and mutation. We call the new version Selfadaptive Pareto Differential Evolution (SPDE). The emphasis of this paper is to analyze the dynamics and behavior of SPDE. The experiments will also show that the algorithm is very competitive to other EMO algorithms.
PESAII: Regionbased Selection in Evolutionary Multiobjective Optimization
 Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2001
, 2001
"... We describe a new selection technique for evolutionary multiobjective optimization algorithms in which the unit of selection is a hyperbox in objective space. In this technique, instead of assigning a selective fitness to an individual, selective fitness is assigned to the hyperboxes in object ..."
Abstract

Cited by 64 (9 self)
 Add to MetaCart
(Show Context)
We describe a new selection technique for evolutionary multiobjective optimization algorithms in which the unit of selection is a hyperbox in objective space. In this technique, instead of assigning a selective fitness to an individual, selective fitness is assigned to the hyperboxes in objective space which are currently occupied by at least one individual in the current approximation to the Pareto frontier. A hyperbox is thereby selected, and the resulting selected individual is randomly chosen from this hyperbox. This method of selection is shown to be more sensitive to ensuring a good spread of development along the Pareto frontier than individualbased selection. The method is implemented in a modern multiobjective evolutionary algorithm, and performance is tested by using Deb's test suite of `T' functions with varying properties. The new selection technique is found to give significantly superior results to the other methods compared, namely PAES, PESA, and SPEA; each is a modern multiobjective optimization algorithm previously found to outperform earlier approaches on various problems.
Reducing local optima in singleobjective problems by multiobjectivization, in
 Proc. First International Conference on Evolutionary Multicriterion Optimization, EMO’01
, 2001
"... Abstract. One common characterization of how simple hillclimbing optimization methods can fail is that they become trapped in local optima a state where no small modi cation of the current best solution will produce a solution that is better. This measure of `better ' depends on the performan ..."
Abstract

Cited by 59 (4 self)
 Add to MetaCart
(Show Context)
Abstract. One common characterization of how simple hillclimbing optimization methods can fail is that they become trapped in local optima a state where no small modi cation of the current best solution will produce a solution that is better. This measure of `better ' depends on the performance of the solution with respect to the single objective being optimized. In contrast, multiobjective optimization (MOO) involves the simultaneous optimization of a number of objectives. Accordingly, the multiobjective notion of `better ' permits consideration of solutions that may be superior in one objective but not in another. Intuitively, we maysay that this gives a hillclimber in multiobjective space more freedom to explore and less likelihood of becoming trapped. In this paper, we investigate this intuition by comparing the performance of simple hillclimberstyle algorithms on singleobjective problems and multiobjective versions of those same problems. Using an abstract buildingblock problem we illustrate how `multiobjectivizing ' a singleobjective optimization (SOO) problem can remove local optima. Then we investigate small instances of the travelling salesman problem where additional objectives are de ned using arbitrary subtours. Results indicate that multiobjectivization can reduce local optima and facilitate improved optimization in some cases. These results enlighten our intuitions about the nature of search inmultiobjective optimization and sources of diculty in singleobjective optimization. 1
A MultiObjective Algorithm based upon Particle Swarm Optimisation, an Efficient Data Structure and Turbulence.
, 2002
"... This paper introduces a MultiObjective Algorithm (MOA) based upon the Particle Swarm Optimisation (PSO) heuristic. ..."
Abstract

Cited by 58 (2 self)
 Add to MetaCart
This paper introduces a MultiObjective Algorithm (MOA) based upon the Particle Swarm Optimisation (PSO) heuristic.