Search

In this paper, we discuss a method for generating new individuals such that their mean vector and the covariance matrix are defined by formulas analogous to the covariance matrix adaptation evolution strategy (CMA-ES). In contrast to CMA-ES, which generates new individuals using multivariate Gaussian distribution with an explicitly defined covariance matrix, the introduced method uses combinations of difference vectors between archived individuals and univariate Gaussian random vectors along directions of past shifts of the population midpoints. We use this method to formulate the differential evolution strategy (DES)—an algorithm that is a crossover between differential evolution (DE) and CMA-ES. The numerical results presented in this paper indicate that DES is competitive against CMA-ES in performing both local and global optimization. [ABSTRACT FROM AUTHOR]

This paper presents a novel method for optimizing a planar elliptical dipole antenna with elliptical slots, for ultrawideband electromagnetic compatibility applications. The antenna is required to achieve minimum return loss and boresight realized gain with an adequate gain flatness across the frequency range of 1–5 GHz. Such an antenna is a powerful tool for electromagnetic measurements, due to its very compact size and its wide operating bandwidth. The main optimization method used in this paper is the invasive weed optimization (IWO), which is a nature-inspired metaheuristic evolutionary algorithm. The conventional and a modified version of IWO are compared to other prior-art evolutionary algorithms, such as the particle swarm optimization and differential evolution. The comparison is performed by applying all the methods on a set of mathematical test functions and also on the specific antenna design problem presented in this paper. The comparative results demonstrate the superiority of the modified IWO over the other optimization methods. [ABSTRACT FROM AUTHOR]

When solving constrained optimization problems (COPs) by evolutionary algorithms, the search algorithm plays a crucial role. In general, we expect that the search algorithm has the capability to balance not only diversity and convergence but also constraints and objective function during the evolution. For this purpose, this paper proposes a composite differential evolution (DE) for constrained optimization, which includes three different trial vector generation strategies with distinct advantages. In order to strike a balance between diversity and convergence, one of these three trial vector generation strategies is able to increase diversity, and the other two exhibit the property of convergence. In addition, to accomplish the tradeoff between constraints and objective function, one of the two trial vector generation strategies for convergence is guided by the individual with the least degree of constraint violation in the population, and the other is guided by the individual with the best objective function value in the population. After producing offspring by the proposed composite DE, the feasibility rule and the $\boldsymbol {\varepsilon }$ constrained method are combined elaborately for selection in this paper. Moreover, a restart scheme is proposed to help the population jump out of a local optimum in the infeasible region for some extremely complicated COPs. By assembling the above techniques together, a constrained composite DE is proposed. The experiments on two sets of benchmark test functions with various features, i.e., 24 test functions from IEEE CEC2006 and 18 test functions with 10 dimensions and 30 dimensions from IEEE CEC2010, have demonstrated that the proposed method shows better or at least competitive performance against other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

This paper proposes an evolutionary algorithm-based energy-saving control strategy to control a highly nonlinear and time-varying active magnetic bearing (AMB) positioning system that considers energy efficiency and control performance simultaneously. Most AMB control schemes use a bias current with a superimposed control current to improve the linearity and dynamic performance of the system. However, the bias current causes power losses even if no electromagnetic force is required. As such, a recurrent wavelet fuzzy neural network with adaptive differential evolution (RWFNN-ADE)-based dynamic bias current control strategy is proposed in this paper so as to minimize the energy consumed by an AMB without altering its positioning performance and robustness. To begin with, this paper analyzes the operation principle of the AMB positioning system with a differential driving mode. Subsequently, the proposed RWFNN-ADE control scheme, in which the control current and bias current are controlled by the RWFNN and ADE, respectively, is introduced in detail. Finally, the experimental results demonstrate the high-accuracy control and significant energy-saving performances of the proposed RWFNN-ADE-controlled AMB positioning system. In the tests corresponding to operation periods of 10 and 50 s, the energy improvements compared to the baseline values were 20.24% and 17.65%, respectively, in nominal cases, and 18.89% and 18.68%, respectively, in parameter variation cases, for the proposed control strategy. [ABSTRACT FROM AUTHOR]

Artificial intelligence evolved as a powerful tool in condition monitoring of the induction motor for early diagnosis of bearing faults. This paper attempted to identify the features to improve the accuracy of diagnosis using the benchmark database of the Case Western Reserve University (CWRU) and the Machinery Fault Prevention Technology (MFPT). In this paper, 18 time-domain features are extracted constituting six proposed time-dependent spectral features (TDSFs) and 12 statistical time-domain features. For the first time, a set of six TDSFs are extracted to diagnose the bearing faults. This involves extracting frequency-domain features using the relationship between Parseval’s theorem and the Fourier transform directly from the time domain. Particle swarm optimization (PSO) and wheel-based differential evolution (WBDE) feature selection algorithms are also implemented to identify four prominent features. It is found that three of the four selected features are TDSF features, and results of selected features revealed the attainment of 90.92% for 48 class identifications of CWRU database and 100% for 17 class identifications of the MFPT database, respectively. [ABSTRACT FROM AUTHOR]

This paper develops an improved dual-stator Vernier machine using ferrite magnet materials, aiming to replace an industrial interior permanent magnet machine with rare earth magnets in a low speed industrial application. The improved Vernier machine design adapts the single winding dual-stator topology with an empty inner stator core mainly to improve the torque density and eliminate the heat from the inner stator windings of conventional dual-stator Vernier machines. A drum rotor is also proposed to provide mechanical and structural enhancements. This paper compares the performance of the improved Vernier machine design against an industrial interior permanent magnet machine with rare earth magnets. The comparison shows that the improved design using ferrite magnets has even higher torque density and efficiency than those exhibited in the industrial interior permanent magnet machine with rare earth magnets. The improved Vernier machine design has considerable potential to replace industrial rare earth interior permanent magnet machines in low speed applications. [ABSTRACT FROM AUTHOR]

