Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr...Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.展开更多
To ensure a long-term safety and reliability of electric vehicle and energy storage system,an accurate estimation of the state of health(SOH)for lithium-ion battery is important.In this study,a method for estimating t...To ensure a long-term safety and reliability of electric vehicle and energy storage system,an accurate estimation of the state of health(SOH)for lithium-ion battery is important.In this study,a method for estimating the lithium-ion battery SOH was proposed based on an improved extreme learning machine(ELM).Input weights and hidden layer biases were generated randomly in traditional ELM.To improve the estimation accuracy of ELM,the differential evolution algorithm was used to optimize these parameters in feasible solution spaces.First,incremental capacity curves were obtained by incremental capacity analysis and smoothed by Gaussian filter to extract health interests.Then,the ELM based on differential evolution algorithm(DE-ELM model)was used for a lithium-ion battery SOH estimation.At last,four battery historical aging data sets and one random walk data set were employed to validate the prediction performance of DE-ELM model.Results show that the DE-ELM has a better performance than other studied algorithms in terms of generalization ability.展开更多
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 rehabilitati...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.展开更多
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 ...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.展开更多
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 obj...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.展开更多
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 individua...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.展开更多
The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditiona...The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.展开更多
The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanal...The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.展开更多
Our differential and grading toothed roll crusher blends the advantages of a toothed roll crusher and a jaw crusher and possesses characteristics of great crushing,high breaking efficiency,multi-sieving and has,for th...Our differential and grading toothed roll crusher blends the advantages of a toothed roll crusher and a jaw crusher and possesses characteristics of great crushing,high breaking efficiency,multi-sieving and has,for the moment,made up for the short- comings of the toothed roll crusher.The moving jaw of the crusher is a crank-rocker mechanism.For optimizing the dynamic per- formance and improving the cracking capability of the crusher,a mathematical model was established to optimize the transmission angleγand to minimize the travel characteristic value m of the moving jaw.Genetic algorithm is used to optimize the crusher crank-rocker mechanism for multi-object design and an optimum result is obtained.According to the implementation,it is shown that the performance of the crusher and the cracking capability of the moving jaw have been improved.展开更多
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 neut...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.展开更多
Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the r...Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the restored loads, switch frequency and generator efficiency are taken into account. In this model, analytic hierarchy process(AHP) is proposed to determine the coefficients of these objective functions. Meanwhile, a quantum differential evolution algorithm with triple quantum bit code is proposed. This algorithm aiming at the characteristics of shipboard power system is different from the normal quantum bit representation. The individual polymorphic expression is realized, and the convergence performance can be further enhanced in combination with the global parallel search capacity of differential evolution algorithm and the superposition properties of quantum theory. The local optimum can be avoided by dynamic rotation gate. The validity of algorithm and model is verified by the simulation examples.展开更多
The differential evolution （DE） algorithm has been received increasing attention in terms of optimizing the design for the water distribution systems （WDSs）. This paper aims to carry out a comprehensive performari...The differential evolution （DE） algorithm has been received increasing attention in terms of optimizing the design for the water distribution systems （WDSs）. This paper aims to carry out a comprehensive performarice comparison between the new emerged DE algorithm and the most popular algorithm-the genetic algorithm （GA）. A total of six benchmark WDS case studies were used with the number of decision variables ranging from 8 to 454. A preliminary sensitivity analysis was performed to select the most effective parameter values for both algorithms to enable the fair comparison. It is observed from the results that the DE algorithm consistently outperforms the GA in terms of both efficiency and the solution quality for each case study. Additionally, the DE algorithm was also compared with the previously published optimization algorithms based on the results for those six case studies, indicating that the DE exhibits comparable performance with other algorithms. It can be concluded that the DE is a newly promising optimization algorithm in the design of WDSs.展开更多
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 wi...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.展开更多
In order to overcome the limitations of a unitary reference station in mobile communication positioning network differential barometric altimetry(DBA)and broaden the action scope of the reference station and improve p...In order to overcome the limitations of a unitary reference station in mobile communication positioning network differential barometric altimetry(DBA)and broaden the action scope of the reference station and improve positioning accuracy of elevation,an integrated interpolation algorithm model based on generalized extended approximation(GEA)algorithm and Kriging interpolation in time-space domain of reference station is proposed.In the time domain,barometric measured data is considered the maximum value estimated by bilateral extension to avoid wrong direction of estimation,which is approaching true value.In the spatial domain,barometric relevance among multiple reference stations is utilized,the weighted coefficients of multiple reference stations is calculated by the integrated algorithm model based on the GEA algorithm and Kriging interpolation.The impact of each reference station to the measured station is quantified,so that a virtual reference station is constructed,which can overcome the limitation of barometric correction by a unitary reference station.In addition,the measurement error due to irregular change in atmospheric pressure will be eliminated.展开更多
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 w...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.展开更多
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 ...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.展开更多
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...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.展开更多
In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can a...In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.展开更多
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 re...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.展开更多
In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced...In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced local Navier-Stokes equations. Reduced differential transform method and perturbation-iteration algorithm are applied to solve this problem. The convergence analysis was discussed for both methods. The numerical results of both methods are given at some Reynolds numbers and low Mach numbers, and compared with results of earlier studies in the review of the literatures. These two methods are easy and fast to implement, and the results are close to each other and other numerical results, so it can be said that these methods are useful in finding approximate analytical solutions to the unsteady incompressible flow problems at low Mach numbers.展开更多
基金supported by the National Natural Science Foundation of China(NSFC)under Grant(No.51677058).
文摘Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.
文摘To ensure a long-term safety and reliability of electric vehicle and energy storage system,an accurate estimation of the state of health(SOH)for lithium-ion battery is important.In this study,a method for estimating the lithium-ion battery SOH was proposed based on an improved extreme learning machine(ELM).Input weights and hidden layer biases were generated randomly in traditional ELM.To improve the estimation accuracy of ELM,the differential evolution algorithm was used to optimize these parameters in feasible solution spaces.First,incremental capacity curves were obtained by incremental capacity analysis and smoothed by Gaussian filter to extract health interests.Then,the ELM based on differential evolution algorithm(DE-ELM model)was used for a lithium-ion battery SOH estimation.At last,four battery historical aging data sets and one random walk data set were employed to validate the prediction performance of DE-ELM model.Results show that the DE-ELM has a better performance than other studied algorithms in terms of generalization ability.
基金Supported by National Natural Science Foundation of China(Grant No.51175029)Beijing Municipal Natural Science Foundation of China(Grant No.3132019)
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China(6083500460775047+4 种基金60974048)the National High Technology Research and Development Program of China(863 Program)(2007AA0422442008AA04Z214)the Natural Science Foundation of Hunan Province(09JJ9012)Scientific Research Fund of Hunan Provincial Education Department(08C337)
文摘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.
基金Project(2013CB733600) supported by the National Basic Research Program of ChinaProject(21176073) supported by the National Natural Science Foundation of China+2 种基金Project(20090074110005) supported by Doctoral Fund of Ministry of Education of ChinaProject(NCET-09-0346) supported by Program for New Century Excellent Talents in University of ChinaProject(09SG29) supported by "Shu Guang", China
文摘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.
基金Supported by the National Natural Science Foundation of China(61070008)the Humanities and Social Science Youth Fund of the Ministry of Education(11YJC870012)+2 种基金the Youth Fund of Jiangxi Province Department of Education(GJJ11106)the Natural Science Foundation of Colleges and Universities of Anhui Province Department of Education(KJ2010B096)the Industrial Research Projects of Nanchang Scienceand Technology Bureau,Jiangxi(07110076)
文摘The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.
基金Supported by the National Natural Science Foundation of China (60573032, 90604036)Participation in Research Project of Shanghai Jiao Tong University
文摘The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.
基金Project 50574091 supported by the National Natural Science Foundation of China
文摘Our differential and grading toothed roll crusher blends the advantages of a toothed roll crusher and a jaw crusher and possesses characteristics of great crushing,high breaking efficiency,multi-sieving and has,for the moment,made up for the short- comings of the toothed roll crusher.The moving jaw of the crusher is a crank-rocker mechanism.For optimizing the dynamic per- formance and improving the cracking capability of the crusher,a mathematical model was established to optimize the transmission angleγand to minimize the travel characteristic value m of the moving jaw.Genetic algorithm is used to optimize the crusher crank-rocker mechanism for multi-object design and an optimum result is obtained.According to the implementation,it is shown that the performance of the crusher and the cracking capability of the moving jaw have been improved.
基金supported by the National Key R&D Program of the MOST of China(No.2016YFA0300204)the National Natural Science Foundation of China(Nos.11227902)as part of the Si PáME2beamline project+1 种基金supported by the National Natural Science Foundation of China(No.41774120)the Sichuan Science and Technology Program(No.2021YJ0329)。
文摘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.
基金the National Natural Science Foundation of China(No.51175321)the Innovation Program of Shanghai Municipal Education Commission(No.12ZZ158)
文摘Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the restored loads, switch frequency and generator efficiency are taken into account. In this model, analytic hierarchy process(AHP) is proposed to determine the coefficients of these objective functions. Meanwhile, a quantum differential evolution algorithm with triple quantum bit code is proposed. This algorithm aiming at the characteristics of shipboard power system is different from the normal quantum bit representation. The individual polymorphic expression is realized, and the convergence performance can be further enhanced in combination with the global parallel search capacity of differential evolution algorithm and the superposition properties of quantum theory. The local optimum can be avoided by dynamic rotation gate. The validity of algorithm and model is verified by the simulation examples.
基金Project (No. 2008AA06A413) supported by the National High-Tech R&D (863) Program of China
文摘The differential evolution （DE） algorithm has been received increasing attention in terms of optimizing the design for the water distribution systems （WDSs）. This paper aims to carry out a comprehensive performarice comparison between the new emerged DE algorithm and the most popular algorithm-the genetic algorithm （GA）. A total of six benchmark WDS case studies were used with the number of decision variables ranging from 8 to 454. A preliminary sensitivity analysis was performed to select the most effective parameter values for both algorithms to enable the fair comparison. It is observed from the results that the DE algorithm consistently outperforms the GA in terms of both efficiency and the solution quality for each case study. Additionally, the DE algorithm was also compared with the previously published optimization algorithms based on the results for those six case studies, indicating that the DE exhibits comparable performance with other algorithms. It can be concluded that the DE is a newly promising optimization algorithm in the design of WDSs.
基金provided by grants from the National Basic Research Program of China (Grant No. 2006CB400503)LASG Free Exploration Fund+1 种基金LASG State Key Laboratory Special Fundthe KZCX3-SW-230 of the Chinese Academy of Sciences
文摘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.
基金Supported by the National Key Research Program of China"Collaborative Precision Positioning Project"(2016YFB 0501900)the National Natural Science Foundation of China(11603041)+1 种基金Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education(Guilin University of Electronic Technology)Guangxi Key Laboratory of Precision Navigation Technology and Application
文摘In order to overcome the limitations of a unitary reference station in mobile communication positioning network differential barometric altimetry(DBA)and broaden the action scope of the reference station and improve positioning accuracy of elevation,an integrated interpolation algorithm model based on generalized extended approximation(GEA)algorithm and Kriging interpolation in time-space domain of reference station is proposed.In the time domain,barometric measured data is considered the maximum value estimated by bilateral extension to avoid wrong direction of estimation,which is approaching true value.In the spatial domain,barometric relevance among multiple reference stations is utilized,the weighted coefficients of multiple reference stations is calculated by the integrated algorithm model based on the GEA algorithm and Kriging interpolation.The impact of each reference station to the measured station is quantified,so that a virtual reference station is constructed,which can overcome the limitation of barometric correction by a unitary reference station.In addition,the measurement error due to irregular change in atmospheric pressure will be eliminated.
基金Supported by the Major State Basic Research Development Program of China(2012CB720500)the National Natural Science Foundation of China(Key Program:U1162202)+2 种基金the National Science Fund for Outstanding Young Scholars(61222303)the National Natural Science Foundation of China(61174118,21206037)Shanghai Leading Academic Discipline Project(B504)
文摘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.
基金in part supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB1141,2023BAB094)the Key Project of Science and Technology Research ProgramofHubei Educational Committee(No.D20211402)+1 种基金the Teaching Research Project of Hubei University of Technology(No.XIAO2018001)the Project of Xiangyang Industrial Research Institute of Hubei University of Technology(No.XYYJ2022C04).
文摘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.
基金supported by the National Natural Science Foundation of China (70871081)the Shanghai Leading Academic Discipline Project of China (S1205YLXK)
文摘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.
文摘In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.
文摘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.
文摘In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced local Navier-Stokes equations. Reduced differential transform method and perturbation-iteration algorithm are applied to solve this problem. The convergence analysis was discussed for both methods. The numerical results of both methods are given at some Reynolds numbers and low Mach numbers, and compared with results of earlier studies in the review of the literatures. These two methods are easy and fast to implement, and the results are close to each other and other numerical results, so it can be said that these methods are useful in finding approximate analytical solutions to the unsteady incompressible flow problems at low Mach numbers.
