373 research outputs found
Combination of Evolutionary Algorithms with Experimental Design, Traditional Optimization and Machine Learning
Evolutionary algorithms alone cannot solve optimization problems very efficiently
since there are many random (not very rational) decisions in these algorithms.
Combination of evolutionary algorithms and other techniques have been proven to be an efficient optimization methodology. In this talk, I will explain the basic ideas of our three algorithms along this line (1): Orthogonal genetic algorithm
which treats crossover/mutation as an experimental design problem, (2) Multiobjective
evolutionary algorithm based on decomposition (MOEA/D) which uses decomposition techniques from traditional mathematical programming in multiobjective optimization evolutionary algorithm, and (3) Regular model based multiobjective estimation of distribution algorithms (RM-MEDA) which uses the regular property and machine learning methods for improving multiobjective evolutionary algorithms
MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems
Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) decomposes a multiobjective optimisation problem into a number of single-objective problems and optimises them in a collaborative manner. This paper investigates how to use Tabu Search (TS), a well-studied single objective heuristic to enhance MOEA/D performance. In our proposed approach, the TS is applied to these subproblems with the aim to escape from local optimal solutions. The experimental studies have shown that MOEA/D with TS outperforms the classical MOEA/D on multiobjective permutation flow shop scheduling problems. It also have demonstrated that use of problem specific knowledge can significantly improve the algorithm performance
CES-485 Approximating the Set of Pareto Optimal Solutions in Both the Decision and Objective Spaces by an Estimation of Distribution Algorithm
Most existing multiobjective evolutionary algorithms aim at approximating the PF, the distribution of the Pareto optimal
solutions in the objective space. In many real-life applications, however, a good approximation to the PS, the distribution of the
Pareto optimal solutions in the decision space, is also required by a decision maker. This paper considers a class of MOPs, in
which the dimensionalities of the PS and PF are different so that a good approximation to the PF might not approximate the PS
very well. It proposes a probabilistic model based multiobjective evolutionary algorithm, called MMEA, for approximating the PS
and the PF simultaneously for a MOP in this class. In the modelling phase of MMEA, the population is clustered into a number
of subpopulations based on their distribution in the objective space, the PCA technique is used to detect the dimensionality of the
centroid of each subpopulation, and then a probabilistic model is built for modelling the distribution of the Pareto optimal solutions
in the decision space. Such modelling procedure could promote the population diversity in both the decision and objective spaces.
To ease the burden of setting the number of subpopulations, a dynamic strategy for periodically adjusting it has been adopted in
MMEA. The experimental comparison between MMEA and the two other methods, KP1 and Omni-Optimizer on a set of test
instances, some of which are proposed in this paper, have been made in this paper. It is clear from the experiments that MMEA
has a big advantage over the two other methods in approximating both the PS and the PF of a MOP when the PS is a nonlinear
manifold, although it might not be able to perform significantly better in the case when the PS is a linear manifold
- …