Strengthened Dominance Relation NSGA-Ⅲ Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.

Novel Adaptive Memory Event-Triggered-Based Fuzzy Robust Control for Nonlinear Networked Systems via the Differential Evolution Algorithm

This article mainly investigates the fuzzy optimization robust control issue for nonlinear networked systems characterized by the interval type-2(IT2)fuzzy technique under a differential evolution algorithm.To provide a more reasonable utilization of the constrained communication channel,a novel adaptive memory event-triggered(AMET)mechanism is developed,where two event-triggered thresholds can be dynamically adjusted in the light of the current system information and the transmitted historical data.Sufficient conditions with less conservative design of the fuzzy imperfect premise matching(IPM)controller are presented by introducing the Wirtinger-based integral inequality,the information of membership functions(MFs)and slack matrices.Subsequently,under the IPM policy,a new MFs intelligent optimization technique that takes advantage of the differential evolution algorithm is first provided for IT2 TakagiSugeno(T-S)fuzzy systems to update the fuzzy controller MFs in real-time and achieve a better system control effect.Finally,simulation results demonstrate that the proposed control scheme can obtain better system performance in the case of using fewer communication resources.

Furnace Temperature Curve Optimization Model Based on Differential Evolution Algorithm

When soldering electronic components onto circuit boards,the temperature curves of the reflow ovens across different zones and the conveyor belt speed significantly influence the product quality.This study focuses on optimizing the furnace temperature curve under varying settings of reflow oven zone temperatures and conveyor belt speeds.To address this,the research sequentially develops a heat transfer model for reflow soldering,an optimization model for reflow furnace conditions using the differential evolution algorithm,and an evaluation and decision model combining the differential evolution algorithm with the Technique for Order Preference by Similarity to Ideal Solution(TOPSIS)method.This approach aims to determine the optimal furnace temperature curve,zone temperatures of the reflow oven,and the conveyor belt speed.

Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.

Optimization of Electrocardiogram Classification Using Dipper Throated Algorithm and Differential Evolution

Electrocardiogram(ECG)signal is a measure of the heart’s electrical activity.Recently,ECG detection and classification have benefited from the use of computer-aided systems by cardiologists.The goal of this paper is to improve the accuracy of ECG classification by combining the Dipper Throated Optimization(DTO)and Differential Evolution Algorithm(DEA)into a unified algorithm to optimize the hyperparameters of neural network(NN)for boosting the ECG classification accuracy.In addition,we proposed a new feature selection method for selecting the significant feature that can improve the overall performance.To prove the superiority of the proposed approach,several experimentswere conducted to compare the results achieved by the proposed approach and other competing approaches.Moreover,statistical analysis is performed to study the significance and stability of the proposed approach using Wilcoxon and ANOVA tests.Experimental results confirmed the superiority and effectiveness of the proposed approach.The classification accuracy achieved by the proposed approach is(99.98%).

Okumura Hata Propagation Model Optimization in 400 MHz Band Based on Differential Evolution Algorithm: Application to the City of Bertoua

Propagation models are the foundation for radio planning in mobile networks. They are widely used during feasibility studies and initial network deployment, or during network extensions, particularly in new cities. They can be used to calculate the power of the signal received by a mobile terminal, evaluate the coverage radius, and calculate the number of cells required to cover a given area. This paper takes into account the standard k factors model and then uses the differential evolution algorithm to set up a propagation model adapted to the physical environment of the Cameroonian cities of Bertoua. Drive tests were made on the LTE TDD network in the city of Bertoua. Differential evolution algorithm is used as the optimization algorithm to deduct a propagation model which fits the environment of the considered town. The calculation of the root mean square error between the actual data from the drive tests and the prediction data from the implemented model allows the validation of the obtained results. A comparative study made between the RMSE value obtained by the new model and those obtained by the Okumura Hata and free space models, allowed us to conclude that the new model obtained is better and more representative of our local environment than the Okumura Hata currently used. The implementation shows that Differential evolution can perform well and solve this kind of optimization problem;the newly obtained models can be used for radio planning in the city of Bertoua in Cameroon.

Improved Adaptive Differential Evolution Algorithm for the Un-Capacitated Facility Location Problem

The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the specific characteristics of the UFL problem, we introduce the activation function to the algorithm for solving UFL problem and name it improved adaptive differential evolution algorithm (IADEA). Next, to improve the efficiency of the algorithm and to alleviate the problem of being stuck in a local optimum, an adaptive operator was added. To test the improvement of our algorithm, we compare the IADEA with the basic differential evolution algorithm by solving typical instances of UFL problem respectively. Moreover, to compare with other heuristic algorithm, we use the hybrid ant colony algorithm to solve the same instances. The computational results show that IADEA improves the performance of the basic DE and it outperforms the hybrid ant colony algorithm.

Machine Learning-Assisted Low-Dimensional Electrocatalysts Design for Hydrogen Evolution Reaction

