Results 1 - 10
of
100
Multi-Objective Optimization Using Genetic Algorithms: A Tutorial
"... abstract – Multi-objective 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 real-life problems, objectives under consid ..."
Abstract
-
Cited by 114 (0 self)
- Add to MetaCart
(Show Context)
abstract – Multi-objective 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 real-life 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 multi-objective 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.
A multi-objective evolutionary algorithm based on decomposition
- IEEE Transactions on Evolutionary Computation, Accepted
, 2007
"... 1 Decomposition is a basic strategy in traditional multiobjective optimization. However, this strategy has not yet widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition (MOEA/D). It decomposes a MOP into a number o ..."
Abstract
-
Cited by 44 (14 self)
- Add to MetaCart
1 Decomposition is a basic strategy in traditional multiobjective optimization. However, this strategy has not yet widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algorithm based on decomposition (MOEA/D). It decomposes a MOP into a number of scalar optimization subproblems and optimizes them simultaneously. Each subproblem is optimized by using information from its several neighboring subproblems, which makes MOEA/D have lower computational complexity at each generation than MOGLS and NSGA-II. Experimental results show that it outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjective optimization problems. Index Terms multiobjective optimization, decomposition, evolutionary algorithms, memetic algorithms, Pareto optimality, computational complexity. I.
An introduction to Multiobjective Metaheuristics for Scheduling and Timetabling
- Metaheuristic for Multiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems
, 2004
"... ..."
(Show Context)
The Design of Memetic Algorithms for Scheduling and Timetabling Problems
- Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing
, 2004
"... Summary. There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes, and they usually require very time-consuming fitness ..."
Abstract
-
Cited by 23 (2 self)
- Add to MetaCart
(Show Context)
Summary. There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes, and they usually require very time-consuming fitness evaluation routines. There is a considerable number of memetic algorithms that have been proposed in the literature to solve scheduling and timetabling problems. In this chapter, we concentrate on identifying and discussing those strategies that appear to be particularly useful when designing memetic algorithms for this type of problems. For example, the many different ways in which knowledge of the problem domain can be incorporated into memetic algorithms is very helpful to design effective strategies to deal with infeasibility of solutions. Memetic algorithms employ local search, which serves as an effective intensification mechanism that is very useful when using sophisticated representation schemes and time-consuming fitness evaluation functions. These algorithms also incorporate a population, which gives them an effective explorative ability to sample huge search spaces. Another important aspect that has been investigated when designing memetic algorithms for scheduling and timetabling problems, is how to establish the right balance between the work performed by the genetic search and the work performed by the local search. Recently, researchers have put considerable attention in the design of self-adaptive memetic algorithms. That is, to incorporate memes that adapt themselves according to the problem domain being solved and also to the particular conditions of the search process. This chapter also discusses some recent ideas proposed by researchers that might be useful when designing self-adaptive memetic algorithms. Finally, we give a summary of the issues discussed throughout the chapter and propose some future research directions in the design of memetic algorithms for scheduling and timetabling problems. 1
RM-MEDA: a regularity model-based multi-objective estimation of distribution algorithm
- IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 2007
"... Under mild conditions, it can be induced from the Karush–Kuhn–Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is a piecewise continuous @ IA-D manifold, where is the number of objectives. Based on this regularity property, we propose ..."
Abstract
-
Cited by 19 (3 self)
- Add to MetaCart
Under mild conditions, it can be induced from the Karush–Kuhn–Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is a piecewise continuous @ IA-D manifold, where is the number of objectives. Based on this regularity property, we propose a regularity model-based multiobjective estimation of distribution algorithm (RM-MEDA) for continuous multiobjective optimization problems with variable linkages. At each generation, the proposed algorithm models a promising area in the decision space by a probability distribution whose centroid is a @ IA-D piecewise continuous manifold. The local principal component analysis algorithm is used for building such a model. New trial solutions are sampled from the model thus built. A nondominated sorting-based selection is used for choosing solutions for the next generation. Systematic experiments have shown that, overall, RM-MEDA outperforms three other state-of-the-art algorithms, namely, GDE3, PCX-NSGA-II, and MIDEA, on a set of test instances with variable linkages. We have demonstrated that, compared with GDE3, RM-MEDA is not sensitive to algorithmic parameters, and has good scalability to the number of decision variables in the case of nonlinear variable linkages. A few shortcomings of RM-MEDA have also been identified and discussed in this paper.
Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems
- SOFT COMPUTING
, 2007
"... Parallel Memetic Algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have sho ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
(Show Context)
Parallel Memetic Algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have shown that they converge to high quality solutions significantly faster than canonical GAs and MAs. However, the use of local learning for every individual throughout the PMA search can be a very computationally intensive and inefficient process. This paper presents a study on two diversity-adaptive strategies, i.e., 1) diversity-based static adaptive strategy (PMA-SLS) and 2) diversity-based dynamic adaptive strategy (PMA-DLS) for controlling the local search frequency in the PMA search. Empirical study on a class of NP-hard combinatorial optimization problem, particularly large-scale quadratic assignment problems (QAPs) shows that the diversity-adaptive PMA converges to competitive solutions at significantly lower computational cost when compared to the canonical MA and PMA. Furthermore, it is found that the diversity-based dynamic adaptation strategy displays better robustness in terms of solution quality across the class of QAP problems considered. Static adaptation strategy on the other hand requires extra effort in selecting suitable parameters to suit the problems in hand.
Dgpf – an adaptable framework for distributed multi-objective search algorithms applied to the genetic programming of sensor networks
- In Proceedings of the Second International Conference on Bioinspired Optimization Methods and their Application, BIOMA 2006
, 2006
"... Abstract: We present DGPF, a framework providing multi-objective, auto-adaptive search algorithms with a focus on Genetic Programming. We first introduce a Common Search API, suitable to explore arbitrary problem spaces with different search algorithms. Using our implementation of Genetic Algorithms ..."
Abstract
-
Cited by 15 (10 self)
- Add to MetaCart
(Show Context)
Abstract: We present DGPF, a framework providing multi-objective, auto-adaptive search algorithms with a focus on Genetic Programming. We first introduce a Common Search API, suitable to explore arbitrary problem spaces with different search algorithms. Using our implementation of Genetic Algorithms as an example, we elaborate on the distribution utilities of the framework which enable local, Master/Slave, Peer-To-Peer, and P2P/MS hybrid distributed search execution. We also discuss how heterogeneous searches consisting of multiple, cooperative search algorithms can be constructed. Sensor networks are distributed systems of nodes with scarce resources. We demonstrate how Genetic Programming based on our framework can be applied to create algorithms for sensor nodes that use these resources very efficiently.
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: Methods and Analysis
, 2006
"... ..."
Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
, 2008
"... ..."
RM-MEDA: A Regularity Model Based Multiobjective Estimation of Distribution Algorithm
, 2008
"... Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m − 1)-D piecewise continuous, where m is the number of objectives. Based on this regularity property, we propose a Regul ..."
Abstract
-
Cited by 14 (8 self)
- Add to MetaCart
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m − 1)-D piecewise continuous, where m is the number of objectives. Based on this regularity property, we propose a Regularity Model based Multiobjective Estimation of Distribution Algorithm (RM-MEDA) for continuous multiobjective optimization problems with variable linkages. At each generation, the proposed algorithm models a promising area in the decision space by a probability distribution whose centroid is a (m−1)-D piecewise continuous manifold. The Local Principal Component Analysis algorithm is used for building such a model. New trial solutions are sampled from the model thus built. A nondominated sorting based selection is used for choosing solutions for the next generation. Systematic experiments have shown that, overall, RM-MEDA outperforms three other state-of-theart algorithms, namely, GDE3, PCX-NSGA-II and MIDEA, on a set of test instances with variable linkages. We have demonstrated that, compared with GDE3, RM-MEDA is not sensitive to algorithmic parameters, and has good scalability to the number of decision variables in the case of nonlinear variable linkages. A few shortcomings of RM-MEDA have also been identified and discussed in this paper.