The ultimate goal of the Internet of Things (IoT) is to provide ubiquitous services. To achieve this goal, many challenges remain to be addressed. Inspired from the cooperative mechanisms between multiple systems in the human being, this paper proposes a bio-inspired self-learning coevolutionary algorithm (BSCA) for dynamic multiobjective optimization of IoT services to reduce energy consumption and service time. BSCA consists of three layers. The first layer is composed of multiple subpopulations evolving cooperatively to obtain diverse Pareto fronts. Based on the solutions obtained by the first layer, the second layer aims to further increase the diversity of solutions. The third layer refines the solutions found in the second layer by adopting an adaptive gradient refinement search strategy and a dynamic optimization method to cope with changing concurrent multiple service requests, thereby effectively improving the accuracy of solutions. Experiments on agricultural IoT services in the presence of dynamic requests under different distributions are performed based on two service-providing strategies, i.e., single service and collaborative service. The simulation results demonstrate that BSCA performs better than four existing algorithms on IoT services, in particular for high-dimensional problems. [ABSTRACT FROM AUTHOR]

This paper proposes a dynamic analytics method based on the least squares support vector machine with a hybrid kernel to address real-time prediction problems in the converter steelmaking process. The hybrid kernel function is used to enhance the performance of the existing kernels. To improve the model’s accuracy, the internal parameters are optimized by a differential evolution algorithm. In light of the complex mechanisms of the converter steelmaking process, a multistage modeling strategy is designed instead of the traditional single-stage modeling method. Owing to the dynamic nature of the practical production process, great effort has been made to construct a dynamic model that uses the prediction error information based on the static model. The validity of the proposed method is verified through experiments on real-world data collected from a basic oxygen furnace steelmaking process. The results indicate that the proposed method can successfully solve dynamic prediction problems and outperforms other state-of-the-art methods in terms of prediction accuracy. Note to Practitioners—With the development of cyber-physical systems, abundant real-time data have been collected from the converter steelmaking process. These data provide an opportunity to solve product quality prediction problems using data-driven models. This paper proposes a dynamic analytics method based on the least squares support vector machine with a hybrid kernel to address this challenging issue. To improve the model’s performance, a differential evolution algorithm is used to optimize its parameters. Because of the fierce physicochemical reaction in the converter furnace, it is difficult for a single-stage model to achieve accurate predictions. Thus, a multistage modeling strategy is proposed to address this difficulty, and a dynamic model based on feedback error is developed to realize real-time prediction. We verify the effectiveness of the proposed method using real data from a basic oxygen furnace (BOF) steelmaking process. The computational results reveal that the proposed method has a higher prediction accuracy than other methods, making it helpful in guaranteeing the specified product quality and in maintaining stable BOF operation. [ABSTRACT FROM AUTHOR]

A new dual-mechanical-port (DMP) electric machine for hybrid electric vehicle applications, particularly in the power-split continuously variable transmission systems, is proposed in this paper. In order to comprehensively and quantitatively evaluate the pros and cons of the proposed machine, a comparative study of four DMP electric machines with different topologies is conducted. These four investigated DMP electric machines include a conventional DMP machine, a DMP machine with spoke-type permanent magnets, a DMP machine with reluctance rotor, and a DMP machine with open slots which is the proposed machine in this paper. Even though these four machines have similar topologies, they have different operating principles, which are demonstrated in detail. The comparison results indicate that the DMP machine with open slots outperforms the others in terms of torque/power density, efficiency, magnet utilization, etc. Accordingly, the DMP machine with open slots is selected for further investigation and optimization. A large-scale multi-objective optimization is carried out for this machine, where the differential evolution algorithm serves as a global search engine to target optimal performance. Finally, an optimal design is prototyped, and the experimental results are performed to verify the effectiveness of the analysis and simulation results in this paper. [ABSTRACT FROM AUTHOR]

In the design of high-temperature superconductor (HTS)-based electromagnetic devices, some of the major challenges include ac loss reduction, minimization of heat leakage, and reduction of the amount of HTS material used to decrease costs. This paper considers a computer model of HTS-based leads involving a multiphysics scenario that considers the electromagnetic and thermal behavior of the system. This paper attempts to address the requirements mentioned and provides an optimum solution by applying an approach based on multiobjective optimization. The differential evolution technique, a stochastic method, widely known for the ease of use and its ability to handle adequately non-differentiable, non-linear, and multimodal cost functions was used. The proposed framework provides a technique to optimize effectively HTS leads, which not only deals with the non-linear aspect of HTS materials, but also includes a multiphysics environment. [ABSTRACT FROM AUTHOR]

Nonlinear equations system (NES) arises commonly in science and engineering. Repulsion techniques are considered to be the effective methods to locate different roots of NES. In general, the repulsive radius needs to be given by the user before the run. However, its optimal parameter setting is difficult and problem-dependent. To alleviate this drawback, in this paper, we first propose a dynamic repulsion technique, and then a general framework based on the dynamic repulsion technique and evolutionary algorithms (EAs) is presented to effectively solve NES. The major advantages of our framework are: 1) the repulsive radius is controlled dynamically during the evolutionary process; 2) multiple roots of NES can be simultaneously located in a single run; 3) the diversity of the population is preserved due to the population reinitialization; and 4) different repulsion techniques and different EAs can be readily integrated into this framework. To extensively evaluate the performance of our framework, we choose 42 problems with diverse features as the test suite. In addition, some representative differential evolution and particle swarm optimization variants are incorporated into the framework. Our method is also compared with other state-of-the-art methods. Experimental results indicate that the dynamic repulsion technique can improve the performance of the original repulsion technique with static repulsive radius. Moreover, the proposed method is able to yield better results compared with other methods. [ABSTRACT FROM AUTHOR]

