USING GA FOR EVOLVING WEIGHTS IN NEURAL NETWORKS

This article aims at studying the behavior of different types of crossover operators in the performance of Genetic Algorithm. We have also studied the effects of the parameters and variables (crossover probability (pc), mutation probability (pm), population size (pop-size) and number of generation (NG)) for controlling the algorithm. This research accumulated most of the types of crossover operators these types are implemented on evolving weights of Neural Network problem. The article investigates the role of crossover in GAs with respect to this problem, by using a comparative study between the iteration results obtained from changing the parameters values (crossover probability, mutation rate, population size and number of generation). From the experimental results, the best parameters values for the Evolving Weights of XOR-NN problem are NG = 1000, pop-size = 50, pm = 0.001, pc = 0.5 and the best operator is Line Recombination crossover

Phase Transitions and Symmetry Breaking in Genetic Algorithms with Crossover

In this paper, we consider the role of the crossover operator in genetic algorithms. Specifically, we study optimisation problems that exhibit many local optima and consider how crossover affects the rate at which the population breaks the symmetry of the problem. As an example of such a problem, we consider the subset sum problem. In so doing, we demonstrate a previously unobserved phenomenon, whereby the genetic algorithm with crossover exhibits a critical mutation rate, at which its performance sharply diverges from that of the genetic algorithm without crossover. At this critical mutation rate, the genetic algorithm with crossover exhibits a rapid increase in population diversity. We calculate the details of this phenomenon on a simple instance of the subset sum problem and show that it is a classic phase transition between ordered and disordered populations. Finally, we show that this critical mutation rate corresponds to the transition between the genetic algorithm accelerating or preventing symmetry breaking and that the critical mutation rate represents an optimum in terms of the balance of exploration and exploitation within the algorithm

A controlled migration genetic algorithm operator for hardware-in-the-loop experimentation

In this paper, we describe the development of an extended migration operator, which combats the negative effects of noise on the effective search capabilities of genetic algorithms. The research is motivated by the need to minimize the num- ber of evaluations during hardware-in-the-loop experimentation, which can carry a significant cost penalty in terms of time or financial expense. The authors build on previous research, where convergence for search methods such as Simulated Annealing and Variable Neighbourhood search was accelerated by the implementation of an adaptive decision support operator. This methodology was found to be effective in searching noisy data surfaces. Providing that noise is not too significant, Genetic Al- gorithms can prove even more effective guiding experimentation. It will be shown that with the introduction of a Controlled Migration operator into the GA heuristic, data, which repre- sents a significant signal-to-noise ratio, can be searched with significant beneficial effects on the efficiency of hardware-in-the- loop experimentation, without a priori parameter tuning. The method is tested on an engine-in-the-loop experimental example, and shown to bring significant performance benefits

When Darwin Met Einstein: Gravitational Lens Inversion with Genetic Algorithms

Gravitational lensing can magnify a distant source, revealing structural detail which is normally unresolvable. Recovering this detail through an inversion of the influence of gravitational lensing, however, requires optimisation of not only lens parameters, but also of the surface brightness distribution of the source. This paper outlines a new approach to this inversion, utilising genetic algorithms to reconstruct the source profile. In this initial study, the effects of image degradation due to instrumental and atmospheric effects are neglected and it is assumed that the lens model is accurately known, but the genetic algorithm approach can be incorporated into more general optimisation techniques, allowing the optimisation of both the parameters for a lensing model and the surface brightness of the source.Comment: 9 pages, to appear in PAS

Effects of population size for location-aware node placement in WMNs: evaluation by a genetic algorithm--based approach

Wireless mesh networks (WMNs) are cost-efficient networks that have the potential to serve as an infrastructure for advanced location-based services. Location service is a desired feature for WMNs to support location-oriented applications. WMNs are also interesting infrastructures for supporting ubiquitous multimedia Internet access for mobile or fixed mesh clients. In order to efficiently support such services and offering QoS, the optimized placement of mesh router nodes is very important. Indeed, such optimized mesh placement can support location service managed in the mesh and keep the rate of location updates low...Peer ReviewedPostprint (author's final draft