Deep Structure Optimization for Incremental Hierarchical Fuzzy Systems Using Improved Differential Evolution Algorithm

The optimization of the rule base of a fuzzy logic system (FLS) based on evolutionary algorithm has achievednotable results. However, due to the diversity of the deep structure in the hierarchical fuzzy system (HFS) and thecorrelation of each sub fuzzy system, the uncertainty of the HFS’s deep structure increases. For the HFS, a largenumber of studies mainly use fixed structures, which cannot be selected automatically. To solve this problem, thispaper proposes a novel approach for constructing the incremental HFS. During system design, the deep structureand the rule base of the HFS are encoded separately. Subsequently, the deep structure is adaptively mutated basedon the fitness value, so as to realize the diversity of deep structures while ensuring reasonable competition amongthe structures. Finally, the differential evolution (DE) is used to optimize the deep structure of HFS and theparameters of antecedent and consequent simultaneously. The simulation results confirm the effectiveness of themodel. Specifically, the root mean square errors in the Laser dataset and Friedman dataset are 0.0395 and 0.0725,respectively with rule counts of rules is 8 and 12, respectively.When compared to alternative methods, the resultsindicate that the proposed method offers improvements in accuracy and rule counts.

Operational optimization of copper flotation process based on the weighted Gaussian process regression and index-oriented adaptive differential evolution algorithm

Concentrate copper grade(CCG)is one of the important production indicators of copper flotation processes,and keeping the CCG at the set value is of great significance to the economic benefit of copper flotation industrial processes.This paper addresses the fluctuation problem of CCG through an operational optimization method.Firstly,a density-based affinity propagationalgorithm is proposed so that more ideal working condition categories can be obtained for the complex raw ore properties.Next,a Bayesian network(BN)is applied to explore the relationship between the operational variables and the CCG.Based on the analysis results of BN,a weighted Gaussian process regression model is constructed to predict the CCG that a higher prediction accuracy can be obtained.To ensure the predicted CCG is close to the set value with a smaller magnitude of the operation adjustments and a smaller uncertainty of the prediction results,an index-oriented adaptive differential evolution(IOADE)algorithm is proposed,and the convergence performance of IOADE is superior to the traditional differential evolution and adaptive differential evolution methods.Finally,the effectiveness and feasibility of the proposed methods are verified by the experiments on a copper flotation industrial process.

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.

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.

An Enhanced Adaptive Differential Evolution Approach for Constrained Optimization Problems

Effective constrained optimization algorithms have been proposed for engineering problems recently.It is common to consider constraint violation and optimization algorithm as two separate parts.In this study,a pbest selection mechanism is proposed to integrate the current mutation strategy in constrained optimization problems.Based on the improved pbest selection method,an adaptive differential evolution approach is proposed,which helps the population jump out of the infeasible region.If all the individuals are infeasible,the top 5%of infeasible individuals are selected.In addition,a modified truncatedε-level method is proposed to avoid trapping in infeasible regions.The proposed adaptive differential evolution approach with an improvedεconstraint processmechanism(IεJADE)is examined on CEC 2006 and CEC 2010 constrained benchmark function series.Besides,a standard IEEE-30 bus test system is studied on the efficiency of the IεJADE.The numerical analysis verifies the IεJADE algorithm is effective in comparisonwith other effective algorithms.

An Efficient Differential Evolution for Truss Sizing Optimization Using AdaBoost Classifier

Design constraints verification is the most computationally expensive task in evolutionary structural optimization due to a large number of structural analyses thatmust be conducted.Building a surrogatemodel to approximate the behavior of structures instead of the exact structural analyses is a possible solution to tackle this problem.However,most existing surrogate models have been designed based on regression techniques.This paper proposes a novel method,called CaDE,which adopts a machine learning classification technique for enhancing the performance of the Differential Evolution(DE)optimization.The proposed method is separated into two stages.During the first optimization stage,the original DE is implemented as usual,but all individuals produced in this phase are stored as inputs of the training data.Based on design constraints verification,these individuals are labeled as“safe”or“unsafe”and their labels are saved as outputs of the training data.When collecting enough data,an AdaBoost model is trained to evaluate the safety state of structures.This model is then used in the second stage to preliminarily assess new individuals,and unpromising ones are rejected without checking design constraints.This method reduces unnecessary structural analyses,thereby shortens the optimization process.Five benchmark truss sizing optimization problems are solved using the proposed method to demonstrate its effectiveness.The obtained results show that the CaDE finds good optimal designs with less structural analyses in comparison with the original DE and four other DE variants.The reduction rate of five examples ranges from 18 to over 50%.Moreover,the proposed method is applied to a real-size transmission tower design problem to exhibit its applicability in practice.

