The selection of the mutation strategy for differential evolution (DE) algorithm plays an important role in the optimization performance, such as exploration ability, convergence accuracy and convergence speed. To improve these performances, an improved differential evolution algorithm with neighborhood mutation operators and opposition-based learning, namely NBOLDE, is developed in this paper. In the proposed NBOLDE, the new evaluation parameters and weight factors are introduced into the neighborhood model to propose a new neighborhood strategy. On this basis, a new neighborhood mutation strategy based on DE/current-to-best/1, namely DE/neighbor-to-neighbor/1, is designed in order to replace large-scale global mutation by local neighborhood mutation with high search efficiency. Then, a generalized opposition-based learning is employed to optimize the initial population and select the better solution between the current solution and reverse solution in order to approximate global optimal solution, which can amend the convergence direction, accelerate convergence, improve efficiency, enhance the stability and avoid premature convergence. Finally, the proposed NBOLDE is compared with four state-of-the-art DE variants by 12 benchmark functions with low-dimension and high-dimension. The experiment results indicate that the proposed NBOLDE has a faster convergence speed, higher convergence accuracy, and better optimization capabilities in solving high-dimensional complex functions.

An improved differential evolution algorithm and its application in optimization problem

In order to overcome the low solution efficiency, insufficient diversity in the later search stage, slow convergence speed and a high search stagnation possibility of differential evolution(DE) algorithm, the quantum computing characteristics of quantum evolutionary algorithm(QEA) and the divide-and-conquer idea of cooperative coevolution evolutionary algorithm(CCEA) are combined to propose an improved differential evolution(HMCFQDE) in this paper. In the proposed HMCFQDE, a new hybrid mutation strategy based on the advantages of local neighborhood mutation and SaNSDE is designed. In the early stage of the search, the local neighborhood mutation strategy with high search efficiency is used to speed up the algorithm convergence. In the later stage of the search, the SaNSDE algorithm is used to adjust the search direction in order to avoid the search stagnation. The QEA is combined with the DE to make use of the quantum chromosome encoding to enhance the population diversity, the quantum rotation to speed up the convergence speed. The CC framework is used to divide the large-scale and high-dimensional complex optimization problem into several low-dimensional optimization sub-problems, and these sub-populations are solved by independent searching among sub-populations in order to improve the solution efficiency. By comparing with other 6 algorithms in solving 6 test functions from CEC’08 under the dimensions of 100, 500 and 1000, it is proved that the proposed HMCFQDE has higher convergence accuracy and stronger stability. In particular, it has a strong ability to optimize high-dimensional complex functions. Therefore, it provides a new method for solving large-scale optimization problem.

Quantum differential evolution with cooperative coevolution framework and hybrid mutation strategy for large scale optimization

An improved grasshopper optimization algorithm (GOA) is proposed in this paper, termed as SGOA, which combines simulated annealing (SA) mechanism with the original GOA that is a natural optimizer widely used in finance, medical and other fields, and receives more promising results based on grasshopper behavior. To compare performance of the SGOA and other algorithms, an investigation to select CEC2017 benchmark function as the test set was carried out. Also, the Friedman assessment was performed to check the significance of the proposed method against other counterparts. In comparison with ten meta-heuristic algorithms such as differential evolution (DE), the proposed SGOA can rank first in the CEC2017, and also ranks first in comparison with ten advanced algorithms. The simulation results reveal that the SA strategy notably improves the exploration and exploitation capacity of GOA. Moreover, the SGOA is also applied to engineering problems and parameter optimization of the kernel extreme learning machine (KELM). After optimizing the parameters of KELM using SGOA, the model was applied to two datasets, Cleveland Heart Dataset and Japanese Bankruptcy Dataset, and they achieved an accuracy of 79.2% and 83.5%, respectively, which were better than the KELM model obtained other algorithms. In these practical applications, it is indicated that the proposed SGOA can provide effective assistance in settling complex optimization problems with impressive results.

SGOA: annealing-behaved grasshopper optimizer for global tasks

In order to improve the diagnosis accuracy and solve the weak fault signal of rolling element of rolling bearings due to long transmission path, a novel fault diagnosis method based on variational mode decomposition (VMD) and maximum correlation kurtosis deconvolution (MCKD), namely VMD-MCKD-FD is proposed for rolling elements of rolling bearings in this paper. In the proposed VMD-MCKD-FD, the vibration signal of rolling element of rolling bearings is decomposed into a series of Intrinsic Mode Functions (IMFs) by using VMD method. Then the number of modes with outstanding fault information is determined by Kurtosis criterion in order to calculate the deconvolution period T. The periodic fault component of reconstructed signal is enhanced by using sensitivity MCKD method. Finally, the power spectrum of the reconstructed signal is analyzed in detail in order to obtain the fault frequency and diagnose the rolling element fault of rolling bearings. The simulation signal and actual vibration signal are selected to verify the effectiveness of the VMD-MCKD-FD method. The experimental results show that the VMD-MCKD-FD method can effectively diagnose the rolling element fault of rolling bearings and obtain better fault accuracy.