Efficient electrocatalysts are crucial for hydrogen generation from electrolyzing water.Nevertheless,the conventional"trial and error"method for producing advanced electrocatalysts is not only cost-ineffective but also time-consuming and labor-intensive.Fortunately,the advancement of machine learning brings new opportunities for electrocatalysts discovery and design.By analyzing experimental and theoretical data,machine learning can effectively predict their hydrogen evolution reaction(HER)performance.This review summarizes recent developments in machine learning for low-dimensional electrocatalysts,including zero-dimension nanoparticles and nanoclusters,one-dimensional nanotubes and nanowires,two-dimensional nanosheets,as well as other electrocatalysts.In particular,the effects of descriptors and algorithms on screening low-dimensional electrocatalysts and investigating their HER performance are highlighted.Finally,the future directions and perspectives for machine learning in electrocatalysis are discussed,emphasizing the potential for machine learning to accelerate electrocatalyst discovery,optimize their performance,and provide new insights into electrocatalytic mechanisms.Overall,this work offers an in-depth understanding of the current state of machine learning in electrocatalysis and its potential for future research.

Multiple Elite Individual Guided Piecewise Search-Based Differential Evolution

The differential evolution(DE)algorithm relies mainly on mutation strategy and control parameters'selection.To take full advantage of top elite individuals in terms of fitness and success rates,a new mutation operator is proposed.The control parameters such as scale factor and crossover rate are tuned based on their success rates recorded over past evolutionary stages.The proposed DE variant,MIDE,performs the evolution in a piecewise manner,i.e.,after every predefined evolutionary stages,MIDE adjusts its settings to enrich its diversity skills.The performance of the MIDE is validated on two different sets of benchmarks:CEC 2014 and CEC 2017(special sessions&competitions on real-parameter single objective optimization)using different performance measures.In the end,MIDE is also applied to solve constrained engineering problems.The efficiency and effectiveness of the MIDE are further confirmed by a set of experiments.

Multi-objective Optimization of a Parallel Ankle Rehabilitation Robot Using Modified Differential Evolution Algorithm

Dimensional synthesis is one of the most difficult issues in the field of parallel robots with actuation redundancy. To deal with the optimal design of a redundantly actuated parallel robot used for ankle rehabilitation, a methodology of dimensional synthesis based on multi-objective optimization is presented. First, the dimensional synthesis of the redundant parallel robot is formulated as a nonlinear constrained multi-objective optimization problem. Then four objective functions, separately reflecting occupied space, input/output transmission and torque performances, and multi-criteria constraints, such as dimension, interference and kinematics, are defined. In consideration of the passive exercise of plantar/dorsiflexion requiring large output moment, a torque index is proposed. To cope with the actuation redundancy of the parallel robot, a new output transmission index is defined as well. The multi-objective optimization problem is solved by using a modified Differential Evolution（DE） algorithm, which is characterized by new selection and mutation strategies. Meanwhile, a special penalty method is presented to tackle the multi-criteria constraints. Finally, numerical experiments for different optimization algorithms are implemented. The computation results show that the proposed indices of output transmission and torque, and constraint handling are effective for the redundant parallel robot; the modified DE algorithm is superior to the other tested algorithms, in terms of the ability of global search and the number of non-dominated solutions. The proposed methodology of multi-objective optimization can be also applied to the dimensional synthesis of other redundantly actuated parallel robots only with rotational movements.

Efficient AUV Path Planning in Time-Variant Underwater Environment Using Differential Evolution Algorithm

Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm is employed. The performance of the DE-based planner in generating time-efficient paths to direct the AUV from its initial conditions to the target of interest is investigated within a complexed 3D underwater environment incorporated with turbulent current vector fields, coastal area,islands, and static/dynamic obstacles. The results of simulations indicate the inherent efficiency of the DE-based path planner as it is capable of extracting feasible areas of a real map to determine the allowed spaces for the vehicle deployment while coping undesired current disturbances, exploiting desirable currents, and avoiding collision boundaries in directing the vehicle to its destination. The results are implementable for a realistic scenario and on-board real AUV as the DE planner satisfies all vehicular and environmental constraints while minimizing the travel time/distance, in a computationally efficient manner.

Improved differential evolution algorithm for resource-constrained project scheduling problem

An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.

Chemical process dynamic optimization based on hybrid differential evolution algorithm integrated with Alopex

To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.

Unfolding neutron spectra from water-pumping-injection multilayered concentric sphere neutron spectrometer using self-adaptive differential evolution algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.

A Preliminary Application of the Differential Evolution Algorithm to Calculate the CNOP