Modified Differential Evolution Algorithm for Solving Dynamic Optimization with Existence of Infeasible Environments

Dynamic constrained optimization is a challenging research topic in which the objective function and/or constraints change over time.In such problems,it is commonly assumed that all problem instances are feasible.In reality some instances can be infeasible due to various practical issues,such as a sudden change in resource requirements or a big change in the availability of resources.Decision-makers have to determine whether a particular instance is feasible or not,as infeasible instances cannot be solved as there are no solutions to implement.In this case,locating the nearest feasible solution would be valuable information for the decision-makers.In this paper,a differential evolution algorithm is proposed for solving dynamic constrained problems that learns from past environments and transfers important knowledge from them to use in solving the current instance and includes a mechanism for suggesting a good feasible solution when an instance is infeasible.To judge the performance of the proposed algorithm,13 well-known dynamic test problems were solved.The results indicate that the proposed algorithm outperforms existing recent algorithms with a margin of 79.40%over all the environments and it can also find a good,but infeasible solution,when an instance is infeasible.

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%).

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.

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.

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.

A continuous and long-term in-situ stress measuring method based on fiber optic. Part I: Theory of inverse differential strain analysis

A method for in-situ stress measurement via fiber optics was proposed. The method utilizes the relationship between rock mass elastic parameters and in-situ stress. The approach offers the advantage of long-term stress measurements with high spatial resolution and frequency, significantly enhancing the ability to measure in-situ stress. The sensing casing, spirally wrapped with fiber optic, is cemented into the formation to establish a formation sensing nerve. Injecting fluid into the casing generates strain disturbance, establishing the relationship between rock mass properties and treatment pressure.Moreover, an optimization algorithm is established to invert the elastic parameters of formation via fiber optic strains. In the first part of this paper series, we established the theoretical basis for the inverse differential strain analysis method for in-situ stress measurement, which was subsequently verified using an analytical model. This paper is the fundamental basis for the inverse differential strain analysis method.

Process synthesis for the separation of coal-to-ethanol products

The coal-to-ethanol process,as the clean coal utilization,faces challenges from the energy-intensive distillation that separates multi-component effluents for pure ethanol.Referring to at least eight columns,the synthesis of the ethanol distillation system is impracticable for exhaustive comparison and difficult for conventional superstructure-based optimization as rigorous models are used.This work adopts a superstructure-based framework,which combines the strategy that adaptively selects branches of the state-equipment network and the parallel stochastic algorithm for process synthesis.High-performance computing significantly reduces time consumption,and the adaptive strategy substantially lowers the complexity of the superstructure model.Moreover,parallel computing,elite search,population redistribution,and retention strategies for irrelevant parameters are used to improve the optimization efficiency further.The optimization terminates after 3000 generations,providing a flowsheet solution that applies two non-sharp splitting options in its distillation sequence.As a result,the 59-dimension superstructure-based optimization was solved efficiently via a differential evolution algorithm,and a high-quality solution with a 28.34%lower total annual cost than the benchmark was obtained.Meanwhile,the solution of the superstructure-based optimization is comparable to that obtained by optimizing a single specific configuration one by one.It indicates that the superstructure-based optimization that combines the adaptive strategy can be a promising approach to handling the process synthesis of large-scale and complex chemical processes.

Developing kNN forest data imputation for Catalonia

The combined use of LiDAR(Light Detection And Ranging)scanning and field inventories can provide spatially continuous wall-to-wall information on forest characteristics.This information can be used in many ways in forest mapping,scenario analyses,and forest manage-ment planning.This study aimed to find the optimal way to obtain continuous forest data for Catalonia when using kNN imputation(kNN stands for“k nearest neighbors”).In this method,data are imputed to a certain location from k field-measured sample plots,which are the most similar to the location in terms of LiDAR metrics and topographic variables.Weighted multidimensional Euclidean distance was used as the similarity measure.The study tested two different methods to optimize the distance measure.The first method optimized,in the first step,the set of LiDAR and topographic variables used in the measure,as well as the transformations of these variables.The weights of the selected variables were optimized in the second step.The other method optimized the variable set as well as their transformations and weights in one single step.The two-step method that first finds the variables and their transfor-mations and subsequently optimizes their weights resulted in the best imputation results.In the study area,the use of three to five nearest neighbors was recommended.Altitude and latitude turned out to be the most important variables when assessing the similarity of two locations of Catalan forests in the context of kNN data imputation.The optimal distance measure always included both LiDAR metrics and topographic variables.The study showed that the optimal similarity measure may be different for different regions.Therefore,it was suggested that kNN data imputation should always be started with the optimization of the measure that is used to select the k nearest neighbors.

