Improvements in understanding and performance of multi-objective differential evolution （多目的差分進化における理解の深化と性能向上）

信州大学(Shinshu university)博士（工学）ThesisDROZDIK MARTIN. Improvements in understanding and performance of multi-objective differential evolution （多目的差分進化における理解の深化と性能向上）. 信州大学, 2015, 博士論文. 博士（工学）, 甲第630号, 平成27年3月20日授与.doctoral thesi

Development and Integration of Geometric and Optimization Algorithms for Packing and Layout Design

The research work presented in this dissertation focuses on the development and application of optimization and geometric algorithms to packing and layout optimization problems. As part of this research work, a compact packing algorithm, a physically-based shape morphing algorithm, and a general purpose constrained multi-objective optimization algorithm are proposed. The compact packing algorithm is designed to pack three-dimensional free-form objects with full rotational freedom inside an arbitrary enclosure such that the packing efficiency is maximized. The proposed compact packing algorithm can handle objects with holes or cavities and its performance does not degrade significantly with the increase in the complexity of the enclosure or the objects. It outputs the location and orientation of all the objects, the packing sequence, and the packed configuration at the end of the packing operation. An improved layout algorithm that works with arbitrary enclosure geometry is also proposed. Different layout algorithms for the SAE and ISO luggage are proposed that exploit the unique characteristics of the problem under consideration. Several heuristics to improve the performance of the packing algorithm are also proposed. The proposed compact packing algorithm is benchmarked on a wide variety of synthetic and hypothetical problems and is shown to outperform other similar approaches. The physically-based shape morphing algorithm proposed in this dissertation is specifically designed for packing and layout applications, and thus it augments the compact packing algorithm. The proposed shape morphing algorithm is based on a modified mass-spring system which is used to model the morphable object. The shape morphing algorithm mimics a quasi-physical process similar to the inflation/deflation of a balloon filled with air. The morphing algorithm starts with an initial manifold geometry and morphs it to obtain a desired volume such that the obtained geometry does not interfere with the objects surrounding it. Several modifications to the original mass-spring system and to the underlying physics that governs it are proposed to significantly speed-up the shape morphing process. Since the geometry of a morphable object continuously changes during the morphing process, most collision detection algorithms that assume the colliding objects to be rigid cannot be used efficiently. And therefore, a general-purpose surface collision detection algorithm is also proposed that works with deformable objects and does not require any preprocessing. Many industrial design problems such as packing and layout optimization are computationally expensive, and a faster optimization algorithm can reduce the number of iterations (function evaluations) required to find the satisfycing solutions. A new multi-objective optimization algorithm namely Archive-based Micro Genetic Algorithm (AMGA2) is presented in this dissertation. Improved formulation for various operators used by the AMGA2 such as diversity preservation techniques, genetic variation operators, and the selection mechanism are also proposed. The AMGA2 also borrows several concepts from mathematical sciences to improve its performance and benefits from the existing literature in evolutionary optimization. A comprehensive benchmarking and comparison of AMGA2 with other state-of-the-art optimization algorithms on a wide variety of mathematical problems gleaned from literature demonstrates the superior performance of AMGA2. Thus, the research work presented in this dissertation makes contributions to the development and application of optimization and geometric algorithms

Stochastic and deterministic algorithms for continuous black-box optimization

Continuous optimization is never easy: the exact solution is always a luxury demand and the theory of it is not always analytical and elegant. Continuous optimization, in practice, is essentially about the efficiency: how to obtain the solution with same quality using as minimal resources (e.g., CPU time or memory usage) as possible? In this thesis, the number of function evaluations is considered as the most important resource to save. To achieve this goal, various efforts have been implemented and applied successfully. One research stream focuses on the so-called stochastic variation (mutation) operator, which conducts an (local) exploration of the search space. The efficiency of those operator has been investigated closely, which shows a good stochastic variation should be able to generate a good coverage of the local neighbourhood around the current search solution. This thesis contributes on this issue by formulating a novel stochastic variation that yields good space coverage. Algorithms and the Foundations of Software technolog

Improving Multi-Objective Test Case Selection by Injecting Diversity in Genetic Algorithms

A way to reduce the cost of regression testing consists of selecting or prioritizing subsets of test cases from a test suite according to some criteria. Besides greedy algorithms, cost cognizant additional greedy algorithms, multi-objective optimization algorithms, and Multi-Objective Genetic Algorithms (MOGAs), have also been proposed to tackle this problem. However, previous studies have shown that there is no clear winner between greedy and MOGAs, and that their combination does not necessarily produce better results. In this paper we show that the optimality of MOGAs can be significantly improved by diversifying the solutions (sub-sets of the test suite) generated during the search process. Specifically, we introduce a new MOGA, coined as DIV-GA (DIversity based Genetic Algorithm), based on the mechanisms of orthogonal design and orthogonal evolution that increase diversity by injecting new orthogonal individuals during the search process. Results of an empirical study conducted on eleven programs show that DIV-GA outperforms both greedy algorithms and the traditional MOGAs from the optimality point of view. Moreover, the solutions (sub-sets of the test suite) provided by DIV-GA are able to detect more faults than the other algorithms, while keeping the same test execution cost