This paper presents an optimization method for selective harmonic elimination in a cascaded multilevel inverter using teaching–learning-based optimization (TLBO). The main objective in selective harmonic elimination (SHE) strategy is to eliminate low-order harmonics by solving nonlinear equations and reaching optimal solution, while the fundamental component is satisfied. In this paper, in one side, the influence of optimal dc sources is investigated to reach the SHE goal, and in another side, comparing optimization methods is considered. In this paper, the TLBO as a recently emerged nature-inspired algorithm is presented to provide better results for the SHE in comparison with genetic algorithm, artificial bee colony, imperialistic competitive algorithm, harmony search, ant colony optimization, particle swarm optimization, and differential evolution. For better comparison of those methods and influence of optimal dc sources, 5-, 9-, and 15-level inverters are chosen and MATLAB software is used for optimization. Simulation results show the superiority of TLBO, higher precision and probability of convergence than other mentioned algorithms. Finally, to validate the influence of optimal dc sources and the accuracy of TLBO results, the experimental setup is conducted for a 5-level cascaded H-bridge inverter with optimal dc sources. [ABSTRACT FROM AUTHOR]

Niching techniques have been widely incorporated into evolutionary algorithms (EAs) for solving multimodal optimization problems (MMOPs). However, most of the existing niching techniques are either sensitive to the niching parameters or require extra fitness evaluations (FEs) to maintain the niche detection accuracy. In this paper, we propose a new automatic niching technique based on the affinity propagation clustering (APC) and design a novel niching differential evolution (DE) algorithm, termed as automatic niching DE (ANDE), for solving MMOPs. In the proposed ANDE algorithm, APC acts as a parameter-free automatic niching method that does not need to predefine the number of clusters or the cluster size. Also, it can facilitate locating multiple peaks without extra FEs. Furthermore, the ANDE algorithm is enhanced by a contour prediction approach (CPA) and a two-level local search (TLLS) strategy. First, the CPA is a predictive search strategy. It exploits the individual distribution information in each niche to estimate the contour landscape, and then predicts the rough position of the potential peak to help accelerate the convergence speed. Second, the TLLS is a solution refine strategy to further increase the solution accuracy after the CPA roughly predicting the peaks. Compared with the other state-of-the-art DE and non-DE multimodal algorithms, even the winner of competition on multimodal optimization, the experimental results on 20 widely used benchmark functions illustrate the superiority of the proposed ANDE algorithm. [ABSTRACT FROM AUTHOR]

A comparative study of five-phase outer-rotor flux-switching permanent magnet (FSPM) machines with different topologies for in-wheel traction applications is presented in this paper. Those topologies include double-layer winding, single-layer winding, C-core, and E-core configurations. The electromagnetic performance in the low-speed region, the flux-weakening capability in the high-speed region, and the fault-tolerance capability are all investigated in detail. The results indicate that the E-core FSPM machine has performance advantages. Furthermore, two kinds of E-core FSPM machines with different stator and rotor pole combinations are optimized, respectively. In order to reduce the computational burden during the large-scale optimization process, a mathematical technique is developed based on the concept of computationally efficient finite-element analysis. While a differential evolution algorithm serves as a global search engine to target optimized designs. Subsequently, multiobjective tradeoffs are presented based on a Pareto-set for 20 000 candidate designs. Finally, an optimal design is prototyped, and some experimental results are given to confirm the validity of the simulation results in this paper. [ABSTRACT FROM AUTHOR]

In this paper, we propose a framework to accelerate the computational efficiency of evolutionary algorithms on large-scale multiobjective optimization. The main idea is to track the Pareto optimal set (PS) directly via problem reformulation. To begin with, the algorithm obtains a set of reference directions in the decision space and associates them with a set of weight variables for locating the PS. Afterwards, the original large-scale multiobjective optimization problem is reformulated into a low-dimensional single-objective optimization problem. In the reformulated problem, the decision space is reconstructed by the weight variables and the objective space is reduced by an indicator function. Thanks to the low dimensionality of the weight variables and reduced objective space, a set of quasi-optimal solutions can be obtained efficiently. Finally, a multiobjective evolutionary algorithm is used to spread the quasi-optimal solutions over the approximate Pareto optimal front evenly. Experiments have been conducted on a variety of large-scale multiobjective problems with up to 5000 decision variables. Four different types of representative algorithms are embedded into the proposed framework and compared with their original versions, respectively. Furthermore, the proposed framework has been compared with two state-of-the-art algorithms for large-scale multiobjective optimization. The experimental results have demonstrated the significant improvement benefited from the framework in terms of its performance and computational efficiency in large-scale multiobjective optimization. [ABSTRACT FROM AUTHOR]

Niching techniques have recently been incorporated into evolutionary algorithms (EAs) for multisolution optimization in multimodal landscape. However, existing niching techniques inevitably increase the time complexity of basic EAs due to the computation of the distance matrix of individuals. In this paper, we propose a fast niching technique. The technique avoids pairwise distance calculations by introducing the locality sensitive hashing, an efficient algorithm for approximately retrieving nearest neighbors. Individuals are projected to a number of buckets by hash functions. The similar individuals possess a higher probability of being hashed into the same bucket than the dissimilar ones. Then, interactions between individuals are limited to the candidates that fall in the same bucket to achieve local evolution. It is proved that the complexity of the proposed fast niching is linear to the population size. In addition, this mechanism induces stable niching behavior and it inherently keeps a balance between the exploration and exploitation of multiple optima. The theoretical analysis conducted in this paper suggests that the proposed technique is able to provide bounds for the exploration and exploitation probabilities. Experimental results show that the fast niching versions of the multimodal algorithms can exhibit similar or even better performance than their original ones. More importantly, the execution time of the algorithms is significantly reduced. [ABSTRACT FROM AUTHOR]

Surrogate-assisted evolutionary algorithms (SAEAs) are promising methods for solving high-dimensional expensive problems. The basic idea of SAEAs is the integration of nature-inspired searching ability of evolutionary algorithms and prediction ability of surrogate models. This paper proposes a novel evolutionary sampling assisted optimization (ESAO) method which combines the two abilities to consider global exploration and local exploitation. Differential evolution is employed to generate offspring using mutation and crossover operators. A global radial basis functions surrogate model is built for prescreening of the offspring’s objective function values and identifying the best one, which will be evaluated with the true function. The best offspring will replace its parent’s position in the population if its function value is smaller than that of its parent. A local surrogate model is then built with selected current best solutions. An optimizer is applied to find the optimum of the local model. The optimal solution is then evaluated with the true function. Besides, a better point found in the local search will be added into the population in the global search. Global and local searches will alternate if one search cannot lead to a better solution. Comprehensive analysis is conducted to study the mechanism of ESAO and insights are gained on different local surrogates. The proposed algorithm is compared with two state-of-the-art SAEAs on a series of high-dimensional problems and results show that ESAO behaves better both in effectiveness and robustness on most of the test problems. Besides, ESAO is applied to an airfoil optimization problem to show its effectiveness. [ABSTRACT FROM AUTHOR]

