Efficient design optimization of high-performance MEMS based on a surrogate-assisted self-adaptive differential evolution

High-performance microelectromechanical systems (MEMS) are playing a critical role in modern engineering systems. Due to computationally expensive numerical analysis and stringent design specifications nowadays, both the optimization efficiency and quality of design solutions become challenges for available MEMS shape optimization methods. In this paper, a new method, called self-adaptive surrogate model-assisted differential evolution for MEMS optimization (ASDEMO), is presented to address these challenges. The main innovation of ASDEMO is a hybrid differential evolution mutation strategy combination and its self-adaptive adoption mechanism, which are proposed for online surrogate model-assisted MEMS optimization. The performance of ASDEMO is demonstrated by a high-performance electro-thermo-elastic micro-actuator, a high-performance corrugated membrane microactuator, and a highly multimodal mathematical benchmark problem. Comparisons with state-of-the-art methods verify the advantages of ASDEMO in terms of efficiency and optimization ability

FPGA-implementation of PID-controller by differential evolution optimization

We will describe an FPGA implementation of PID-controller that uses differential evolution to optimize the coefficients of the PID controller, which has been implemented in VHDL. The original differential evolution algorithm was improved by ranking based mutation operation and self-adaptation of mutation and crossover parameters. Ranking-based mutation operation improves the quality of solution, convergence rate and success of optimization. Due to the self adaptive control parameters, the user does not have to estimate the mutation and crossover rates. Optimization have been performed by calculating for each generation fitness value by means of trial parameters. The final optimal parameters are selected based on the minimum fitness.fi=vertaisarvioitu|en=peerReviewed

Nonlinear continuous global optimization by modified differential evolution

The task of global optimization is to find a point where the objective function obtains its most extreme value. Differential evolution (DE) is a population-based heuristic approach that creates new candidate solutions by combining several points of the same population. The algorithm has three parameters: amplification factor of the differential variation, crossover control parameter and population size. It is reported that DE is sensitive to the choice of these parameters. To improve the quality of the solution, in this paper, we propose a modified differential evolution introducing self-adaptive parameters, modified mutation and the inversion operator. We test our method with a set of nonlinear continuous optimization problems with simple bounds.Fundação para a Ciência e a Tecnologia (FCT

Modified differential evolution based on global competitive ranking for engineering design optimization problems

Engineering design optimization problems are formulated as large-scale mathematical programming problems with nonlinear objective function and constraints. Global optimization finds a solution while satisfying the constraints. Differential evolution is a population-based heuristic approach that is shown to be very efficient to solve global optimization problems with simple bounds. In this paper, we propose a modified differential evolution introducing self-adaptive control parameters, modified mutation, inversion operation and modified selection for obtaining global optimization. To handle constraints effectively, in modified selection we incorporate global competitive ranking which strikes the right balance between the objective function and the constraint violation. Sixteen well-known engineering design optimization problems are considered and the results compared with other solution methods. It is shown that our method is competitive when solving these problems.Fundação para a Ciência e a Tecnologia (FCT

Adaptive multimodal continuous ant colony optimization

Seeking multiple optima simultaneously, which multimodal optimization aims at, has attracted increasing attention but remains challenging. Taking advantage of ant colony optimization algorithms in preserving high diversity, this paper intends to extend ant colony optimization algorithms to deal with multimodal optimization. First, combined with current niching methods, an adaptive multimodal continuous ant colony optimization algorithm is introduced. In this algorithm, an adaptive parameter adjustment is developed, which takes the difference among niches into consideration. Second, to accelerate convergence, a differential evolution mutation operator is alternatively utilized to build base vectors for ants to construct new solutions. Then, to enhance the exploitation, a local search scheme based on Gaussian distribution is self-adaptively performed around the seeds of niches. Together, the proposed algorithm affords a good balance between exploration and exploitation. Extensive experiments on 20 widely used benchmark multimodal functions are conducted to investigate the influence of each algorithmic component and results are compared with several state-of-the-art multimodal algorithms and winners of competitions on multimodal optimization. These comparisons demonstrate the competitive efficiency and effectiveness of the proposed algorithm, especially in dealing with complex problems with high numbers of local optima

A multi-objective differential evolutionary algorithm for optimal sustainable pavement maintenance plan at the network level

Sustainable highway pavement maintenance is important for achieving sustainability in the transportation sector. Because the three aspects included in sustainability metrics (environment, economy, and society) often contradict each other, maximising the sustainability performance of highway pavements is difficult, especially at the network level. This study developed a novel multi-objective heuristic algorithm to formulate sustainable highway pavement network maintenance plans considering carbon emissions (CE), life cycle agency cost (LCAC), and pavement long-term performance (LTP). The proposed algorithm is a new variant of multi-objective differential evolution (MODE) that incorporates self-adaptive parameter control and hybrid mutation strategies embedded in its framework (MOSHDE). Three state-of-the-art multi-objective heuristics, namely, the non-dominated sorting genetic algorithm II(NSGA-II), classic MODE, and multi-objective particle swarm optimisation (MOPSO), as well as the proposed MOSHDE, were applied to an existing highway pavement network in China for performance evaluation. Compared with other heuristic algorithms, the proposed self-adaptive parameter control strategy enables the automatic adjustment of the control parameters, avoiding the time-consuming process of selecting them and enhancing the robustness and applicability of differential evolution. The hybrid mutation strategy uses both exploration and exploitation operators for the mutation operations, thus leveraging both global and local searches. The results of the numerical experiment demonstrate that MOSHDE outperforms the other tested heuristics in terms of efficiency and quality and diversity of the obtained approximate Pareto set. The optimal solutions obtained by the proposed method correspond to a proactive maintenance policy, as opposed to the reactive maintenance policy commonly adopted in current practice. In addition, these solutions are more cost-effective and environmentally friendly and can provide better pavement performance to highway users over the project life cycle. Therefore, the proposed MOSHDE may help practitioners in the transportation sector make their highway infrastructure more sustainable

Differential evolution with an evolution path: a DEEP evolutionary algorithm

Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs

Advances in global optimization of high brightness beams

High brightness electron beams play an important role in accelerator-based applications such as driving X-ray free electron laser (FEL) radiation. In this paper, we report on advances in global beam dynamics optimization of an accelerator design using start-to-end simulations and a new parallel multi-objective differential evolution optimization method. The global optimization results in significant improvement of the final electron beam brightness

Freeze-drying modeling and monitoring using a new neuro-evolutive technique

This paper is focused on the design of a black-box model for the process of freeze-drying of pharmaceuticals. A new methodology based on a self-adaptive differential evolution scheme is combined with a back-propagation algorithm, as local search method, for the simultaneous structural and parametric optimization of the model represented by a neural network. Using the model of the freeze-drying process, both the temperature and the residual ice content in the product vs. time can be determine off-line, given the values of the operating conditions (the temperature of the heating shelf and the pressure in the drying chamber). This makes possible to understand if the maximum temperature allowed by the product is trespassed and when the sublimation drying is complete, thus providing a valuable tool for recipe design and optimization. Besides, the black box model can be applied to monitor the freeze-drying process: in this case, the measurement of product temperature is used as input variable of the neural network in order to provide in-line estimation of the state of the product (temperature and residual amount of ice). Various examples are presented and discussed, thus pointing out the strength of the too