A multi-objective evolutionary approach to simulation-based optimisation of real-world problems.

This thesis presents a novel evolutionary optimisation algorithm that can improve the quality of solutions in simulation-based optimisation. Simulation-based optimisation is the process of finding optimal parameter settings without explicitly examining each possible configuration of settings. An optimisation algorithm generates potential configurations and sends these to the simulation, which acts as an evaluation function. The evaluation results are used to refine the optimisation such that it eventually returns a high-quality solution. The algorithm described in this thesis integrates multi-objective optimisation, parallelism, surrogate usage, and noise handling in a unique way for dealing with simulation-based optimisation problems incurred by these characteristics. In order to handle multiple, conflicting optimisation objectives, the algorithm uses a Pareto approach in which the set of best trade-off solutions is searched for and presented to the user. The algorithm supports a high degree of parallelism by adopting an asynchronous master-slave parallelisation model in combination with an incremental population refinement strategy. A surrogate evaluation function is adopted in the algorithm to quickly identify promising candidate solutions and filter out poor ones. A novel technique based on inheritance is used to compensate for the uncertainties associated with the approximative surrogate evaluations. Furthermore, a novel technique for multi-objective problems that effectively reduces noise by adopting a dynamic procedure in resampling solutions is used to tackle the problem of real-world unpredictability (noise). The proposed algorithm is evaluated on benchmark problems and two complex real-world problems of manufacturing optimisation. The first real-world problem concerns the optimisation of a production cell at Volvo Aero, while the second one concerns the optimisation of a camshaft machining line at Volvo Cars Engine. The results from the optimisations show that the algorithm finds better solutions for all the problems considered than existing, similar algorithms. The new techniques for dealing with surrogate imprecision and noise used in the algorithm are identified as key reasons for the good performance.University of Skövde Knowledge Foundation Swede

An Evolutionary Neural Network Approach for Slopes Stability Assessment

A current big challenge for developed or developing countries is how to keep large-scale transportation infrastructure networks operational under all conditions. Network extensions and budgetary constraints for maintenance purposes are among the main factors that make transportation network management a non-trivial task. On the other hand, the high number of parameters affecting the stability condition of engineered slopes makes their assessment even more complex and difficult to accomplish. Aiming to help achieve the more efficient management of such an important element of modern society, a first attempt at the development of a classification system for rock and soil cuttings, as well as embankments based on visual features, was made in this paper using soft computing algorithms. The achieved results, although interesting, nevertheless have some important limitations to their successful use as auxiliary tools for transportation network management tasks. Accordingly, we carried out new experiments through the combination of modern optimization and soft computing algorithms. Thus, one of the main challenges to overcome is related to the selection of the best set of input features for a feedforward neural network for earthwork hazard category (EHC) identification. We applied a genetic algorithm (GA) for this purpose. Another challenging task is related to the asymmetric distribution of the data (since typically good conditions are much more common than bad ones). To address this question, three training sampling approaches were explored: no resampling, the synthetic minority oversampling technique (SMOTE), and oversampling. Some relevant observations were taken from the optimization process, namely, the identification of which variables are more frequently selected for EHC identification. After finding the most efficient models, a detailed sensitivity analysis was applied over the selected models, allowing us to measure the relative importance of each attribute in EHC identification

Multiobjective Simulation Optimization Using Enhanced Evolutionary Algorithm Approaches