Recent research has revealed that the output of deep neural networks (DNNs) can be easily altered by adding relatively small perturbations to the input vector. In this paper, we analyze an attack in an extremely limited scenario where only one pixel can be modified. For that we propose a novel method for generating one-pixel adversarial perturbations based on differential evolution (DE). It requires less adversarial information (a black-box attack) and can fool more types of networks due to the inherent features of DE. The results show that 67.97% of the natural images in Kaggle CIFAR-10 test dataset and 16.04% of the ImageNet (ILSVRC 2012) test images can be perturbed to at least one target class by modifying just one pixel with 74.03% and 22.91% confidence on average. We also show the same vulnerability on the original CIFAR-10 dataset. Thus, the proposed attack explores a different take on adversarial machine learning in an extreme limited scenario, showing that current DNNs are also vulnerable to such low dimension attacks. Besides, we also illustrate an important application of DE (or broadly speaking, evolutionary computation) in the domain of adversarial machine learning: creating tools that can effectively generate low-cost adversarial attacks against neural networks for evaluating robustness. [ABSTRACT FROM AUTHOR]

There have been few researches on solving multimodal multiobjective optimization problems, whereas they are commonly seen in real-world applications but difficult for the existing evolutionary optimizers. In this paper, we propose a novel multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. In the proposed algorithm, the properties of decision variables and the relationships among them are analyzed at first to guide the evolutionary search. Then, a general framework using two archives, i.e., the convergence and the diversity archives, is adopted to cooperatively solve these problems. Moreover, the diversity archive simultaneously employs a clustering strategy to guarantee diversity in the objective space and a niche-based clearing strategy to promote the same in the decision space. At the end of evolution process, solutions in the convergence and the diversity archives are recombined to obtain a large number of multiple Pareto optimal solutions. In addition, a set of benchmark test functions and a performance metric are designed for multimodal multiobjective optimization. The proposed algorithm is empirically compared with two state-of-the-art evolutionary algorithms on these test functions. The comparative results demonstrate that the overall performance of the proposed algorithm is significantly superior to the competing algorithms. [ABSTRACT FROM AUTHOR]

Recently, magnetic gears have drawn wide attention due to their inherent merits, such as noncontact operation, high torque density, and intrinsic overload protection. In this paper, an analytical calculation based on magnet magnetomotive force permeance theory is adopted to analyze the modulation effect in a magnetic gear. After that, the effects of some key parameters on magnetic gear performance are investigated, including the air-slot-opening-to-pole-pitch ratio $c_0$ , the magnet-arc-to-permanent-magnet-pole-pitch ratio $\alpha$ , and the permanent magnet thickness $h_m$. In particular, three types of steel pole pieces are considered: radial slots, parallel teeth, and parallel slots. A global optimization design is then carried out by using the differential evolution algorithm, and some useful suggestions are derived from the optimal Pareto range. Finally, the determination of outer rotor yoke thickness is discussed considering the iron saturation, and the iron loss distribution is investigated. This paper will be helpful for the design and optimization of a coaxial magnetic gear. [ABSTRACT FROM AUTHOR]

Contactors are typical electromagnetic devices whose optimization is multi-objective optimization problems. Contactors’ static and dynamic characteristics obtained by the finite-element method (FEM) are typical objectives. Due to the low efficiency of FEM, the intelligent optimization algorithms that require multiple computations cannot be applied well here. In this paper, a fast algorithm for characteristics of contactors based on radial basis function neural network approximate model is proposed. The orthogonal least squares, data pre-processing and subsection modeling methods are adopted here to make the model more accurate. Meanwhile, a hybrid multi-objective optimization algorithm which combines the differential evolution and the particle swarm optimization is also proposed to speed up convergence and obtain the limit optimal solutions. The feasibility of the above-mentioned methods has been verified by solving a multi-objective optimization problem of the contactor with solenoid structure. [ABSTRACT FROM AUTHOR]

The aim of the paper is the study of an optimal integration of a supercapacitor-based storage system and inductive power transfer system for the free-catenary operation of a tramway. Starting from the definition of the topology of inductive power transfer system, we propose and analyze a design procedure for the pads of the inductive power system. In the second part of the paper, an optimal integration strategy for the correct size of on-board supercapacitors and the power of the inductive energy transfer are proposed. The results obtained by means of numerical simulations are discussed. [ABSTRACT FROM AUTHOR]

Design of electromagnetic devices has multimodal, multidimensional, and constrained characteristics. Metaheuristic approaches are good choices for tackling these design problems owing to their simulation-based property. As many electromagnetic design problems require a long computing time to solve (even on modern computers) and many heuristic approaches have been created, the major goal of this paper is to improve the effectiveness and robustness of existing approaches. This paper proposes an algorithm with the ensemble of two composite differential evolution (DE) ingredients. One ingredient is biased toward exploration and the other is biased toward exploitation. The probability of choosing which ingredient to search for new solutions is adaptively updated based on the previous performance of each ingredient. The algorithm is applied to solve a loudspeaker design problem with promising performance when compared with DE, artificial bee colony, two improved artificial bee colony algorithms, and a randomly choosing ingredients algorithm. [ABSTRACT FROM AUTHOR]

This paper describes a systematic method for optimally designing with multiple objectives and differential evolution (DE) algorithms, current regulated electronically controlled synchronous reluctance (SynRel) machines. A large-scale study with thousands of designs calculated with a ultrafast computationally efficient electromagnetic finite-element analysis (CE-FEA) establishes the performance limitations of conventional radially laminated technology with multiple flux barriers. The potential advantages of employing permanent-magnet (PM)-assisted technology with additional ferrites in the rotor are quantified in terms of substantially improved power factor, specific power, and efficiency. Numerical and experimental results for a 10-hp, 1800-r/min typical rating are included. [ABSTRACT FROM PUBLISHER]