User Purchase Intention Prediction Based on Improved Deep Forest

Widely used deep neural networks currently face limitations in achieving optimal performance for purchase intention prediction due to constraints on data volume and hyperparameter selection.To address this issue,based on the deep forest algorithm and further integrating evolutionary ensemble learning methods,this paper proposes a novel Deep Adaptive Evolutionary Ensemble(DAEE)model.This model introduces model diversity into the cascade layer,allowing it to adaptively adjust its structure to accommodate complex and evolving purchasing behavior patterns.Moreover,this paper optimizes the methods of obtaining feature vectors,enhancement vectors,and prediction results within the deep forest algorithm to enhance the model’s predictive accuracy.Results demonstrate that the improved deep forest model not only possesses higher robustness but also shows an increase of 5.02%in AUC value compared to the baseline model.Furthermore,its training runtime speed is 6 times faster than that of deep models,and compared to other improved models,its accuracy has been enhanced by 0.9%.

Relative orbit determination algorithm of space targets with passive observation

Angles-only relative orbit determination for space non-cooperative targets based on passive sensor is subject to weakly observable problem of the relative state between two spacecraft. Previously, the evidence for angles-only observability was found by using cylindrical dynamics, however, the solution of orbit determination is still not provided. This study develops a relative orbit determination algorithm with the cylindrical dynamics based on differential evolution. Firstly, the relative motion dynamics and line-of-sight measurement model for nearcircular orbit are established in cylindrical coordinate system.Secondly, the observability is qualitatively analyzed by using the dynamics and measurement model where the unobservable geometry is found. Then, the angles-only relative orbit determination problem is modeled into an optimal searching frame and an improved differential evolution algorithm is introduced to solve the problem. Finally, the proposed algorithm is verified and tested by a set of numerical simulations in the context of highEarth and low-Earth cases. The results show that initial relative orbit determination(IROD) solution with an appropriate accuracy in a relative short span is achieved, which can be used to initialize the navigation filter.

Optimization of Gas-Flooding Fracturing Development in Ultra-Low Permeability Reservoirs

Ultra-low permeability reservoirs are characterized by small pore throats and poor physical properties, which areat the root of well-known problems related to injection and production. In this study, a gas injection floodingapproach is analyzed in the framework of numerical simulations. In particular, the sequence and timing of fracturechanneling and the related impact on production are considered for horizontal wells with different fracturemorphologies. Useful data and information are provided about the regulation of gas channeling and possible strategiesto delay gas channeling and optimize the gas injection volume and fracture parameters. It is shown that inorder to mitigate gas channeling and ensure high production, fracture length on the sides can be controlled andlonger fractures can be created in the middle by which full gas flooding is obtained at the fracture location in themiddle of the horizontal well. A Differential Evolution (DE) algorithm is provided by which the gas injectionvolume and the fracture parameters of gas injection flooding can be optimized. It is shown that an improvedoil recovery factor as high as 6% can be obtained.

Bilevel Optimal Infrastructure Planning Method for the Inland Battery Swapping Stations and Battery-Powered Ships

Green shipping and electrification have been the main topics in the shipping industry.In this process,the pure battery-powered ship is developed,which is zero-emission and well-suited for inland shipping.Currently,battery swapping stations and ships are being explored since battery charging ships may not be feasible for inland long-distance trips.However,improper infrastructure planning for battery swapping stations and ships will increase costs and decrease operation efficiency.Therefore,a bilevel optimal infrastructure planning method is proposed in this paper for battery swapping stations and ships.First,the energy consumption model for the battery swapping ship is established considering the influence of the sailing environment.Second,a bilevel optimization model is proposed to minimize the total cost.Specifically,the battery swapping station(BSS)location problem is investigated at the upper level.The optimization of battery size in each battery swapping station and ship and battery swapping scheme are studied at the lower level based on speed and energy optimization.Finally,the bilevel self-adaptive differential evolution algorithm(BlSaDE)is proposed to solve this problem.The simulation results show that total cost could be reduced by 5.9%compared to the original results,and the effectiveness of the proposed method is confirmed.