Study on Genetic Algorithm Improvement and Application

Genetic Algorithms (GAs) are powerful tools to solve large scale design optimization problems. The research interests in GAs lie in both its theory and application. On one hand, various modifications have been made on early GAs to allow them to solve problems faster, more accurately and more reliably. On the other hand, GA is used to solve complicated design optimization problems in different applications. The study in this thesis is both theoretical and applied in nature. On the theoretical side, an improved GA�Evolution Direction Guided GA (EDG-GA) is proposed based on the analysis of Schema Theory and Building Block Hypothesis. In addition, a method is developed to study the structure of GA solution space by characterizing interactions between genes. This method is further used to determine crossover points for selective crossover. On the application side, GA is applied to generate optimal tolerance assignment plans for a series of manufacturing processes. It is shown that the optimal tolerance assignment plan achieved by GA is better than that achieved by other optimization methods such as sensitivity analysis, given comparable computation time

Multiscale composite optimization with design guidelines

http://www.emse.fr/~leriche/Full_Paper_Irisarri_Le_Riche_final.pdfInternational audienceComposites show two distinctive features that affect the way in which they are optimized. Firstly, manufacturing strongly interacts with structural performance. Secondly, composites can be described at different scales. This article summarizes contributions that address both features. It is shown how design guidelines can be accounted for in laminate blended design through stacking sequence tables and specialized evolutionary algorithms. It is also explained how the optimization can be made more efficient by simultaneously working at the ply and laminate levels

A comprehensive survey on cultural algorithms

Peer reviewedPostprin

Genetic programming in data mining for drug discovery

Genetic programming (GP) is used to extract from rat oral bioavailability (OB) measurements simple, interpretable and predictive QSAR models which both generalise to rats and to marketed drugs in humans. Receiver Operating Characteristics (ROC) curves for the binary classier produced by machine learning show no statistical dierence between rats (albeit without known clearance dierences) and man. Thus evolutionary computing oers the prospect of in silico ADME screening, e.g. for \virtual" chemicals, for pharmaceutical drug discovery

Computational model for neural architecture search

A long-standing goal in Deep Learning (DL) research is to design efficient architectures for a given dataset that are both accurate and computationally inexpensive. At present, designing deep learning architectures for a real-world application requires both human expertise and considerable effort as they are either handcrafted by careful experimentation or modified from a handful of existing models. This method is inefficient as the process of architecture design is highly time-consuming and computationally expensive. The research presents an approach to automate the process of deep learning architecture design through a modeling procedure. In particular, it first introduces a framework that treats the deep learning architecture design problem as a systems architecting problem. The framework provides the ability to utilize novel and intuitive search spaces to find efficient architectures using evolutionary methodologies. Secondly, it uses a parameter sharing approach to speed up the search process and explores its limitations with search space. Lastly, it introduces a multi-objective approach to facilitate architecture design based on hardware constraints that are often associated with real-world deployment. From the modeling perspective, instead of designing and staging explicit algorithms to process images/sentences, the contribution lies in the design of hybrid architectures that use the deep learning literature developed so far. This approach enjoys the benefit of a single problem formulation to perform end-to-end training and architecture design with limited computational resources --Abstract, page iii