Trajectory planning plays a crucial role in train operation by providing with the authorized speed at each position. The traditional static train trajectory planning methods are always designed offline according to a preplanned timetable, and they ignored the uncertainties of parameters, resulted by line condition, resistance coefficient, and delay. These uncertain disturbances have not been considered adequately in previous studies. This paper deals with the dynamic optimal train trajectory planning problem with uncertainties. First, in order to identify uncertain resistance coefficients and calculate the dynamic limited speed, we present the optimization framework using onboard equipment such as a global navigation satellite system (GNSS) terminal, a power supply system, and a communication device to sample the real-time traffic information. Then, by taking the energy consumption and punctuality as objectives, we propose a moving horizon train trajectory planning optimization model with an adaptive weight allocation mechanism based on trip time error. The innovation of this paper lies not only in the establishment of a novel dynamic optimization model for train trajectory planning but also the strategy that combines real-time traffic information with the trajectory planning procedure. By contrast with most existing solutions, the proposed approach fully takes advantage of the real-time information and thus avoids the difficulties for modeling the uncertain coefficients for train trajectory planning. The efficiency of the proposed approach is illustrated by showing some numerical results of simulations with the infrastructure data from Beijing-Shanghai High-speed Railway of China. [ABSTRACT FROM PUBLISHER]

Convergence performance and parametric sensitivity are two issues that tend to be neglected when extending differential evolution (DE) to multiobjective optimization (MO). To fill this research gap, we develop two novel mutation operators and a new parameter adaptation mechanism. A multiobjective DE variant is obtained through integration of the proposed strategies. The main innovation of this paper is the simultaneous use of individuals across generations from an objective-based perspective. Good convergence–diversity tradeoff and satisfactory exploration–exploitation balance are achieved via the hybrid cross-generation mutation operation. Furthermore, the cross-generation adaptation mechanism enables the individuals to self-adapt their associated parameters not only optimization-stage-wise but also objective-space-wise. Empirical results indicate the statistical superiority of the proposed algorithm over several state-of-the-art evolutionary algorithms in handling MO problems. [ABSTRACT FROM PUBLISHER]

Real-time taxi–passenger matching plays a critical role in modern taxi dispatch systems. Currently, the greedy strategy is widely adopted, which limits the quality of the service (QoS) and the profit of the entire system. There are two crucial tasks in this system: 1) the pairwise prioritization and 2) the matching of taxi–passenger pairs. In this paper, we develop a two-stage taxi–passenger matching system to deal with these two tasks. In the first stage, we design a fuzzy controller to assign a priority score to each taxi–passenger pair in real time. To ensure its performance on providing good QoS and profit, the fuzzy controller is optimized by an offline differential evolution algorithm. New individual representation is designed to optimize the membership functions and fuzzy rule base simultaneously. To accelerate the optimization process, the algorithm is implemented in a parallel way. Then, in the second stage, considering the priority scores as weights in the bipartite graph of taxi and passenger sets, we further apply a polynomial Kuhn–Munkres algorithm to find the maximum weight perfect matching in the bipartite graph. Simulated results validate the effectiveness of the proposed algorithm, which is able to enhance the QoS provided by the taxi system and improve the profit gained by the taxi service company. [ABSTRACT FROM AUTHOR]

Fuzzy PID control is a control method with good adaptability and stability in complex environments. It is used to achieve precise regulation and stable control of the system. In this paper, a fish scale evolution GSOM is proposed to improve the control method of fuzzy PID. Firstly, the fish scale regulation system is established and the differential evolution theory is introduced to realize the evolutionary upgrading of the system. Secondly, the GSOM module is introduced. The system is optimized by self-organized mapping neural network to achieve dynamic regulation of polymorphic inputs. Meanwhile, the fuzzy rule base and parameter regulation mechanism in fuzzy PID control are dynamically optimized. Improve the performance of the control system. Finally, the control method of improved fuzzy PID for fish scale evolution GSOM is simulated using MATLAB. The simulation experiments also compare several traditional PID control methods. The comparison indexes include stability, robustness, control accuracy and feedback output effect. The results show that the method in this paper is more stable and has fewer iterations when facing the dynamic input environment. The tracking error and control output of the controller system are significantly improved. It has good feedback output effect, solves the saturation problem and has higher control accuracy.

Pareto dominance-based multiobjective optimization has been successfully applied to constrained evolutionary optimization during the last two decades. However, as another famous multiobjective optimization framework, decomposition-based multiobjective optimization has not received sufficient attention from constrained evolutionary optimization. In this paper, we make use of decomposition-based multiobjective optimization to solve constrained optimization problems (COPs). In our method, first of all, a COP is transformed into a biobjective optimization problem (BOP). Afterward, the transformed BOP is decomposed into a number of scalar optimization subproblems. After generating an offspring for each subproblem by differential evolution, the weighted sum method is utilized for selection. In addition, to make decomposition-based multiobjective optimization suit the characteristics of constrained evolutionary optimization, weight vectors are elaborately adjusted. Moreover, for some extremely complicated COPs, a restart strategy is introduced to help the population jump out of a local optimum in the infeasible region. Extensive experiments on three sets of benchmark test functions, namely, 24 test functions from IEEE CEC2006, 36 test functions from IEEE CEC2010, and 56 test functions from IEEE CEC2017, have demonstrated that the proposed method shows better or at least competitive performance against other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Switched reluctance (SR) machines are attractive because they present relatively high efficiency and torque density in spite of lacking permanent magnets. This paper focuses on a two-objective optimization of an external rotor SR motor with a stator that has concentrated coils and a rotor with magnetically isolated modules. The objectives are minimum loss and mass, and 11 independent dimensionless geometric variables are considered as inputs that affect them. A combined design of experiments (DOE) and differential evolution (DE) approach is proposed. The DOE methodology is used to reduce the search space by eliminating from consideration input variable values, leading to poor-performing designs. Following this initial DOE study, an optimization study based on DE is run over the reduced search space, which leads to significant savings in computation time. Furthermore, a directed graph-based method for comparing different designs on the Pareto front to rank the best compromise designs is proposed. [ABSTRACT FROM AUTHOR]