In today\u27s competitive business environment, a firm\u27s ability to make the correct, critical decisions can be translated into a great competitive advantage. Most of these critical real-world decisions involve the optimization not only of multiple objectives simultaneously, but also conflicting objectives, where improving one objective may degrade the performance of one or more of the other objectives. Traditional approaches for solving multiobjective optimization problems typically try to scalarize the multiple objectives into a single objective. This transforms the original multiple optimization problem formulation into a single objective optimization problem with a single solution. However, the drawbacks to these traditional approaches have motivated researchers and practitioners to seek alternative techniques that yield a set of Pareto optimal solutions rather than only a single solution. The problem becomes much more complicated in stochastic environments when the objectives take on uncertain (or noisy ) values due to random influences within the system being optimized, which is the case in real-world environments. Moreover, in stochastic environments, a solution approach should be sufficiently robust and/or capable of handling the uncertainty of the objective values. This makes the development of effective solution techniques that generate Pareto optimal solutions within these problem environments even more challenging than in their deterministic counterparts. Furthermore, many real-world problems involve complicated, black-box objective functions making a large number of solution evaluations computationally- and/or financially-prohibitive. This is often the case when complex computer simulation models are used to repeatedly evaluate possible solutions in search of the best solution (or set of solutions). Therefore, multiobjective optimization approaches capable of rapidly finding a diverse set of Pareto optimal solutions would be greatly beneficial. This research proposes two new multiobjective evolutionary algorithms (MOEAs), called fast Pareto genetic algorithm (FPGA) and stochastic Pareto genetic algorithm (SPGA), for optimization problems with multiple deterministic objectives and stochastic objectives, respectively. New search operators are introduced and employed to enhance the algorithms\u27 performance in terms of converging fast to the true Pareto optimal frontier while maintaining a diverse set of nondominated solutions along the Pareto optimal front. New concepts of solution dominance are defined for better discrimination among competing solutions in stochastic environments. SPGA uses a solution ranking strategy based on these new concepts. Computational results for a suite of published test problems indicate that both FPGA and SPGA are promising approaches. The results show that both FPGA and SPGA outperform the improved nondominated sorting genetic algorithm (NSGA-II), widely-considered benchmark in the MOEA research community, in terms of fast convergence to the true Pareto optimal frontier and diversity among the solutions along the front. The results also show that FPGA and SPGA require far fewer solution evaluations than NSGA-II, which is crucial in computationally-expensive simulation modeling applications

A Hybrid Tabu/Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling

As air traffic continues to increase, air traffic flow management is becoming more challenging to effectively and efficiently utilize airport capacity without compromising safety, environmental and economic requirements. Since runways are often the primary limiting factor in airport capacity, runway operations scheduling emerge as an important problem to be solved to alleviate flight delays and air traffic congestion while reducing unnecessary fuel consumption and negative environmental impacts. However, even a moderately sized real-life runway operations scheduling problem tends to be too complex to be solved by analytical methods, where all mathematical models for this problem belong to the complexity class of NP-Hard in a strong sense due to combinatorial nature of the problem. Therefore, it is only possible to solve practical runway operations scheduling problem by making a large number of simplifications and assumptions in a deterministic context. As a result, most analytical models proposed in the literature suffer from too much abstraction, avoid uncertainties and, in turn, have little applicability in practice. On the other hand, simulation-based methods have the capability to characterize complex and stochastic real-life runway operations in detail, and to cope with several constraints and stakeholders’ preferences, which are commonly considered as important factors in practice. This dissertation proposes a simulation-based optimization (SbO) approach for multi-objective runway operations scheduling problem. The SbO approach utilizes a discrete-event simulation model for accounting for uncertain conditions, and an optimization component for finding the best known Pareto set of solutions. This approach explicitly considers uncertainty to decrease the real operational cost of the runway operations as well as fairness among aircraft as part of the optimization process. Due to the problem’s large, complex and unstructured search space, a hybrid Tabu/Scatter Search algorithm is developed to find solutions by using an elitist strategy to preserve non-dominated solutions, a dynamic update mechanism to produce high-quality solutions and a rebuilding strategy to promote solution diversity. The proposed algorithm is applied to bi-objective (i.e., maximizing runway utilization and fairness) runway operations schedule optimization as the optimization component of the SbO framework, where the developed simulation model acts as an external function evaluator. To the best of our knowledge, this is the first SbO approach that explicitly considers uncertainties in the development of schedules for runway operations as well as considers fairness as a secondary objective. In addition, computational experiments are conducted using real-life datasets for a major US airport to demonstrate that the proposed approach is effective and computationally tractable in a practical sense. In the experimental design, statistical design of experiments method is employed to analyze the impacts of parameters on the simulation as well as on the optimization component’s performance, and to identify the appropriate parameter levels. The results show that the implementation of the proposed SbO approach provides operational benefits when compared to First-Come-First-Served (FCFS) and deterministic approaches without compromising schedule fairness. It is also shown that proposed algorithm is capable of generating a set of solutions that represent the inherent trade-offs between the objectives that are considered. The proposed decision-making algorithm might be used as part of decision support tools to aid air traffic controllers in solving the real-life runway operations scheduling problem