マルチフィデリティ法による効率的大域最適化法の構築と航空設計への応用

首都大学東京, 2018-03-25, 博士（工学）首都大学東

Evolutionary Algorithms in Engineering Design Optimization

Evolutionary algorithms (EAs) are population-based global optimizers, which, due to their characteristics, have allowed us to solve, in a straightforward way, many real world optimization problems in the last three decades, particularly in engineering fields. Their main advantages are the following: they do not require any requisite to the objective/fitness evaluation function (continuity, derivability, convexity, etc.); they are not limited by the appearance of discrete and/or mixed variables or by the requirement of uncertainty quantification in the search. Moreover, they can deal with more than one objective function simultaneously through the use of evolutionary multi-objective optimization algorithms. This set of advantages, and the continuously increased computing capability of modern computers, has enhanced their application in research and industry. From the application point of view, in this Special Issue, all engineering fields are welcomed, such as aerospace and aeronautical, biomedical, civil, chemical and materials science, electronic and telecommunications, energy and electrical, manufacturing, logistics and transportation, mechanical, naval architecture, reliability, robotics, structural, etc. Within the EA field, the integration of innovative and improvement aspects in the algorithms for solving real world engineering design problems, in the abovementioned application fields, are welcomed and encouraged, such as the following: parallel EAs, surrogate modelling, hybridization with other optimization techniques, multi-objective and many-objective optimization, etc

Many-Objective Hybrid Optimization Under Uncertainty With Applications

A novel method for solving many-objective optimization problems under uncertainty was developed. It is well known that no single optimization algorithm performs best for all problems. Therefore, the developed method, a many-objective hybrid optimizer (MOHO), uses five constitutive algorithms and actively switches between them throughout the optimization process allowing for robust optimization. MOHO monitors the progress made by each of the five algorithms and allows the best performing algorithm more attempts at finding the optimum. This removes the need for user input for selecting algorithm as the best performing algorithm is automatically selected thereby increasing the probability of converging to the optimum. An uncertainty quantification framework, based on sparse polynomial chaos expansion, to propagate the uncertainties in the input parameter to the objective functions was also developed and validated. Where the samples and analysis runs needed for standard polynomial chaos expansion increases exponentially with the dimensionality, the presented sparse polynomial chaos approach efficiently propagates the uncertainty with only a few samples, thereby greatly reducing the computational cost. The performance of MOHO was investigated on a total of 65 analytical test problems from the DTLZ and WFG test suite, for which the analytical solution is known. MOHO is also applied to two additional real-life cases of aerodynamic shape design of subsonic and hypersonic bodies. Aerodynamic shape optimization is often computationally expensive and is, therefore, a good test case to investigate MOHO`s ability to reduce the computational time through robust optimization and accelerated convergence. The subsonic design optimization had three objectives: maximize lift and minimize drag and moment. The hypersonic design optimization had two objectives: maximize volume and minimize drag. Two accelerated solvers based on fast multipole method and Newton impact theory are developed for simulating subsonic and hypersonic flows. The results show that MOHO performed, on average, better than all five remaining algorithms in 52% of the DTLZ+WFG problems. The results of robust optimization of a subsonic body and hypersonic bodies were in good agreement with theory. The MOHO developed is capable of solving many-objective, multi-objective and single objective, constrained and unconstrained optimization problems with and without uncertainty with little user input

Surrogate Model Optimisation for PWR Fuel Management

Pressurised Water Reactor (PWR) fuel management is an operational problem for nuclear operators, requiring solutions on a regular basis throughout the life of the plant. A variety of conflicting factors and changing goals mean that fuel loading pattern design problems are multiobjective and, by design, have many input variables. This causes a combinatorial explosion, known as the ‘curse of dimensionality’, which makes these complex problems difficult to investigate. In this thesis, the method of surrogate model optimisation is adapted to PWR loading pattern generation. Surrogate models are developed based around three approaches: deep learning methods (convolutional neural networks and multi-layer perceptrons), the fission matrix and simulated quantum annealing. The models are used to predict core parameters of reactors in simplified optimisation scenarios for a microcore, a small modular reactor, and a ‘standard’ PWR. The experiments with deep learning models show that competitive results can be obtained for training sets using a much lower number of simulations than direct optimisation. Fission matrix experiments demonstrate the method to predict core parameters for the first time, with interesting preliminary results. Novel experiments using simulated quantum annealing demonstrate the technique is able to generate loading patterns by following heuristic rules and is suitable for application to custom optimisation hardware. The principal contribution of this work is to show that surrogate model optimisation can be used to augment fuel loading pattern optimisation, generating competitive results and providing enormous computational cost reduction and thus permitting more investigation within a given computational budget. These methods can also make use of new computational hardware such as neural chips and quantum annealers. The promising methods developed in this thesis thus provide candidate implementations that can bring the benefits of these innovations to the sphere of nuclear engineering