Tracking moving optima using Kalman-based predictions

The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness landscape. In this paper we compare different techniques for integrating motion information into an evolutionary algorithm, in the case it has to follow a time-changing optimum, under the assumption that the changes follow a nonrandom law. Such a law can be estimated in order to improve the optimum tracking capabilities of the algorithm. In particular, we will focus on first order dynamical laws to track moving objects. A vision-based tracking robotic application is used as testbed for experimental comparison

Genetic algorithms with self-organizing behaviour in dynamic environments

Copyright @ 2007 Springer-VerlagIn recent years, researchers from the genetic algorithm (GA) community have developed several approaches to enhance the performance of traditional GAs for dynamic optimization problems (DOPs). Among these approaches, one technique is to maintain the diversity of the population by inserting random immigrants into the population. This chapter investigates a self-organizing random immigrants scheme for GAs to address DOPs, where the worst individual and its next neighbours are replaced by random immigrants. In order to protect the newly introduced immigrants from being replaced by fitter individuals, they are placed in a subpopulation. In this way, individuals start to interact between themselves and, when the fitness of the individuals are close, one single replacement of an individual can affect a large number of individuals of the population in a chain reaction. The individuals in a subpopulation are not allowed to be replaced by individuals of the main population during the current chain reaction. The number of individuals in the subpopulation is given by the number of individuals created in the current chain reaction. It is important to observe that this simple approach can take the system to a self-organization behaviour, which can be useful for GAs in dynamic environments.Financial support was obtained from FAPESP (Proc. 04/04289-6)

Population-based incremental learning with associative memory for dynamic environments

Copyright © 2007 IEEE. Reprinted from IEEE Transactions on Evolutionary Computation. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In recent years there has been a growing interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) due to its importance in real world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPss. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multi-population, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multi-population schemes for PBILs in different dynamic environments

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

A self-organizing random immigrants genetic algorithm for dynamic optimization problems

This is the post-print version of the article. The official published version can be obtained from the link below - Copyright @ 2007 SpringerIn this paper a genetic algorithm is proposed where the worst individual and individuals with indices close to its index are replaced in every generation by randomly generated individuals for dynamic optimization problems. In the proposed genetic algorithm, the replacement of an individual can affect other individuals in a chain reaction. The new individuals are preserved in a subpopulation which is defined by the number of individuals created in the current chain reaction. If the values of fitness are similar, as is the case with small diversity, one single replacement can affect a large number of individuals in the population. This simple approach can take the system to a self-organizing behavior, which can be useful to control the diversity level of the population and hence allows the genetic algorithm to escape from local optima once the problem changes due to the dynamics.This work was supported by FAPESP (Proc. 04/04289-6)

On Test Functions for Evolutionary Multi-objective Optimization

In order to evaluate the relative performance of optimization algorithms benchmark problems are frequently used. In the case of multi-objective optimization (MOO), we will show in this paper that most known benchmark problems belong to a constrained class of functions with piecewise linear Pareto fronts in the parameter space. We present a straightforward way to define benchmark problems with an arbitrary Pareto front both in the fitness and parameter spaces. Furthermore, we introduce a difficulty measure based on the mapping of probability density functions from parameter to fitness space. Finally, we evaluate two MOO algorithms for new benchmark problems. © Springer-Verlag 2004

An acoustic view of ocean mixing

Knowledge of the parameter K (turbulent diffusivity/"mixing intensity") is a key to understand transport processes of matter and energy in the ocean. Especially the almost vertical component of K across the ocean stratification (diapycnal diffusivity) is vital for research on biogeochemical cycles or greenhouse gas budgets. Recent boost in precision of water velocity data that can be obtained from vessel-mounted acoustic instruments (vmADCP) allows identifying ocean regions of elevated diapycnal diffusivity during research cruises - in high horizontal resolution and without extra ship time needed. This contribution relates acoustic data from two cruises in the Tropical North East Atlantic Oxygen Minimum Zone to simultaneous field observations of diapycnal diffusivity: pointwise measurements by a microstructure profiler as well as one integrative value from a large scale Tracer Release Experiment

Learning algorithms for adaptive digital filtering

In this thesis, we consider the problem of parameter optimisation in adaptive digital filtering. Adaptive digital filtering can be accomplished using both Finite Impulse Response (FIR) filters and Infinite Impulse Response Filters (IIR) filters. Adaptive FIR filtering algorithms are well established. However, the potential computational advantages of IIR filters has led to an increase in research on adaptive IIR filtering algorithms. These algorithms are studied in detail in this thesis and the limitations of current adaptive IIR filtering algorithms are identified. New approaches to adaptive IIR filtering using intelligent learning algorithms are proposed. These include Stochastic Learning Automata, Evolutionary Algorithms and Annealing Algorithms. Each of these techniques are used for the filtering problem and simulation results are presented showing the performance of the algorithms for adaptive IIR filtering. The relative merits and demerits of the different schemes are discussed. Two practical applications of adaptive IIR filtering are simulated and results of using the new adaptive strategies are presented. Other than the new approaches used, two new hybrid schemes are proposed based on concepts from genetic algorithms and annealing. It is shown with the help of simulation studies, that these hybrid schemes provide a superior performance to the exclusive use of any one scheme