P.: Evolutionary optimisation of noisy multiobjective problems using confidence-based dynamic resampling

Abstract Many real-world optimisation problems approached by evolutionary algorithms are subject to noise. When noise is present, the evolutionary selection process may become unstable and the convergence of the optimisation adversely affected. In this paper, we present a new technique that efficiently deals with noise in multi-objective optimisation. This technique aims at preventing the propagation of inferior solutions in the evolutionary selection due to noisy objective values. This is done by using an iterative resampling procedure that reduces the noise until the likelihood of selecting the correct solution reaches a given confidence level. To achieve an efficient utilisation of resources, the number of samples used per solution varies based on the amount of noise in the present area of the search space. The proposed algorithm is evaluated on the ZDT benchmark problems and two complex real-world problems of manufacturing optimisation. The first realworld problem concerns the optimisation of engine component manufacturing in aviation industry, while the second real-world problem concerns the optimisation of a camshaft machining line in automotive industry. The results from the optimisations indicate that the proposed technique is successful in reducing noise, and it competes successfully with other noise handling techniques

Aplicação de meta-heurísticas para afinação de analisadores de espectro de vibração baseados em sistemas microeletromecânicos

Orientadores: Mateus Giesbrecht, Fabiano FruettDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: O espectro de vibração mecânica é uma característica do domínio da frequência utilizada para o monitoramento de sistemas diversos e é, tradicionalmente, calculado pela Transformada Rápida de Fourier (FFT) -- do termo em inglês Fast Fourier Transform -- de uma série temporal. Uma alternativa viável, com diversas vantagens operacionais, é o uso de microacelerômetros gêmeos para a obtenção do espectro diretamente no domínio da frequência. Essa estratégia possui sua maior limitação nas diferenças encontradas nos parâmetros físicos de acelerômetros -- devidas a seu processo de fabricação --, de tal forma que o nível de distorção do espectro pode ser consideravelmente superior àquele encontrado no espectro levantado pela FFT. Para contornar essas diferenças, neste trabalho a afinação do microdispositivo analisador de espectro é proposta através do ajuste das amplitudes das tensões de atuação dos acelerômetros. Para realizar a afinação, a Evolução Diferencial (DE, do termo em inglês Differential Evolution) é usada e o problema da afinação é abordado sob duas diferentes perspectivas de otimização: uma mono-objetivo e uma multi-objetivo. Para ambos os problemas de otimização, as funções objetivo e restrições são baseadas nas componentes da série de Fourier do ganho de malha fechada do sistema analisador de espectro -- composição essa que depende das tensões de excitação. Para a solução do problema de otimização multi-objetivo, o algoritmo DE é devidamente adaptado. As vantagens e desvantagens de ambas as estratégias de afinação são discutidas em detalhe, bem como os resultados obtidos para a aproximação do conjunto de Pareto. Esses resultados -- especialmente o compromisso distorção-sensibilidade -- são demonstrados e discutidos. A validade da estratégia de afinação proposta é evidenciada, uma vez que é capaz de determinar as amplitudes das tensões a serem aplicadas ao micro analisador de espectro para atender os requisitos de nível de distorção e sensibilidadeAbstract: The mechanical vibration spectrum is a frequency-domain characteristic used for monitoring various systems and is traditionally calculated by the Fast Fourier Transform (FFT) of a time series. Another possible alternative, with several operational advantages, is the use of twin-microaccelerometers to obtain the spectrum directly in the frequency domain. This strategy has its greatest limitation in the differences found in the accelerometers physical parameters -- due to their manufacturing process --, such that the spectrum distortion level may be considerably higher than that found in the spectrum raised by the FFT. To overcome these differences, in this work the tuning of the spectrum analyzer microdevice is proposed by adjusting the accelerometers actuation voltages amplitudes. To perform the tuning, the Differential Evolution (DE) is used and the tuning problem is approached in two different optimization perspectives: a mono-objective and a multi-objective. For both optimization problems, the objective functions and constraints are based on the Fourier series components of the spectrum analyzer system closed-loop gain -- a composition that depends on the excitation voltages. To solve the multi-objective optimization problem, the DE algorithm is properly adapted. The advantages and disadvantages of both tuning strategies are discussed in detail, as well as the results obtained for the Pareto-set approximation. The results -- specially the distortion-sensitivity compromise -- are demonstrated and discussed. The validity of the proposed tuning strategy is evidenced, since it is able to determine the voltages amplitudes to be applied to the micro spectrum analyzer to attend the distortion level and sensitivity requirementsMestradoAutomaçãoMestra em Engenharia Elétrica161153/2018-6CNP

