A Mutual-Evaluation Genetic Algorithm for Numerical and Routing Optimization

Many real-world problems can be formulated as numerical optimization with certain objective functions. However, these objective functions often contain numerous local optima, which could trap an algorithm from moving toward the desired global solution. To improve the search efficiency of traditional genetic algorithms, this paper presents a mutual-evaluation genetic algorithm (MEGA). A novel mutual-evaluation approach is employed so that the merit of selected genes in a chromosome can be determined by comparing the fitness changes before and after interchanging with those in the mating chromosome. According to the determined genome merit, a therapy crossover can generate effective schemata to explore the solution space efficiently. The computational experiments for twelve numerical problems show that the MEGA can find near optimal solutions in all test benchmarks and achieve solutions with higher accuracy than those obtained by eight existing algorithms. This study also uses the MEGA to find optimal flow-allocation strategies for multipath-routing problems. Experiments on quality-of-service routing scenarios show that the MEGA can deal with these constrained routing problems effectively and efficiently. Therefore, the MEGA not only can reduce the effort of function analysis but also can deal with a wide spectrum of real-world problems

A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation

Copyright © 2012 Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Information Sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Sciences Vol. 183 Issue 1 (2012), DOI: 10.1016/j.ins.2011.07.013We present a new crossover operator for real-coded genetic algorithms employing a novel methodology to remove the inherent bias of pre-existing crossover operators. This is done by transforming the topology of the hyper-rectangular real space by gluing opposite boundaries and designing a boundary extension method for making the fitness function smooth at the glued boundary. We show the advantages of the proposed crossover by comparing its performance with those of existing ones on test functions that are commonly used in the literature, and a nonlinear regression on a real-world dataset

Uncovering delayed patterns in noisy and irregularly sampled time series: an astronomy application

We study the problem of estimating the time delay between two signals representing delayed, irregularly sampled and noisy versions of the same underlying pattern. We propose and demonstrate an evolutionary algorithm for the (hyper)parameter estimation of a kernel-based technique in the context of an astronomical problem, namely estimating the time delay between two gravitationally lensed signals from a distant quasar. Mixed types (integer and real) are used to represent variables within the evolutionary algorithm. We test the algorithm on several artificial data sets, and also on real astronomical observations of quasar Q0957+561. By carrying out a statistical analysis of the results we present a detailed comparison of our method with the most popular methods for time delay estimation in astrophysics. Our method yields more accurate and more stable time delay estimates: for Q0957+561, we obtain 419.6 days for the time delay between images A and B. Our methodology can be readily applied to current state-of-the-art optical monitoring data in astronomy, but can also be applied in other disciplines involving similar time series data.Comment: 36 pages, 10 figures, 16 tables, accepted for publication in Pattern Recognition. This is a shortened version of the article: interested readers are urged to refer to the published versio

Genetic Algorithms in Stochastic Optimization and Applications in Power Electronics

Genetic Algorithms (GAs) are widely used in multiple fields, ranging from mathematics, physics, to engineering fields, computational science, bioinformatics, manufacturing, economics, etc. The stochastic optimization problems are important in power electronics and control systems, and most designs require choosing optimum parameters to ensure maximum control effect or minimum noise impact; however, they are difficult to solve using the exhaustive searching method, especially when the search domain conveys a large area or is infinite. Instead, GAs can be applied to solve those problems. And efficient computing budget allocation technique for allocating the samples in GAs is necessary because the real-life problems with noise are often difficult to evaluate and require significant computation effort. A single objective GA is proposed in which computing budget allocation techniques are integrated directly into the selection operator rather than being used during fitness evaluation. This allows fitness evaluations to be allocated towards specific individuals for whom the algorithm requires more information, and this selection-integrated method is shown to be more accurate for the same computing budget than the existing evaluation-integrated methods on several test problems. A combination of studies is performed on a multi-objective GA that compares integration of different computing budget allocation methods into either the evaluation or the environmental selection steps. These comparisons are performed on stochastic problems derived from benchmark multi-objective optimization problems and consider varying levels of noise. The algorithms are compared regarding both proximity to and coverage of the true Pareto-optimal front, and sufficient studies are performed to allow statistically significant conclusions to be drawn. Finally, the multi-objective GA with selection integrated sampling technique is applied to solve a multi-objective stochastic optimization problem in a grid connected photovoltaic inverter system with noise injected from both the solar power input and the utility grid

ADAPTIVE SEARCH AND THE PRELIMINARY DESIGN OF GAS TURBINE BLADE COOLING SYSTEMS

This research concerns the integration of Adaptive Search (AS) technique such as the Genetic Algorithms (GA) with knowledge based software to develop a research prototype of an Adaptive Search Manager (ASM). The developed approach allows to utilise both quantitative and qualitative information in engineering design decision making. A Fuzzy Expert System manipulates AS software within the design environment concerning the preliminary design of gas turbine blade cooling systems. Steady state cooling hole geometry models have been developed for the project in collaboration with Rolls Royce plc. The research prototype of ASM uses a hybrid of Adaptive Restricted Tournament Selection (ARTS) and Knowledge Based Hill Climbing (KBHC) to identify multiple "good" design solutions as potential design options. ARTS is a GA technique that is particularly suitable for real world problems having multiple sub-optima. KBHC uses information gathered during the ARTS search as well as information from the designer to perform a deterministic hill climbing. Finally, a local stochastic hill climbing fine tunes the "good" designs. Design solution sensitivity, design variable sensitivities and constraint sensitivities are calculated following Taguchi's methodology, which extracts sensitivity information with a very small number of model evaluations. Each potential design option is then qualitatively evaluated separately for manufacturability, choice of materials and some designer's special preferences using the knowledge of domain experts. In order to guarantee that the qualitative evaluation module can evaluate any design solution from the entire design space with a reasonably small number of rules, a novel knowledge representation technique is developed. The knowledge is first separated in three categories: inter-variable knowledge, intra-variable knowledge and heuristics. Inter-variable knowledge and intra-variable knowledge are then integrated using a concept of compromise. Information about the "good" design solutions is presented to the designer through a designer's interface for decision support.Rolls Royce plc., Bristol (UK