Rolling Element Fault Diagnosis Based on VMD and Sensitivity MCKD

To improve the accuracy and generalization ability of hyperspectral image classification, a feature extraction method integrating principal component analysis (PCA) and local binary pattern (LBP) is developed for hyperspectral images in this article. The PCA is employed to reduce the dimension of the spectral features of hyperspectral images. The LBP with low computational complexity is used to extract the local spatial texture features of hyperspectral images to construct multifeature vectors. Then, the gray wolf optimization algorithm with global search capability is employed to optimize the parameters of kernel extreme learning machine (KELM) to construct an optimized KELM model, which is used to effectively realize a hyperspectral image classification (PLG-KELM) method. Finally, the Indian pines dataset, Houston dataset, and Pavia University dataset and an application of WHU-Hi-LongKou dataset are selected to verify the effectiveness of the PLG-KELM. The comparison experiment results show that the PLG-KELM can obtain higher classification accuracy, and takes on better generalization ability for small samples. It provides a new idea for processing hyperspectral images.

/pdf/a-hyperspectral-image-classification-method-using-25qvixokix.pdf

A Hyperspectral Image Classification Method Using Multifeature Vectors and Optimized KELM

MPPCEDE: Multi-population parallel co-evolutionary differential evolution for parameter optimization

• A cooperative co-evolutionary DE with dynamic hybrid mechanism (QGDECC) is proposed. • A quantum variable decomposition strategy is designed by utilizing qubit string. • The increment mutation method is proposed by using the searched evolution information. • A railway train delay scheduling method based on QGDECC is proposed. In order to effectively schedule railway train delay, an adaptive cooperative co-evolutionary differential evolution with dynamic hybrid mechanism of the quantum evolutionary algorithm and genetic algorithm, named QGDECC is designed in this paper. In the QGDECC, the quantum variable decomposition strategy is designed by utilizing qubit string to decompose variables adaptively according to the coevolution performance. Then the increment mutation method is proposed to improve the convergence speed which make full use of searched evolution information. Besides, the parameter adaptive strategy is deeply explored for strengthening the robust of the algorithm. The QGDECC with global search capability is employed to realize a railway train delay scheduling method for effectively eliminating the impact of train delay. Finally, several benchmark functions and actual train operation data are selected to verify the optimization performance of QGDECC. The experimental results show that QGDECC has higher adaptability, faster convergence speed and accuracy. The train delay scheduling method can effectively eliminate the impact of delay on the railway network, and minimize the gap between the rescheduled train schedule and the original train schedule. 

Dynamic hybrid mechanism-based differential evolution algorithm and its application

To address the poor searchability, population diversity, and slow convergence speed of the differential evolution (DE) algorithm in solving capacitated vehicle routing problems (CVRP), a new multistrategy-based differential evolution algorithm with the saving mileage algorithm, sequential encoding, and gravitational search algorithm, namely SEGDE, is proposed to solve CVRP in this paper. Firstly, an optimization model of CVRP with the shortest total vehicle routing is established. Then, the saving mileage algorithm is employed to initialize the population of the DE to improve the initial solution quality and the search efficiency. The sequential encoding approach is used to adjust the differential mutation strategy to legalize the current solution and ensure its effectiveness. Finally, the gravitational search algorithm is applied to calculate the gravitational relationship between points to effectively adjust the evolutionary search direction and further improve the search efficiency. Four CVRPs are selected to verify the effectiveness of the proposed SEGDE algorithm. The experimental results show that the proposed SEGDE algorithm can effectively solve the CVRPs and obtain the ideal vehicle routing. It adopts better search speed, global optimization ability, routing length, and stability.

https://www.mdpi.com/2079-9292/11/21/3476/pdf?version=1667875784

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

With the rapid development of ESG investment, more and more world-renowned institutions have started to establish ESG rating systems to measure the sustainable development of listed enterprises, but due to the late start of ESG in China, and the current domestic research on ESG, rating scores is limited to the impact of ESG rating scores on corporate financial risks, corporate financing constraints and the reasonableness of ESG rating systems. Therefore, this study establishes a localized ESG rating system in China based on China's policies and national conditions, which helps China's ESG development to advance rapidly and also provides an effective reference solution for the Chinese government to monitor the sustainable development behavior and development of listed enterprises.

Yuangang Li

Papers

MPPCEDE: Multi-population parallel co-evolutionary differential evolution for parameter optimization

Dynamic hybrid mechanism-based differential evolution algorithm and its application

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Research on the localized ESG rating system based on China's national policy construction