Frequency deviations of power systems caused by grid-connected wind power fluctuations is one of the key factors which restrains the increase of wind penetration level. This paper examines a combined wind and hybrid energy storage system (HESS, supercapacitor, and battery) to smooth wind power fluctuations. A fuzzy-based wind-HESS system (FWHS) controller is proposed to suppress the wind power fluctuations. The proposed controller takes full advantage of the complimentary characteristics of the supercapacitor and battery with the supercapacitor and battery in charge of high and middle frequency components of wind fluctuations, respectively. A differential evolution (DE)-based optimal sizing method for HESS systems is introduced to evaluate the minimum capacity of HESS as being limited by grid frequency deviation. The efficiency of the proposed scheme in the paper for wind-HESS system is evaluated by a real Chinese power system. [ABSTRACT FROM AUTHOR]

The emergence of Bluetooth low energy (BLE) beacons has promoted the development of proximity-based service (PBS), which is a context-aware application delivered subject to the Proximity of Interest (PoI). Most commercial applications use the sequential proximity detection with a fixed scanning mechanism to identify the target PoI. Such sequential execution, though is able to produce reliable detection, suffers severe performance degradation especially when the number of deployed beacons in the vicinity increases. To understand the effects of dense deployment, we conduct an empirical investigation and derive the statistical properties of both received signal strength (RSS) and signal inter-arrival time. In light of the statistical insights, this paper proposes a high resolution proximity detection using an adaptive scanning mechanism fusion with a spontaneous Differential Evolution (AS+sDE ). This novel approach enables the receiver to adapt its scanning duration conditioned on the deployment density and make an almost spontaneous detection in parallel with the scanning. The feasibility of the proposed approach is verified by both simulations and real-world implementations. For a density of $\leq 5\ beacons/m^2$ , AS+sDE achieves a superior performance with a high accuracy rate, i.e., on average $<1s$ is spent to guarantee at least 90 percent accuracy. [ABSTRACT FROM AUTHOR]

This paper presents a three-dimensional (3-D) performance analysis and multiobjective design optimization of coreless-type permanent magnet linear synchronous motors. The average of open circuit magnetic field distribution is analytically predicted by solving two Laplace's equations. The winding factor calculation, which requires an approach different from conventional slotted motors, is provided to evaluate the motor performances. As a result, average thrust and thrust ripple can be obtained without loss of accuracy compared with results of 2-D finite element analysis (FEA). The 3-D leakage influences are subsequently incorporated into the analysis using lumped parameter magnetic circuit model because end effects are not neglected due to a relatively large air gap. Consequently, two meaningful contributions of this paper are summarized as follows: first, 3-D electromagnetic performances can be accurately predicted by the proposed analytical method. Second, with no need for the time-consuming 3-D FEA, differential evolution, a practical approach to global optimization, can simply be employed to search for solutions which belong to the Pareto optimal set. Finally, the validity of the analytical results is confirmed with the experimental results. [ABSTRACT FROM PUBLISHER]

This paper presents different methods to determine the parameters for the equivalent electrical circuit model of a high-frequency planar transformer. The first method is implemented in the circuit simulation software utilizing a 1-D electromagnetic analysis. The second method uses a 3-D electromagnetic analysis and is implemented in a finite-element analysis software. The third method is a differential evolution (DE)-based algorithm using the experimental transformer data. The first two methods are useful in the design stage to predict the performance of a planar transformer, while the third one can be applied to validate the design. The performance and accuracy of the three methods are assessed by comparing each method’s parameter estimate of an actual planar transformer. The comparison showed that the predictions of magnetizing inductance by the two numerical analyses are accurate and comparable with that of the DE-based estimation method. However, the series resistance and leakage inductance determined by the DE algorithm tend to be higher, as predicted by the two numerical methods, due to the nonconsideration of the measuring leads impedance in the numerical models. [ABSTRACT FROM AUTHOR]

This paper discusses a goodness index and introduces a badness factor for electric machines with a special reference to synchronous reluctance motors. This factor is then used in conjunction with a computationally efficient finite-element electromagnetic analysis and a differential evolution optimization algorithm in order to carry out a large-scale design study under comparable specifications with an induction motor. It is shown that for synchronous reluctance machines, careful rotor geometry optimization can improve the performance, and that the inherent limitations, including those for the power factor, can be systematically established. The correlations for specific average torque, copper and core losses, and efficiency are also discussed. [ABSTRACT FROM AUTHOR]

Energy storage systems (ESSs) play a significant role in performance improvement of future electric traction systems. This paper investigates an ESS based on supercapacitors for trams as a reliable technical solution with considerable energy saving potential. Operating the ESS onboard a tram brings the following benefits: reduction of peak power demands, decrease of power consumption, improvement of performance, and efficiency. Whereas the commonly used ESS power management (PM) has been dealing only with PM without vehicle position knowledge, the main emphasis of the presented research is put on position-based Takagi–Sugeno fuzzy (T-S fuzzy) PM for human-driven trams with an ESS. The tram position, located by, e.g., a Global Positioning System module, is used to predict future energy demands and power flows. This information is used in the preparation of the supercapacitor energy level and its power flow control. The optimal ESS power flow with respect to the tram position is a very complex problem. Therefore, soft computing techniques are used in this paper. The main part of the proposed ESS PM is the T-S fuzzy controller. The T-S fuzzy reduces problem dimensionality using expert knowledge represented by the rules. The output membership functions were optimized by differential evolution. The designed ESS PM was verified on real traffic data. [ABSTRACT FROM PUBLISHER]

