For many real-world applications of evolutionary computation, the fitness function is obscured by random noise. This interferes with the evaluation and selection processes and adversely affects the performance of the algorithm. Noise can be effectively eliminated by averaging a large number of fitness samples for each candidate, but the number of samples used per candidate (the resampling rate) required to achieve this is usually prohibitively large and time-consuming. Hence there is a practical need for algorithms that handle noise without eliminating it. Moreover, the amount of noise (noise strength and distribution) may vary throughout the search space, further complicating matters. We study noisy problems for which the noise strength varies throughout the search space. Such problems have generally been ignored by previous work, which has instead generally focussed on the specific case where the noise strength is the same at all points in the search domain. However, this need not be the case, and indeed this assumption is false for many applications. For example, in games of chance such as Poker, some strategies may be more conservative than others and therefore less affected by the inherent noise of the game. This thesis makes three significant contributions in the field of noisy fitness functions: We present the concept of dynamic resampling. Dynamic resampling is a technique that varies the resampling rate based on the noise strength and fitness for each candidate individually. This technique is designed to exploit the variation in noise strength and fitness to yield a more efficient algorithm. We present several dynamic resampling algorithms and give results that show that dynamic resampling can perform significantly better than the standard resampling technique that is usually used by the optimisation community, and that dynamic resampling algorithms that vary their resampling rates based on both noise strength and fitness can perform better than algorithms that vary their resampling rate based on only one of the above. We study a specific class of noisy fitness functions for which we counterintuitively find that it is better to use a higher resampling rate in regions of lower noise strength, and vice versa. We investigate how the evolutionary search operates on such problems, explain why this is the case, and present a hypothesis (with supporting evidence) for classifying such problems. We present an adaptive engine that automatically tunes the noise compensation parameters of the search during the run, thereby eliminating the need for the user to choose these parameters ahead of time. This means that our techniques can be readily applied to real-world problems without requiring the user to have specialised domain knowledge of the problem that they wish to solve. These three major contributions present a significant addition to the body of knowledge for noisy fitness functions. Indeed, this thesis is the first work specifically to examine the implications of noise strength that varies throughout the search domain for a variety of noise landscapes, and thus starts to fill a large void in the literature on noisy fitness functions.

This research presents a solution to the problem of tuning a PID controller for a nonlinear system. Many systems in industrial applications use a PID controller to control a plant or the process. Conventional PID controllers work in linear systems but are less effective when the plant or the process is nonlinear because PID controllers cannot adapt the gain parameters as needed. In this research we design a Nonlinear PID (NPID) controller using a fuzzy logic system based on the Mamdani type Fuzzy Inference System to control three different DC motor systems. This fuzzy system is responsible for adapting the gain parameters of a conventional PID controller. This fuzzy system's rule base was heuristically evolved using an Evolutionary Algorithm (Differential Evolution). Our results show that a NPID controller can restore a moderately or a heavily under-damped DC motor system under consideration to a desired behavior (slightly under-damped).

Membrane computing investigates models of computation inspired by certain features of biological cells, especially features arising because of the presence of membranes. Because of their inherent large-scale parallelism, membrane computing models (called P systems) can be fully exploited only through the use of a parallel computing platform. However, it is an open question whether it is feasible to develop an efficient and useful parallel computing platform for membrane computing applications. Such a computing platform would significantly outperform equivalent sequential computing platforms while still achieving acceptable scalability, flexibility and extensibility. To move closer to an answer to this question, I have investigated a novel approach to the development of a parallel computing platform for membrane computing applications that has the potential to deliver a good balance between performance, flexibility, scalability and extensibility. This approach involves the use of reconfigurable hardware and an intelligent software component that is able to configure the hardware to suit the specific properties of the P system to be executed. As part of my investigations, I have created a prototype computing platform called Reconfig-P based on the proposed development approach. Reconfig-P is the only existing computing platform for membrane computing applications able to support both system-level and region-level parallelism. Using an intelligent hardware source code generator called P Builder, Reconfig-P is able to realise an input P system as a hardware circuit in various ways, depending on which aspects of P systems the user wishes to emphasise at the implementation level. For example, Reconfig-P can realise a P system in a rule-oriented manner or in a region-oriented manner. P Builder provides a unified implementation framework within which the various implementation strategies can be supported. The basic principles of this framework conform to a novel design pattern called Content-Form-Strategy. The framework seamlessly integrates the currently supported implementation approaches, and facilitates the inclusion of additional implementation strategies and additional P system features. Theoretical and empirical results regarding the execution time performance and hardware resource consumption of Reconfig-P suggest that the proposed development approach is a viable means of attaining a good balance between performance, scalability, flexibility and extensibility. Most of the existing computing platforms for membrane computing applications fail to support nondeterministic object distribution, a key aspect of P systems that presents several interesting implementation challenges. I have devised an efficient algorithm for nondeterministic object distribution that is suitable for implementation in hardware. Experimental results suggest that this algorithm could be incorporated into Reconfig-P without too significantly reducing its performance or efficiency. / Thesis (PhDInformationTechnology)--University of South Australia, 2010