A projected skill is adopted by use of the differential evolution (DE) algorithm to calculate a conditional nonlinear optimal perturbation (CNOP). The CNOP is the maximal value of a constrained optimization problem with a constraint condition, such as a ball constraint. The success of the DE algorithm lies in its ability to handle a non-differentiable and nonlinear cost function. In this study, the DE algorithm and the traditional optimization algorithms used to obtain the CNOPs are compared by analyzing a theoretical grassland ecosystem model and a dynamic global vegetation model. This study shows that the CNOPs generated by the DE algorithm are similar to those by the sequential quadratic programming (SQP) algorithm and the spectral projected gradients (SPG2) algorithm. If the cost function is non-differentiable, the CNOPs could also be caught with the DE algorithm. The numerical results suggest the DE algorithm can be employed to calculate the CNOP, especially when the cost function is non-differentiable.

Vector Dominating Multi-objective Evolution Algorithm for Aerodynamic-Structure Integrative Design of Wind Turbine Blade

A novel multi-objective optimization algorithm incorporating vector method and evolution strategies,referred as vector dominant multi-objective evolutionary algorithm(VD-MOEA),is developed and applied to the aerodynamic-structural integrative design of wind turbine blades.A set of virtual vectors are elaborately constructed,guiding population to fast move forward to the Pareto optimal front and dominating the distribution uniformity with high efficiency.In comparison to conventional evolution algorithms,VD-MOEA displays dramatic improvement of algorithm performance in both convergence and diversity preservation when handling complex problems of multi-variables,multi-objectives and multi-constraints.As an example,a 1.5 MW wind turbine blade is subsequently designed taking the maximum annual energy production,the minimum blade mass,and the minimum blade root thrust as the optimization objectives.The results show that the Pareto optimal set can be obtained in one single simulation run and that the obtained solutions in the optimal set are distributed quite uniformly,maximally maintaining the population diversity.The efficiency of VD-MOEA has been elevated by two orders of magnitude compared with the classical NSGA-II.This provides a reliable high-performance optimization approach for the aerodynamic-structural integrative design of wind turbine blade.

Novel Control Vector Parameterization Method with Differential Evolution Algorithm and Its Application in Dynamic Optimization of Chemical Processes

Two general approaches are adopted in solving dynamic optimization problems in chemical processes, namely, the analytical and numerical methods. The numerical method, which is based on heuristic algorithms, has been widely used. An approach that combines differential evolution （DE） algorithm and control vector parameteri- zation （CVP） is proposed in this paper. In the proposed CVP, control variables are approximated with polynomials based on state variables and time in the entire time interval. Region reduction strategy is used in DE to reduce the width of the search region, which improves the computing efficiency. The results of the case studies demonstrate the feasibility and efficiency of the oroposed methods.

Improved gravitational search algorithm based on free search differential evolution

This paper presents an improved gravitational search algorithm （IGSA） as a hybridization of a relatively recent evolutionary algorithm called gravitational search algorithm （GSA）, with the free search differential evolution （FSDE）. This combination incorporates FSDE into the optimization process of GSA with an attempt to avoid the premature convergence in GSA. This strategy makes full use of the exploration ability of GSA and the exploitation ability of FSDE. IGSA is tested on a suite of benchmark functions. The experimental results demonstrate the good performance of IGSA.

An Adaptive Differential Evolution Algorithm to Solve Constrained Optimization Problems in Engineering Design

Differential evolution (DE) algorithm has been shown to be a simple and efficient evolutionary algorithm for global optimization over continuous spaces, and has been widely used in both benchmark test functions and real-world applications. This paper introduces a novel mutation operator, without using the scaling factor F, a conventional control parameter, and this mutation can generate multiple trial vectors by incorporating different weighted values at each generation, which can make the best of the selected multiple parents to improve the probability of generating a better offspring. In addition, in order to enhance the capacity of adaptation, a new and adaptive control parameter, i.e. the crossover rate CR, is presented and when one variable is beyond its boundary, a repair rule is also applied in this paper. The proposed algorithm ADE is validated on several constrained engineering design optimization problems reported in the specialized literature. Compared with respect to algorithms representative of the state-of-the-art in the area, the experimental results show that ADE can obtain good solutions on a test set of constrained optimization problems in engineering design.

Evolutionary Algorithm for Extractive Text Summarization

Text summarization is the process of automatically creating a compressed version of a given document preserving its information content. There are two types of summarization: extractive and abstractive. Extractive summarization methods simplify the problem of summarization into the problem of selecting a representative subset of the sentences in the original documents. Abstractive summarization may compose novel sentences, unseen in the original sources. In our study we focus on sentence based extractive document summarization. The extractive summarization systems are typically based on techniques for sentence extraction and aim to cover the set of sentences that are most important for the overall understanding of a given document. In this paper, we propose unsupervised document summarization method that creates the summary by clustering and extracting sentences from the original document. For this purpose new criterion functions for sentence clustering have been proposed. Similarity measures play an increasingly important role in document clustering. Here we’ve also developed a discrete differential evolution algorithm to optimize the criterion functions. The experimental results show that our suggested approach can improve the performance compared to sate-of-the-art summarization approaches.