Differential evolution has been shown to be an effective methodology for solving optimization problems over continuous space. In this paper, we propose an eigenvector-based crossover operator. The proposed operator utilizes eigenvectors of covariance matrix of individual solutions, which makes the crossover rotationally invariant. More specifically, the donor vectors during crossover are modified, by projecting each donor vector onto the eigenvector basis that provides an alternative coordinate system. The proposed operator can be applied to any crossover strategy with minimal changes. The experimental results show that the proposed operator significantly improves DE performance on a set of 54 test functions in CEC 2011, BBOB 2012, and CEC 2013 benchmark sets. [ABSTRACT FROM AUTHOR]

In recent years, electric vehicle charging stations (EVCSs) have been deployed very fast, which offer a platform for the energy coordination between electric vehicles (EVs) and the electricity distribution system (DS). This paper presents an energy management method for the operation of EVCSs and DS while considering their interaction. In this method, we first use a quality-of-service constrained decision model for EVCSs, which is formulated based on the network calculus theory. Then, the DS aims to maximize its utility by scheduling charging plans for EVCSs. Afterwards, a game based on the supply function equilibrium (SFE) model is adopted to analyze the energy interaction, in which each EVCS is regarded as the leader, and the DS as the follower. In this way, an optimization problem with equilibrium constraints is established. Moreover, a hybrid optimization algorithm based on differential evolution and interior point method is used to obtain the equilibrium solution of the SFE game. Finally, simulation studies verify the effectiveness of proposed interactive energy management method. [ABSTRACT FROM AUTHOR]

Owing to environmental concerns, the energy-efficient subway train scheduling problem is necessary in subway operation management. This paper designs an approximate dynamic programming (DP) approach for energy-efficient subway train scheduling problem with time-dependent demand. The train traffic model is proposed with the dynamic equations for the evolution of train headway, train passenger loads, and the energy consumption along the subway line. For the dynamic changing of the onboard passengers with time, the total train energy usage is modeled as the sum of energy consumptions from the traction system and auxiliary facilities. A nonlinear DP problem is formulated to generate a near optimal timetable to realize the tradeoff among the utilization of trains, passenger waiting time, service levels, and energy consumption. To overcome the curse of dimensionality in this optimization problem, we construct an approximate DP framework, where the conceptions of states, policies, state transitions, and reward function are introduced. And this algorithm is able to converge to a good solution with a short time compared to the genetic algorithm and differential evolution algorithm. Finally, the numerical experiments are given to demonstrate the effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a control strategy based on model reduction and online intelligent calculation for a planar ${n}$ -link underactuated manipulator with a passive first joint (PA $^{{n-1}}$ for short) to realize its control objective, which is to move its end-point from an initial position to a target position. First, two active links of the planar PA $^{{n-1}}$ manipulator are chosen to be the active links of a planar virtual passive–active–active (PAA) manipulator, which guarantees that the geometric reachable range of the planar virtual PAA manipulator is the same as that of the planar PA $^{{n-1}}$ manipulator. The planar PA $^{{n-1}}$ manipulator is reduced to the planar virtual PAA manipulator by keeping the states of two active links in their initial values and controlling the states of the remaining ${n-3}$ active links to zero. Then, the planar virtual PAA manipulator is equivalent to two planar virtual Acrobots by adopting two-stage control method. Based on two sets of angle constraint relationships corresponding to two planar virtual Acrobots, an online differential evolution algorithm is employed to obtain all link target angles of the planar virtual PAA manipulator. Next, two Lyapunov functions, each of which is constructed based on the active link angle of one planar virtual Acrobot, are used to design controllers to realize the system control objective. Finally, Simulation results of a planar PAA-active manipulator demonstrate the effectiveness of the proposed control strategy. [ABSTRACT FROM AUTHOR]