This thesis summarizes knowledge in the field of time series theory, method for time series analysis and applications in financial modeling. It also resumes the area of evolutionary algorithms, their classification and applications. The core of this work combines these knowledges in order to build a system utilizing evolutionary algorithms for financial time series forecasting models optimization. Various software engineering techniques were used during the implementation phase (ACI - autonomous continual integration, autonomous quality control etc.) to ensure easy maintainability and extendibility of project by more developers.

Indiana University-Purdue University Indianapolis (IUPUI) / Evolutionary testing (ET) techniques (e.g., mutation, crossover, and natural selection) have been applied successfully to many areas of software engineering, such as error/fault identification, data mining, and software cost estimation. Previous research has also applied ET techniques to performance testing. Its application to performance testing, however, only goes as far as finding the best and worst case, execution times. Although such performance testing is beneficial, it provides little insight into performance characteristics of complex functions with multiple branches. This thesis therefore provides two contributions towards performance testing of software systems. First, this thesis demonstrates how ET and genetic algorithms (GAs), which are search heuristic mechanisms for solving optimization problems using mutation, crossover, and natural selection, can be combined with a constraint solver to target specific paths in the software. Secondly, this thesis demonstrates how such an approach can identify local minima and maxima execution times, which can provide a more detailed characterization of software performance. The results from applying our approach to example software applications show that it is able to characterize different execution paths in relatively short amounts of time. This thesis also examines a modified exhaustive approach which can be plugged in when the constraint solver cannot properly provide the information needed to target specific paths.

Indiana University-Purdue University Indianapolis (IUPUI) / Heating, ventilation, and air conditioning (HVAC) is the technology responsible to maintain temperature levels and air quality in buildings to certain standards. In a commercial setting, HVAC systems accounted for more than 50% of the total energy cost of the building in 2013 [13]. New control methods are always being worked on to improve the effectiveness and efficiency of the system. These control systems include model predictive control (MPC), evolutionary algorithm (EA), evolutionary programming (EP), and proportional-integral-derivative (PID) controllers. Such control tools are used on new HVAC system to ensure the ultimate efficiency and ensure the comfort of occupants. However, there is a need for a system that can monitor the energy performance of the HVAC system and ensure that it is operating in its optimal operation and controlled as expected. In this thesis, an air handling unit (AHU) of an HVAC system was modeled to analyze its performance using real data collected from an operating AHU using a wireless monitoring system. The purpose was to monitor the AHU's performance, analyze its key parameters to identify flaws, and evaluate the energy waste. This system will provide the maintenance personnel to key information to them to act for increasing energy efficiency. The mechanical model was experimentally validated first. Them a baseline operating condition was established. Finally, the system under extreme weather conditions was evaluated. The AHU's subsystem performance, the energy consumption and the potential wastes were monitored and quantified. The developed system was able to constantly monitor the system and report to the maintenance personnel the information they need. I can be used to identify energy savings opportunities due to controls malfunction. Implementation of this system will provide the system's key performance indicators, offer feedback for adjustment of control strategies, and identify the potential savings. To further verify the capabilities of the model, a case study was performed on an air handling unit on campus for a three month monitoring period. According to the mechanical model, a total of 63,455 kWh can be potentially saved on the unit by adjusting controls. In addition the mechanical model was able to identify other energy savings opportunities due to set point changes that may result in a total of 77,141 kWh.