2,735 research outputs found
Improved sampling of the pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we present a simple steady-state strategy, Pareto Converging Genetic Algorithm (PCGA), which naturally samples the solution space and ensures population advancement towards the Pareto-front. PCGA eliminates the need for sharing/niching and thus minimizes heuristically chosen parameters and procedures. A systematic approach based on histograms of rank is introduced for assessing convergence to the Pareto-front, which, by definition, is unknown in most real search problems.
We argue that there is always a certain inheritance of genetic material belonging to a population, and there is unlikely to be any significant gain beyond some point; a stopping criterion where terminating the computation is suggested. For further encouraging diversity and competition, a nonmigrating island model may optionally be used; this approach is particularly suited to many difficult (real-world) problems, which have a tendency to get stuck at (unknown) local minima. Results on three benchmark problems are presented and compared with those of earlier approaches. PCGA is found to produce diverse sampling of the Pareto-front without niching and with significantly less computational effort
The influence of mutation on population dynamics in multiobjective genetic programming
Using multiobjective genetic programming with a complexity objective to overcome tree bloat is usually very successful but can sometimes lead to undesirable collapse of the population to all single-node trees. In this paper we report a detailed examination of why and when collapse occurs. We have used different types of crossover and mutation operators (depth-fair and sub-tree), different evolutionary approaches (generational and steady-state), and different datasets (6-parity Boolean and a range of benchmark machine learning problems) to strengthen our conclusion. We conclude that mutation has a vital role in preventing population collapse by counterbalancing parsimony pressure and preserving population diversity. Also, mutation controls the size of the generated individuals which tends to dominate the time needed for fitness evaluation and therefore the whole evolutionary process. Further, the average size of the individuals in a GP population depends on the evolutionary approach employed. We also demonstrate that mutation has a wider role than merely culling single-node individuals from the population; even within a diversity-preserving algorithm such as SPEA2 mutation has a role in preserving diversity
Multi-objective genetic optimisation for self-organising fuzzy logic control
This is the post-print version of the article. The official published version can be accessed from the link below.A multi-objective genetic algorithm is developed for the purpose of optimizing the rule-base of a Self-Organising Fuzzy Logic Control algorithm (SOFLC). The tuning of the SOFLC optimization is based on selection of the best shaped performance index for modifying the rule-base on-line. A comparative study is conducted between various methods of multi-objective genetic optimisation using the SOFLC algorithm on the muscle relaxant anaesthesia system, which includes a severe non-linearity, varying dynamics and time-delay
Recommended from our members
A GA-based technique for the scheduling of storage tanks
YesThis paper proposes the application of a
genetic algorithm based methodology for the scheduling
of storage tanks. The proposed approach is an
integration of GA and heuristic rule-based techniques,
which decomposes the complex mixed integer
optimisation problem into integer and real number subproblems.
The GA string considers the integer problem,
and the heuristic approach solves the real number
problems within the GA framework. The algorithm is
demonstrated for a test problem related to a water
treatment facility at a port, and has been found to give a
significantly better schedule than those generated using a
heuristic-based approach
Genetic Algorithms in Time-Dependent Environments
The influence of time-dependent fitnesses on the infinite population dynamics
of simple genetic algorithms (without crossover) is analyzed. Based on general
arguments, a schematic phase diagram is constructed that allows one to
characterize the asymptotic states in dependence on the mutation rate and the
time scale of changes. Furthermore, the notion of regular changes is raised for
which the population can be shown to converge towards a generalized
quasispecies. Based on this, error thresholds and an optimal mutation rate are
approximately calculated for a generational genetic algorithm with a moving
needle-in-the-haystack landscape. The so found phase diagram is fully
consistent with our general considerations.Comment: 24 pages, 14 figures, submitted to the 2nd EvoNet Summerschoo
- …