In this paper, a new method is proposed for directly evaluating approximate lightning channel-base-current (CBC) parameters ($I_{m}$ , (di/dt)max, tFD, and tSD) and analytical function parameters (AFPs) of the CBC based on the measured lightning magnetic fields using a deconvolution and differential evolution (DE) method. This proposed method comprises two sequential steps. The first step is for determining the lightning CBC based on the measured magnetic field using modified transmission line model with exponential current decaying with height (MTLE) through deconvolution, while the second step is for evaluating the AFPs (Heidler's function) corresponding to the lightning CBC obtained from the first step. Data from the measured magnetic field above ground level (z = 10 m) at different horizontal distances (r = 9 km, 4.6 km, 2 km, and 50 m) from the lightning channel are considered for testing the proposed method. The sum of two Heidler's functions is used to represent the lightning CBC; and its parameters, namely I01, I02, τ11, τ12, τ21, τ22, n1, and n2 are identified using DE as a tool. Further, this methodology is helpful in the evaluation of the CBC parameters and mathematical modeling of the lightning CBC and the estimation of the lightning current through the channel using data from the measured magnetic field for different engineering return stroke models. [ABSTRACT FROM AUTHOR]

This paper designs a double-side linear vernier permanent-magnet motor, which incorporates the merits of high thrust force capability, high power factor, and high efficiency. Since the parameters of the motor are very sensitive and the high thrust force capability comes along with the high force ripple, a framework of multiobjective optimization is proposed to improve the overall motor performances. The sensitivity analysis is used to select significant variables and the multiobjective differential evolution with ranking-based mutation operator is conducted with the response surface models to generate the Pareto solution set. The electromagnetic performances of the optimal motor are compared with the initial motor by simulating step by step based on finite-element analysis. Finally, a prototype motor is manufactured and the experimental results validate the improved motor performances. [ABSTRACT FROM AUTHOR]

In recent years, accelerated destructive degradation testing (ADDT) has been applied to obtain the reliability information of an asset (component) at use conditions when the component is highly reliable. In ADDT, degradation data are measured under stress levels more severe than usual so that more component failures can be observed in a short period. In the literature, most application-specific ADDT models assume a parametric degradation process under different accelerating conditions. Models without strong parametric assumptions are desirable to describe the complex ADDT processes. This paper proposes a general ADDT model that consists of a nonparametric part to describe the degradation path and a parametric part to describe the accelerating-variable effect. The proposed model not only provides more model flexibility with few assumptions, but also retains the physical mechanisms of degradation. Due to the complexity of parameter estimation, an efficient method based on self-adaptive differential evolution is developed to estimate model parameters. A simulation study is implemented to verify the developed methods. Two real-world case studies are conducted, and the results show the superior performance of the developed model compared with the existing methods. [ABSTRACT FROM AUTHOR]

The need for higher efficiency motors is becoming more relevant due to recent policies adopted in most advanced economies, which are adopting new minimum energy performance standards. A great effort to optimize several parts of rotating electric machines is being done to fulfill that requirement. Recent studies focus on stator winding optimization, because of its high loss share. In this paper, a general multilayer winding configuration is proposed for winding design optimization for multiphase symmetrical machines, by combining multilayer integer-slot, fractional-slot, and fractional-slot concentrated windings. The constrained minimization of the airgap magnetomotive force harmonic distortion and winding resistance is solved by the hybridization of differential evolution with a non-dominating sorting algorithm. A framework is provided for replication purposes. An experimental application example of standard and optimized windings is included for performance assessment. The optimized winding leads to a significant motor efficiency gain, while reducing the amount of copper needed for manufacturing. [ABSTRACT FROM AUTHOR]

As the mutation strategy and algorithmic parameters in differential evolution (DE) are sensitive to the problems being solved, a hot research topic is to adaptively control the strategy and parameters according to the requirements of the problem. In the literature, most adaptive DE use either historical experiences of the population or heuristic information of the individuals to promote adaptation. In this paper, we develop a novel variant of adaptive DE, utilizing both the historical experience and heuristic information for the adaptation. In this novel historical and heuristic DE (HHDE), each individual dynamically adjusts its mutation strategy and associated parameters not only by learning from previous successful experience of the whole population, but also according to heuristic information related with its own current state. These help the algorithm select a more suitable mutation strategy and determinate better parameters for each individual in different evolutionary stages. The performance of the proposed HHDE is extensively evaluated on 30 benchmark functions with different dimensions. Experimental results confirm the competitiveness of the proposed algorithm to a number of DE variants. [ABSTRACT FROM AUTHOR]

This paper presents a method to compute the magnetic liquid-free surface shape of a single spike in a quasi-homogeneous magnetic field produced by the Helmholtz coil. In the Rosensweig instability, the magnetic liquid-free surface deforms in a spike-like shape pattern as a magnetic field above some critical value is applied to the liquid. The free surface of the magnetic liquid is described as a polynomial function in cylindrical coordinates with the applied cylindrical symmetry. To obtain the shape deformation, the system of nonlinear magnetically augmented Young-Laplace equations is solved iteratively. The approach to the solution is executed in two steps. In the first step, magnetic field distribution along the surface is computed by the finite-element method. When magnetic field distribution is known, the second step occurs in which the system of Young-Laplace equations, defined as an optimization problem, is solved by differential evolution. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel technique for human motion denoising by jointly optimizing kinematic and anthropometric constraints for a noisy skeleton data. Specifically, we are focused on depth-sensor-based motion capture (D-Mocap) data that are often prone to error, outliers and distortion. To capture human kinematics, we first propose a joint-level Tobit particle filter (TPF) that incorporates a unique observation model to characterize the censored measurement of D-Mocap data. A skeleton-level Differential Evolution (DE) algorithm is then integrated with the sequential Monte Carlo sampling in the TPF, allowing joint-level particles to be re-distributed and re-weighted according to the stability and consistency of skeletal bone lengths as well as the suitability of joint kinematics. This leads to an integrated TPF-DE algorithm that significantly improves the quality of D-Mocap data by making 3D joint trajectories more kinematically admissible and anthropometrically stable. Experimental results on both simulated and real-world D-Mocap show that the errors of joint positions and the bone lengths have been reduced by 30-60%, and the accuracy of joint angles has been improved by 40-60%. The proposed TPF-DE method outperforms the recent filtering-based and deep learning methods and demonstrate the synergy between the TPF and DE algorithms for effective human motion enhancement. [ABSTRACT FROM AUTHOR]

One of the most promising technologies to be employed in beyond 5G networks is based on the concept of cell-free (CF) massive MIMO, in which a predetermined set of access points (APs) jointly cooperate in the data transmission and reception to/from the user equipment (UE). In order to efficiently manage radio resources, the CF central processing unit implement uplink power control policies. These policies aim to optimize a given network utility function. In this paper, we investigate the max-min fairness optimization problem, in which the spectral efficiency performance of the UE with the worst channel conditions is prioritized, taking into account a per-UE power constraint and assuming linear maximum ratio combining at APs. Existing solutions have typically relied on second-order cone programming with convex approximations, which exhibit high computational complexity and scalability issues. Therefore, meta-heuristics (MHs) are explored as alternative optimization schemes, capable of providing (near)-optimal solutions with reasonable computational effort. Three MH approaches with different operation principles are compared. Numerical results show that the differential evolution algorithm exhibits the best trade-off between solution quality and run time, being able to reach (near)-optimal solutions faster than the bisection approach while coping with the scalability issues of the geometric programming-based algorithm. [ABSTRACT FROM AUTHOR]

Scheduling is key towards improving the performance of a Flexible Assembly Line (FAL). In this paper, a Bilevel Differential Evolution (BiDE) algorithm to solve a FAL scheduling problem is proposed. The BiDE algorithm optimizes the performance of the FAL with respect to two criteria: the weighted sum of Earliness/Tardiness (E/T) penalties and the balance of the FAL. The performance of BiDE is evaluated using the data sets available in the literature and an evolutionary heuristic algorithm published earlier called BiGA. The experimental results show that the BiDE algorithm can solve the FAL scheduling problem effectively and exhibits a superior performance over BiGA. [ABSTRACT FROM AUTHOR]

The author discusses the paper "Differential Evolution as Applied to Electromagnetics," by P. Rossa, G. Oliveri and A. Massa. He says the researchers have used his works on differential evolution well in their electromagnetics research, but the paper, as a whole, is misleading because the researchers were not aware of the misconceptions of evolutionary computation. The author points out that the study's use of predetermined threshold and dynamic differential evolution is costly.