Pedestrian-Aware Supervisory Control System Interactive Optimization of Connected Hybrid Electric Vehicles via Fuzzy Adaptive Cost Map and Bees Algorithm

Electrified vehicles are increasingly being seen as a means of mitigating the pressing concerns of traffic-related pollution. Due to the nature of engine-assisted vehicle exhaust systems, pedestrians in close proximity to these vehicles may experience events where specific emission concentrations are high enough to cause health effects. To minimize pedestrians’ exposure to vehicle emissions and pollutants nearby, we present a pedestrian-aware supervisory control system for connected hybrid electric vehicles by proposing an interactive optimization methodology. This optimization methodology combines a novel fuzzy adaptive cost map and the Bees Algorithm to optimize power-split control parameters. It enables the self-regulation of inter-objective weights of fuel and exhaust emissions based on the real-time pedestrian density information during the optimization process. The evaluation of the vehicle performance by using the proposed methodology is conducted on the realistic trip map involving pedestrian density information collected from the University College Dublin campus. Moreover, two bootstrap sampling techniques and effect of communication quality are both investigated in order to examine the robustness of the improved vehicle system. The results demonstrate that 14.42% mass of exhaust emissions can be reduced for the involved pedestrians, by using the developed fuzzy adaptive cost map

Multi-Objective Drive-Cycle Based Design Optimization of Permanent Magnet Synchronous Machines

Research conducted previously has shown that a battery electric vehicle (BEV) motor design incorporating drive-cycle optimization can lead to achievement of a higher torque density motor that consumes less energy over the drive-cycle in comparison to a conventionally designed motor. Such a motor indirectly extends the driving range of the BEV. Firstly, in this thesis, a vehicle dynamics model for a direct-drive machine and its associated vehicle parameters is implemented for the urban dynamometer driving schedule (UDDS) to derive loading data in terms of torque, speed, power, and energy. K-means clustering and Gaussian mixture modeling (GMM) are two clustering techniques used to reduce the number of machine operating points of the drive-cycle while preserving the characteristics of the entire cycle. These methods offer high computational efficiency and low computational time cost while optimizing an electric machine. Differential evolution (DE) is employed to optimize the baseline fractional slot concentrated winding (FSCW) surface permanent magnet synchronous machine (SPMSM). A computationally efficient finite element analysis (CEFEA) technique is developed to evaluate the machine at the representative drive-cycle points elicited from the clustering approaches. In addition, a steady-state thermal model is established to assess the electric motor temperature variation between optimization design candidates. In an alternative application, the drive-cycle cluster points are utilized for a computationally efficient drive-cycle system simulation that examines the effects of inverter time harmonics on motor performance. The motor is parameterized and modeled in a PSIM motor-inverter simulation that determines the current excitation harmonics that are injected into the machine during drive-cycle operation. These current excitations are inserted into the finite element analysis motor simulation for accurate analysis of the harmonic effects. The analysis summarizes the benefits of high-frequency devices such as gallium nitride (GaN) in comparison to insulated gate bipolar transistors (IGBT) in terms of torque ripple and motor efficiency on a drive-cycle