Search

This paper is concerned with the design of a dual-loop control system for permanent magnet synchronous motor (PMSM). An improved linear extended state observer (LESO) with excellent estimation capability is employed to develop an improved linear active disturbance rejection control (LADRC) suitable for PMSM speed regulation, achieving outstanding disturbance suppression in PMSM speed control. The use of an internal model control scheme to initialize the parameters of the proportional-integral- (PI-) based current controller simplifies the search space of the control system parameter optimization. An improved particle swarm optimization (PSO) algorithm is applied to optimize the controller parameters, thereby enhancing the overall system performance. Finally, through a series of simulations and experiments, we validate that our proposed controller exhibits superior performance compared to some other control methods. [ABSTRACT FROM AUTHOR]

Due to continuous urban sprawl, large-scale bus network design has become a major challenge in urban transport planning. The continuous increase in urban population and scale makes the factors considered in the urban route network design increasingly complex. Contemporary public transportation network design problems are based more on efficiency goals such as the accessibility and comfort of the transportation network, which increases the difficulty of analyzing the problem. Bus network design is not only an NP-hard (nondeterministic polynomial) problem but also a multivariable and multiobjective problem. This paper focuses on the bivariate and multiobjective bus network design problem of route generation and station selection. This paper proposes an algorithm called the Pseudo Force Field. By combining the idea of Particle Swarm Optimization (PSO) and the properties of the force field, a feasible route generation scheme is provided for the design of the bus network. The algorithm does not need to determine the end station and has a high degree of completion of the demand. This solves the problem of the selection of terminal stations in large-scale road network design. On this basis, the article combines Genetic Algorithm (GA) and Pareto frontier to provide a new route optimization algorithm and proves the effectiveness of the algorithm. The model has achieved theoretical results in the design of the bus route network in the megacity of Shenzhen, China. [ABSTRACT FROM AUTHOR]

In recent years, the incidence of diabetes has been increasing year by year. Since most of the fundus lesions are located near blood vessels, the image information is complex, and the end vessels are difficult to identify. So, a new segmentation method of diabetic retinal vessel images based on particle swarm optimization and salp swarm algorithm is proposed. This paper uses a Gaussian filter to enhance the main blood vessels, and a top-bot hat transform is used to strengthen the end vessels. The preprocessing process is completed by combining and reconstructing the two images through a normalization operation. The improved particle swarm optimization and salp swarm algorithms perform multi-threshold segmentation on the preprocessed vessel images. The best fit value, Structural Similarity Index Measure, Peak Signal to Noise Rati, feature similarity index measure, sensitivity, accuracy, regional consistency, Dice coefficient, Jaccard similarity, and Shannon entropy are selected for comprehensive evaluation and analysis. The results showed that this paper's improved particle swarm-salp swarm algorithm for segmenting diabetic retinal blood vessel images is more efficient, and the threshold is better. The vascular segmentation method in this paper is applied in medical image processing, which improves the accuracy of medical image processing and reduces the computational effort. [ABSTRACT FROM AUTHOR]

In order to actively respond to the "14th Five-Year Plan," the PGA algorithm is used to develop a new energy planning strategy in this paper. The project can make full use of my country's abundant renewable energy resources, encourage energy conservation and reduction of emissions, improve the energy structure's low-carbon level, support the development of smart green energy, and achieve ecological civilization construction. This solution can show users how much greenhouse gas emissions can be reduced through some environmental changes, as well as the basic issues of meeting the future energy needs. It can display the benefits, costs, and emissions data under different scenarios in the future and use the scenario demonstration method to show energy planning to make energy data more vivid. It allows people, technicians, and decision makers to understand what will happen to China's carbon emissions over time in the next 15 years. This paper innovatively combines a particle swarm optimization algorithm with a genetic algorithm and designs a PGA algorithm for path optimization. In terms of carbon emission reduction, comparative trials demonstrate that the PGA algorithm's path optimization is 58.06 percent greater than the genetic algorithm; In terms of cost, the PGA algorithm's path optimization is 15.72% less expensive than the genetic algorithm's. This article provides a reference path for selecting the best results for future energy planning schemes and provides a new strategy for the "14th Five-Year" energy plan. [ABSTRACT FROM AUTHOR]

Knowledge map is a new method of knowledge management with the information revolution. This paper is aimed at forming a systematic and standardized huge redundant knowledge structure, which can be used to mine the knowledge structure and the relationship between knowledge and visualize it in a graphical way, in order to obtain more representative information and improve the classification accuracy of text classification model. In this paper, a knowledge map construction method based on the Text CNN algorithm is proposed for the subject of Nautical English. It is of practical significance and academic value to make use of knowledge map to study Chinese Maritime English, which is helpful to the development of Chinese Maritime English and provides guidance. In order to maintain the diversity of particle swarm optimization, the Text CNN algorithm is combined with the construction of Maritime English subject knowledge map, and the network parameters and structure are optimized. Using knowledge map to study China Maritime English has important practical significance and academic value and has certain guiding significance for the development of China Maritime English. [ABSTRACT FROM AUTHOR]

Each Chinese region has its own ancient opera, which is a treasure of folk culture and a living fossil for studying the historical origins of a local culture. It has significant academic value and historical significance at the national and local levels, whether from the perspective of promoting and disseminating national culture or from the perspective of protecting the world's intangible cultural heritage. Based on this practical significance, this paper conducts a study using the particle swarm algorithm to manage the marketing archives of drama intangible cultural heritage. The article employs the PSO algorithm to test the particle swarm optimization algorithm's convergence and conditions. The effectiveness of the algorithm is analysed in the Sphere function, Rosenbrock function, Griewanks function, and Rastrigin noncont function, and then the algorithm is compared, including the calculation speed comparison between the algorithm in this paper and the three optimal fitness functions. The experimental results show that the PSO algorithm has the highest four items in the statistics of the Schwefel function experimental results. About 45.0379 is the best value and 70.5878 is the maximum precision. The optimal average value is 6.1524, while the average value is 56.15245. In comparison to the QPSO and PSO algorithms, the algorithm in this paper has a faster convergence speed and better search accuracy. The topic of the intersection of the disciplines of drama, intangible cultural heritage marketing, and archive management using the particle swarm algorithm is well-developed. [ABSTRACT FROM AUTHOR]

Chinese traditional culture is a typical "moral culture," and traditional morality is the core and essence of culture. However, in recent years, the phenomenon of following the trend of rural construction has been particularly serious, and many villages have lost their original features. To solve the above problems, the genetic algorithm can be used to further explore the traditional culture of urbanization construction. A genetic algorithm is a natural evolutionary process that imitates natural selection and genetic operation in nature to obtain optimal solution, in which genetic operation mainly includes the processes of gene replication, crossover, and mutation. This paper studies the traditional culture of urbanization construction based on the genetic algorithm under the concept of environmental protection. Among the accuracy of urban construction land expansion, in 2018, the accuracy of ant colony algorithm, data mining algorithm, and particle swarm optimization algorithm is 58%, 51.8%, and 56.7%, respectively. The accuracy of this genetic algorithm is as high as 58.8%. It can be seen that the genetic algorithm in this paper has the highest accuracy in the expansion of urban construction land. Therefore, in the process of large-scale urbanization based on the genetic algorithm, we should pay attention to not being separated from traditional culture, not letting farmers lose their regional culture, local culture, and grassroots culture, and protecting the cultural-ecological environment on which these cultures depend. [ABSTRACT FROM AUTHOR]

Based on the principle of particle swarm algorithm and support vector machine, this article aims to improve the classification performance of college English teaching effect and explores the best support vector machine parameter optimization algorithm to promote college English teaching for the theory and application research of data analysis. First, the advantages and disadvantages of common support vector machine parameter selection methods such as grid search algorithm, gradient descent method, and swarm intelligence algorithm are studied. Secondly, this article has a detailed analysis and comparison of various other algorithms. Finally, the study analyzed the advantages and disadvantages of the quantum particle swarm algorithm, introduced the dual-center idea into the quantum particle swarm algorithm, and proposed an improved quantum particle swarm algorithm. Through simulation experiments, it is proved that the improved quantum particle swarm algorithm is more superior in optimizing the parameters of support vector machine. In general, this paper uses the PSO algorithm to simultaneously solve the SVM feature selection and parameter optimization problems and has achieved good results. Within the scope of the literature that the author has, there is still a lack of work in this area. Compared with the existing algorithms, the algorithm proposed in this paper has stronger feature selection ability and higher efficiency. [ABSTRACT FROM AUTHOR]

With the rapid development of artificial intelligence, handicraft design has developed from artificial design to artificial intelligence design. Traditional handicraft design has the problems of long time consumption and low output, so it is necessary to improve the process technology. Artificial intelligence technology can provide optimized design steps in handicraft design and improve design efficiency and process level. Handicrafts are regarded as important social products and exist in people's daily life. In the current society, many people do handicrafts and there are major exhibitions. Furthermore, the display of handicrafts is also very grand and shocking. In the design of handicrafts, the traditional design method cannot completely keep up with the production speed and efficiency of handicrafts. Therefore, this paper adopts the fusion multi-intelligent decision algorithm of multi-node branch design in the design method of handicraft. The algorithm model combination is used to analyze and design the layout of the handicraft, which speeds up the design efficiency and production of the handicraft. In this paper, two intelligent algorithms will be used for fusion; they are genetic algorithm and GA-PSO fusion algorithm obtained by particle swarm optimization and they are embedded in handicraft design method for application through mathematical model construction and function construction. After comparing the performance parameter index data of three intelligent algorithms and GA-PSO fusion algorithm, it is obtained that GA-PSO fusion algorithm is 97% correct and has 82% readability, 72% robustness, and 61% structure, making it have better important indicators. Four algorithms optimize each design problem in all aspects of handicraft design at present. Design efficiency, image distribution rate, image optimization degree, and image clarity are compared by simulation experiments. Compared with three intelligent algorithms, traditional design methods, and manual design methods, GA-PSO fusion algorithm can effectively improve the design method and design effect of handicrafts with 92.1% design efficiency, 82.7% image distribution rate, 94.3% image optimization degree, and 84% layout void rate. Finally, the space complexity experiment of four algorithms shows that GA-PSO algorithm can achieve 9.73 dispersion with 11.42 space complexities, which makes the dimension reduction relatively stable, and the algorithm can maintain stability in the design and application of handicrafts. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low detection rate and high false detection rate of intrusion detection algorithms in the traditional cloud computing environment, an intrusion detection-data security protection scheme based on particle swarm-BP network algorithm in a cloud computing environment is proposed. First, based on the four modules of data collection, data preprocessing, feature selection, and intrusion detection, the overall framework of the intrusion detection model is constructed by designing corresponding functions. Then, by introducing the decision tree algorithm, the overfitting is reduced and the data processing speed of the model is improved, and on this basis, the feature selection is carried out through the "gain rate" optimization method, which reduces the redundant information of the feature vector. Finally, by introducing the Particle Swarm Optimization (PSO) algorithm into the optimization of the initial weights and thresholds of the BP neural network, the BP neural network is improved based on the momentum factor and adaptive learning rate, and the high detection rate and low false detection rate are realized. Through simulation experiments, the proposed intrusion detection method and the other three methods are compared and analyzed under the same conditions. The results show that the detection rate and false detection rate of the method proposed in this paper are the best under five different types of sample data, the highest detection rate reaches 95.72%, and the lowest false detection rate drops to 2.03%. The performance of the proposed algorithm is better than that of the other two comparison algorithms. [ABSTRACT FROM AUTHOR]

Many important computational applications in science, engineering, industry, and technology are represented by PSE (parameter sweep experiment) applications. These applications involve a large number of resource-intensive and independent computational tasks. Because of this, cloud autoscaling approaches have been proposed to execute PSE applications on public cloud environments that offer instances of different VM (virtual machine) types, under a pay-per-use scheme, to execute diverse applications. One of the most recent approaches is the autoscaler MOEA (multiobjective evolutive algorithm), which is based on the multiobjective evolutionary algorithm NSGA-II (nondominated sorting genetic algorithm II). MOEA considers on-demand and spot VM instances and three optimization objectives relevant for users: minimizing the computing time, monetary cost, and spot instance interruptions of the application's execution. However, MOEA's performance regarding these optimization objectives depends significantly on the optimization algorithm used. It has been shown recently that MOEA's performance improves considerably when NSGA-II is replaced by a more recent algorithm named NSGA-III. In this paper, we analyze the incorporation of other multiobjective optimization algorithms into MOEA to enhance the performance of this autoscaler. First, we consider three multiobjective optimization algorithms named E-NSGA-III (extreme NSGA-III), SMS-EMOA (S-metric selection evolutionary multiobjective optimization algorithm), and SMPSO (speed-constrained multiobjective particle swarm optimization), which have behavioral differences with NSGA-III. Then, we evaluate the performance of MOEA with each of these algorithms, considering the three optimization objectives, on four real-world PSE applications from the meteorology and molecular dynamics areas, considering different application sizes. To do that, we use the well-known CloudSim simulator and consider different VM types available in Amazon EC2. Finally, we analyze the obtained performance results, which show that MOEA with E-NSGA-III arises as the best alternative, reaching better and significant savings in terms of computing time (10%–17%), monetary cost (10%–40%), and spot instance interruptions (33%–100%). [ABSTRACT FROM AUTHOR]

The power-voltage (P-V) characteristic curve of the centralized thermoelectric generation (TEG) system under nonuniform temperature distribution (NTD) exhibits multiple extreme point characteristics, and the traditional maximum power point tracking (MPPT) algorithm is prone to fall into the local maximum power point (LMPP) and takes a long time to track. This paper designs a BP-IPSO algorithm based on back propagation neural network (BPNN) and improved particle swarm optimization (IPSO) for MPPT. The algorithm firstly utilizes the good nonlinear function fitting ability of BPNN to obtain the fitting curve of the relationship between system control input and power output to establish the TEG array power prediction model. Then, the dynamic learning factor and weight coefficient are introduced into the traditional particle swarm optimization (PSO) algorithm to search the output power prediction model and realize MPPT control. MATLAB/Simulink experiment results show that BP-IPSO algorithm can effectively avoid falling into LMPP, quickly and accurately track the global maximum power point (GMPP), and effectively suppress the oscillation of voltage and power during the tracking process. Especially in the start-up test experiment, compared with perturb and observe (P&O), PSO, and grey wolf optimizer (GWO), the energy generated by BP-IPSO increased by 12.84%, 3.18%, and 4.75%, respectively, which improved the system power generation efficiency. [ABSTRACT FROM AUTHOR]

In this paper, a cognitive electronic jamming decision-making method based on improved Q -learning is proposed to improve the efficiency of radar jamming decision-making. First, the method adopts the simulated annealing (SA) algorithm's Metropolis criterion to enhance the exploration strategy, balancing the contradictory relationship between exploration and utilization in the algorithm to avoid falling into local optima. At the same time, the idea of stochastic gradient descent with warm restarts (SGDR) is introduced to improve the learning rate of the algorithm, which reduces the oscillation and improves convergence speed at the later stage of the algorithm iteration. Then, a cognitive electronic jamming decision-making model is constructed, and the improved Q -learning algorithm's specific steps are given. The simulation experiment takes a multifunctional radar as an example to analyze the influence of exploration strategy and learning rate on decision-making performance. The results reveal that compared with the traditional Q -learning algorithm, the improved Q -learning algorithm proposed in this paper can fully explore and efficiently utilize and converge the results to a better solution at a faster speed. The number of iterations can be reduced to more than 50%, which proves the feasibility and effectiveness of the method applied to cognitive electronic jamming decision-making. [ABSTRACT FROM AUTHOR]

The photovoltaic(PV) system's efficiency can be improved with the aid of effective solar PV cell modeling. However, flawed solar cell parameters affect PV cell modeling incorrectly. The manufacturers are usually not providing all the necessary data for the exact modeling of PV cells. It is therefore necessary to efficiently predict the parameters of the PV cell. The literature discusses various optimization algorithms, but the suboptimal outcomes are obtained by most of the algorithms due to their convergence toward local minima. This paper introduces a new stochastic optimization algorithm for the estimation of solar PV cell parameters. Therefore, for the evaluation of the solar cell, a new novel chaotic algorithm is introduced in this paper called the chaotic tunicate swarm algorithm (CTSA). The proposed algorithm has a new function called an outstanding mathematical model of adaptive weights to stimulate negative and positive inputs from the spreading wave in order to find the best way to connect food with an excellent exploitation tendency and exploratory ability. For the double‐diode model, the computation time of the chaotic variants (CTSA1‐1.1885, CTSA2‐1.2502, CTSA3‐1.2962, CTSA4‐1.1204, and CTSA5‐1.2214) is better than the rest of the compared algorithms (particle swarm optimization [PSO]‐17.4532, tunicate swarm algorithm (TSA)‐2.5278, Harris hawks optimization [HHO]‐10.8942, ant lion optimizer [ALO]‐15.0214, and atom search optimization [ASO]‐9.5214). For the triple‐diode model, the computation time of the chaotic variants (CTSA1‐1.2658, CTSA2‐1.3520, CTSA3‐1.3056, CTSA4‐1.2290, and CTSA5‐1.3859) is better than the rest of the compared algorithms (PSO‐18.5421, TSA‐3.2568, HHO‐9.8754, ALO‐13.5841, and ASO‐11.8412). The superiority of proposed algorithm is established using ranking test, statistical error analysis, and sensitivity temperature variation. [ABSTRACT FROM AUTHOR]

Summary: Automatic generation control (AGC) plays a crucial role in modern power system to control the frequency with change in power demand. A novel fractional order (FO) hybrid PID‐fuzzy‐PID (FO‐hPID‐FPID) controller is proposed in this paper as the secondary controller for AGC of a three unequal area interconnected nonlinear reheat thermal power system considering generation rate constraint. This paper also deals with the implementation of FO fuzzy PID (FOFPID) and FO PID (FOPID) controllers in addition to the proposed controller along with their counterpart integer order controllers to establish the dominance of FO controllers over integer order controllers. Various parameters of the controllers are optimized by hybridizing two global optimization techniques: particle swarm optimization and modified sine cosine algorithm (MSCA) and the optimization techniques so obtained is called as hybrid PSO‐MSCA (hPSO‐MSCA) technique. A step load perturbation of 0.01 p.u. is injected in area‐1, and the system response is investigated independently with different controllers. It is revealed that the proposed FO‐hPID‐FPID delivers superior performance than the other controllers. Sensitivity analysis for parametric variations is carried out, and random load test is performed to validate the robustness of the proposed controller. Further, it is observed that the controllers deliver result in an ascending order of control performance as PID, FOPID, FPID, FOFPID, hPID‐FPID and FO‐hPID‐FPID controllers with FO‐hPID‐FPID controller delivering the best result and the FO controllers deliver better control performance than their integer order counterparts. [ABSTRACT FROM AUTHOR]

Construction project cost prediction is an important function in construction-related fields; it can provide an important basis for project feasibility study and design scheme comparison and selection, and its accuracy will directly affect the investment decision of the project. The successful realization of construction cost prediction can bring great convenience to the control and management of construction cost. The purpose of this paper is to study a fast, accurate, convenient, deducible, and rational construction project cost prediction method, to provide a basis for the cost management of the whole life cycle of the project. Therefore, this paper uses particle swarm optimization algorithm to improve BP neural network and proposes a novel construction project cost prediction algorithm based on particle swarm optimization-guided BP neural network. Aiming at the defects of BP neural network updating weights and thresholds with the gradient descent method, this paper uses the advantages of particle swarm optimization in the field of parameter optimization to optimize BP neural network with PSO algorithm. The structure of BP neural network weights and the threshold of each neuron in the coding, through intelligent search for each particle, find the most suitable weights and thresholds, so that the BP neural network has faster convergence speed, better generalization ability, and higher prediction precision. Simulation results also show that the proposed algorithm is competitive enough. [ABSTRACT FROM AUTHOR]

The New Caledonian crow learning algorithm (NCCLA) is a novel metaheuristic algorithm inspired by the learning behavior of New Caledonian crows learning to make tools to obtain food. However, it suffers from the problems of easily falling into local optima and insufficient convergence accuracy and convergence precision. To further improve the convergence performance of NCCLA, an improved New Caledonian crow learning algorithm (INCCLA) is proposed in this paper. By determining the parent individuals based on the cosine similarity, the juveniles are guided to search toward different ranges to maintain the population diversity; a novel hybrid mechanism of complete and incomplete learning is proposed to balance the exploration and exploitation capabilities of the algorithm; the update strategy of juveniles and parent individuals is improved to enhance the convergence speed and precision of the algorithm. The test results of the CEC2013 and CEC2020 test suites show that, compared with the original NCCLA algorithm and four of the best metaheuristics to date, INCCLA has significant advantages in terms of convergence speed, convergence precision, and stability. [ABSTRACT FROM AUTHOR]

Feature selection and lung nodule recognition are the core modules of the lung computer-aided detection (Lung CAD) system. To improve the performance of the Lung CAD system, algorithmic research is carried out for the above two parts, respectively. First, in view of the poor interpretability of deep features and the incomplete expression of clinically defined handcrafted features, a feature cascade method is proposed to obtain richer feature information of nodules as the final input of the classifier. Second, to better map the global characteristics of samples, the multiple kernel learning support vector machine (MKL-SVM) algorithm with a linear convex combination of polynomial kernel and sigmoid kernel is proposed. Furthermore, this paper applied the methods for speed contraction factor and roulette strategy, and a mixture of simulated annealing (SA) and particle swarm optimization (PSO) is used for global optimization, so as to solve the problem that the PSO is easy to lose particle diversity and fall into the local optimal solution as well as improve the model's training speed. Therefore, the MKL-SVM algorithm is presented in this paper, which is based on swarm intelligence optimization is proposed for lung nodule recognition. Finally, the algorithm construction experiments are conducted on the cooperative hospital dataset and compared with 8 advanced algorithms on the public dataset LUNA16. The experimental results show that the proposed algorithms can improve the accuracy of lung nodule recognition and reduce the missed detection of nodules. [ABSTRACT FROM AUTHOR]

Summary: This paper presents an optimal parameter identification strategy of the lithium‐ion (Li‐ion) battery model applying a recent metaheuristic artificial ecosystem‐based optimization (AEO) algorithm, which proves its ability in terms of both convergence speed and complexity. The key idea is to update the battery model parameters using the optimizer outputs. In the current paper, the battery model is based on the Shepherd model. To demonstrate the superiority of the suggested method of identification, the test results are compared in terms of efficiency, convergence speed, and accuracy of identification with those obtained by the salp swarm algorithm, the political optimizer, the equilibrium optimizer, and particle swarm optimization. Through the optimization procedure, the undetermined parameters of the battery model are employed as decision variables, but the root‐mean‐square error between estimated data and battery data is assigned to be an objective function must be minimal. The results showed the superior identification ability of the AEO compared to the other optimizers. This optimizer achieved 99.9% identification efficiency, which makes it an ideal solution for battery identification. Besides its identification efficiency, the AEO is much faster than the other optimizers, as the results show. [ABSTRACT FROM AUTHOR]

Green development is the hot spot of cold chain logistics today. Therefore, this paper converts carbon emission into carbon emission cost, comprehensively considers cargo damage, refrigeration, carbon emission, time window, and other factors, and establishes the optimization model of location of low-carbon cold chain logistics in the Beijing-Tianjin-Hebei metropolitan area. Aiming at the problems of the fish swarm algorithm, this paper makes full use of the fireworks algorithm and proposes an improved fish swarm algorithm on the basis of the fireworks algorithm. By introducing the explosion, Gaussian mutation, mapping and selection operations of the fireworks algorithm, the local search ability and diversity of artificial fish are enhanced. Finally, the modified algorithm is applied to optimize the model, and the results show that the location scheme of low-carbon cold chain logistics in Beijing-Tianjin-Hebei metropolitan area with the lowest total cost can be obtained by using fireworks-artificial fish swarm algorithm. [ABSTRACT FROM AUTHOR]

Variational mode decomposition (VMD) has been applied in the field of rolling bearing fault diagnosis because of its good ability of frequency segmentation. Mode number K and quadratic penalty term α have a significant influence on the decomposition result of VMD. At present, the commonly used method is to determine these two parameters adaptively through intelligent optimization algorithm, namely, the parameter-adaptive VMD (PAVMD) method. The key of the PAVMD method is the setting of an objective function, and the traditional PAVMD method is prone to overdecomposition or underdecomposition. To solve these problems, an improved parameter-adaptive VMD (IPAVMD) method is proposed. A new objective function, the maximum average envelope kurtosis (MAEK), is proposed in this paper. The new objective function fully considers the equivalent filtering characteristics of VMD, and squared envelope kurtosis has good antinoise performance. In the optimization method, this paper uses an improved particle swarm optimization (PSO) algorithm. The MAEK and PSO can make sure the IPAVMD method reaches the best complete decomposition of the signal without an underdecomposition or overdecomposition problem. Through the analysis of simulation data and experimental data, the performance of the IPAVMD and the traditional PAVMD is compared. The comparison results show that the proposed IPAVMD has better performance and stronger robustness than the traditional method and is suitable for both single-fault and multiple-fault cases of rolling bearings. The research results have certain theoretical significance and application value for improving the fault diagnosis effect of rolling bearings. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of population-based metaheuristic algorithms have been proposed to solve the flexible job-shop scheduling problem (FJSP) according to its practicality and complexity. Most of these algorithms are single-population-based and hence are very susceptible to becoming trapped in local optimal values. Thus, multipopulation methods are widely used to improve these algorithms, resulting in multipopulation algorithms. These multipopulation algorithms have been widely studied in the context of single-layer complex networks recently. However, coupled networks used to control two (or more) algorithms simultaneously to get a better algorithm are always ignored in literature. Therefore, in this paper, using coupled scale-free networks (with different scaling exponents) to control the genetic algorithm (GA) and the invasive weed optimization (IWO) simultaneously, a multipopulation GA/IWO with coupled scale-free networks (MPGAIWO-SF) is proposed to solve FJSP. Then, we study how some parameters (e.g., subpopulation size, subpopulation number, and scaling exponent) of MPGAIWO-SF affect its performance, which is also ignored in literature. The simulation results illustrate that (1) the performance of MPGAIWO-SF is significantly improved compared with that of GA and IWO; (2) as the subpopulation size increases, the performance of MPGAIWO-SF first becomes better and then remains almost unchanged; (3) as the subpopulation number increases, the performance of MPGAIWO-SF first becomes better and then decreases rapidly; and (4) the performance of MPGAIWO-SF becomes worse slightly as the scaling exponent decreases. Finally, solving more FJSP instances, the MPGAIWO-SF with optimized parameters is compared with other related algorithms to verify its effectiveness. [ABSTRACT FROM AUTHOR]

Accurate wind power forecasting can help reduce disturbance to the grid in wind power integration. In this paper, a short-term power forecasting model is established by using complete ensemble empirical mode decomposition adaptive noise (CEEMDAN) and nonlinear fitting characteristics of support vector machines (SVM) to accurately predict wind power. First, the wind power data are preprocessed and decomposed to 6 stable power components using CEEMDAN, thus reducing the impact of excessive forecasting errors of oscillatory points at peaks and valleys. Then, particle swarm optimization (PSO) based on improved empirical mode decomposition is designed to optimize the kernel function and penalty factor of the SVM. It establishes a new short-term power forecasting CEEMDAN-combined model. Finally, each stable component data is processed using the power forecasting model, and then, the results are combined to get the final power forecasting value. Analysis of test results and comparative studies show that the RMSE and MAPE of the new model are only one-third of that of the traditional SVM algorithm. The forecasting accuracy and speed meet the requirements for safe operation of wind farms. [ABSTRACT FROM AUTHOR]

The shape optimization of developable surfaces is a key and difficult technology in CAD/CAM. This paper studies the shape optimization of generalized developable Bézier-like surfaces using the improved salp swarm algorithm. First, aiming at the problems of slow convergence speed and low calculation accuracy, quickly falling into the optimal local solution for the salp swarm algorithm, and by adjusting the control parameters, the added Morlet wavelet mutation strategy to the individual position updates operation. An improved salp swarm algorithm is proposed, called FMSSA for short. Numerical results show that FMSSA performed the best among 18 (78%) comparisons with other improved SSAs in the CEC2005 test set. In addition, FMSSA serves the best among 16 (69%) comparisons with other algorithms. Therefore, the convergence speed and computational accuracy of FMSSA are improved, and the computational results are significantly better than other intelligent algorithms. Second, according to the duality principle of point and plane, the shape optimization problem of generalized developable Bézier-like surface is transformed into the minimization problem of arc length, energy, and curvature change rate of the dual curve, and three shape optimization models of the developable surface are established. Finally, shape optimization of expandable surfaces is mathematically an optimization problem that the swarm intelligence algorithm can efficiently handle, so FMSSA is used to solve these three optimization models. Numerical experiments show that FMSSA obtains optimal generalized developable Bézier-like surfaces in solving these three optimization models, demonstrating the superiority of the proposed FMSSA in effectively solving the shape optimization models in terms of precision and robustness. [ABSTRACT FROM AUTHOR]

Aiming at the resource optimization problem in the cooperative detection task, the objective function is constructed based on the channel capacity, and the artificial bee colony (ABC) algorithm is improved to realize the joint optimization of the UAV swarm trajectory and radiation power. Firstly, a multiple input multiple output (MIMO) cooperative detection model is constructed. Then, based on the perspective of information theory, the channel capacity of the cooperative detection model is derived and used as the objective function for optimizing the detection resources of UAV swarm. Then, the factors affecting the objective function are sorted out and analyzed one by one, and the constraints are clarified. Aiming at the shortcomings of ABC algorithm, its search strategy and parameter optimization method are improved. A joint optimization process of UAV swarm trajectory and radiated power based on improved ABC algorithm is constructed. Finally, through simulation verification and algorithm comparison, it shows that the algorithm in this paper can improve the perception ability of cooperative detection of UAV swarm. [ABSTRACT FROM AUTHOR]

Due to the current nonlinear traffic noise and changing natural environment, accurate prediction of traffic noise has become a major challenge. In order to improve the accuracy of traffic noise prediction, this paper constructs a short-term traffic noise prediction model based on PSO algorithm and BRF network structure. The model can predict the noise state of future traffic according to historical traffic information. Particle swarm optimization (PSO) network is used for short-term traffic prediction to deal with the problems of low accuracy and long-time consumption. A BRF (one-dimensional convolution)-PSO short-term traffic noise prediction model is proposed. BRF method is used to extract the spatial features of traffic noise and compared with PCA (principal component analysis)-PSO model and PSO model. The results show that the prediction accuracy of BRF-PSO model is 2% higher than that of PCA-PSO model and 6% higher than that of PSO model, which proves the effectiveness of BRF-PSO model. This study provides a technical reference for the short-term traffic noise prediction of intelligent city and the effective improvement of urban traffic environment. [ABSTRACT FROM AUTHOR]

In the Internet of Things (IoT) ecosystem, localization is critical for tracking and monitoring targets via nodes. The distance vector-hop (DV-Hop) technique is a good choice for localizing neighborhood in IoT networks. The conventional DV-Hop algorithm is a distributed localization approach that does not consider the distribution of the nodes into full deliberation when calculating the hop count from the source to destined nodes. The transfer distance and node positions thus do not attain higher efficiency while ascertaining the distance between sources and destined nodes. The study aims to resolve the pitfalls in the traditional algorithm by making enhancements in controlling the original DV-Hop algorithm's hop count and transfer distance method by utilizing the particle swarm to estimate the node positions. Error rate in the distance between beacon nodes and unseen nodes is effectively reduced with the proposed technique that calculate error factors with corrections in a reversed fashion to revise hop counts. An escape factor is introduced to take control of updating particles' velocity in the system, and the inertia weight is defined by a piecewise function to enlarge search space. This mechanism increases the diversity of the particle populations and mitigates the tendency of estimations on node positions to be trapped into local optima under stationary state. Also, the improved DV-Hop algorithm described in the paper has a better convergence speed due to the presence of random inertia weight logarithmic method. Finally, the problem of premature convergence is also tackled as a variation factor is adopted in collaboration with a fitness function that affects the particles' movement range and assists in global convergence. The overall performance of improved DV-Hop is evaluated by statistical metrics and also compared with the traditional DV-Hop algorithm under simulated environment with the data collected from real-world scenarios. Industry 4.0 is fully dependent upon IoT and the count of hops is very important for deciding the routing from the source to destination for speedy transmission of data. The improved DV-hop algorithm can achieve better results and has reduced error rate by more than 30%. The DV-Hop algorithm plays an important role in IoT-enabled environment especially in Industry 4.0. [ABSTRACT FROM AUTHOR]

In order to overcome the defect that sparrow search algorithm converges very fast but is easy to fall into the trap of local optimization, based on the original mechanism of sparrow algorithm, this paper proposes game predatory mechanism and suicide mechanism, which makes sparrow algorithm more in line with its biological characteristics and enhances the ability of the algorithm to get rid of the attraction of local optimization while retaining the advantages of fast convergence speed. By initializing the population with the good point set strategy, the quality of the initial population is guaranteed and the diversity of the population is enhanced. In view of the current situation that the diversity index evaluation does not consider the invalid search caused by individuals beyond the boundary in the search process, an index to measure the invalid search beyond the boundary in the search process is proposed, and the measurement of diversity index is further improved to make it more accurate. The improved algorithm is tested on six basic functions and CEC2017 test function to verify its effectiveness. Finally, the improved algorithm is applied to the three-dimensional path planning of UAV with threat area. The results show that the improved algorithm has stronger optimization performance, has strong competitiveness compared with other algorithms, and can quickly plan the effective and stable path of UAV, which improves an effective method for the application in this field and other fields. [ABSTRACT FROM AUTHOR]

Summary: With the commercialization of the electric vehicles, the large‐scale lithium‐ion cells as the power of electric vehicles are to be retired. The second‐use of retired cells is of great significance to improve the battery economy. A fast classification and regroup evaluation method of the retired lithium‐ion cells are proposed in this paper to improve the classification efficiency of retired lithium‐ion cells and adapt to the regroup under different conditions. The lithium‐ion cells after being balanced in parallel are charged in series with a constant current. A support vector regression (SVR) model with the parameters optimized by the particle swarm optimization (PSO) algorithm is built for the fast capacity estimation and the error will not exceed 0.3%. Different cells regrouped means different performance. In order to improve the consistency of retired cells and satisfy different using conditions, a Weighted‐K‐means algorithm is proposed in this paper to regroup the cells with the known capacity and internal resistance. The classification method is evaluated by the voltage consistency of cells using different working conditions, which indicates capacity occupied a large proportion can meet the requirement of energy condition meanwhile keep a good consistency. But the resistance will dominate in algorithm under conditions which have requirement for instantaneous power. [ABSTRACT FROM AUTHOR]

Sensor deployment is an important issue in wireless sensor network (WSN), which is a typical nonlinear system. Conditions of both area coverage and point coverage should be considered in research studies on sensor coverage. It is generally necessary to ensure high coverage ratio of area when controlling sensor locations, and covering specific point targets to ensure long lifetime is also important sometimes. In current studies, swarm intelligence algorithms such as particle swarm optimization (PSO) are widely used to solve the sensor deployment problem in WSN. In this paper, coverage rate and network life indicators are analyzed comprehensively with establishment of a more general K-coverage model. In related calculation examples with different coverage requirements including target coverage, area coverage, and boundary coverage, several improved algorithms based on PSO are applied to solve the problem in the paper. Simulation results show that the improved algorithms can achieve a good performance and deployment effect. [ABSTRACT FROM AUTHOR]

Most of the traditional tourism route planning algorithms only consider single-factor planning, that is, the influence of scenic spots on route planning. Particle swarm optimization algorithm is favored by many people because of its simple concept, easy implementation, and good robustness. Aiming at this problem, this paper takes the actual geographic data as the research object of the tourism route problem and describes the model of the discrete particle swarm algorithm based on geographic coordinates to solve the tourism route problem, which is used to solve practical problems. In order to further improve the global search ability of the algorithm, a self-balancing mechanism is proposed, which makes the algorithm process simple and the algorithm performance improved. At the same time, multithread parallelism is adopted to improve the solution speed of the algorithm, which makes up for the deficiency of the parallelization research of the algorithm. [ABSTRACT FROM AUTHOR]

With the rapid development of artificial intelligence (AI) concept technology, it promotes the innovation of educational concept. Mostly for the education information analysis in the class of mathematics in the university, it should be based on a big data-driven system to promote the quality of teaching in the classroom. In the method of teaching math in university, teachers should take full advantage of the benefits of a big data-driven system powered by AI, grow a good teaching model for students, promote education through big data, progressively teach students according to their aptitude, develop in a tailored direction, increase teaching quality and effectiveness, and finally create more great talents for our country. For the sake of improving the resource sharing and the management level of the curriculum which teaches advanced knowledge about mathematics teaching, based on a particle swarm optimization algorithm, an advanced math teaching system is proposed in this paper. The fusion model that can be used in the teaching process of math in university is constructed, the adaptive scheduling of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resources is realized by an optimization algorithm used for fusion particle swarm, the autocorrelation feature of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resources is extracted, and the adaptive optimization of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching resource fusion is realized by fuzzy correlation feature matching and statistical analysis. In the process of particle swarm optimization, the combination of statistical features is studied and managed, the resource scheduling and information fusion are realized, and the management capability of the curriculum which teaches advanced knowledge about mathematics auxiliary teaching is promoted, and the experimental results demonstrate that the designed system has a high integration of teaching information resources and strong information scheduling ability and improved the management level of the curriculum which teaches advanced knowledge about mathematics complementary teaching. [ABSTRACT FROM AUTHOR]

Due to the large fluctuation of import and export volume and many influencing factors, it is difficult for the general prediction algorithm to obtain more accurate prediction results. To solve this problem, a trade forecasting method based on the Particle Swarm Optimization (PSO) optimization hybrid Relevance Vector Machine (RVM) model is proposed. The method firstly finds out the indexes that affect the import and export trade and extracts the principal factors of the indexes as the input data of the model through principal component analysis. Then, based on the single-kernel RVM model training with multiple different kernel functions, the multikernel weighting method was used to construct the hybrid kernel RVM model according to the prediction error of the single-kernel RVM model. Finally, the parameters of the hybrid kernel model were optimized by PSO to improve the prediction accuracy. Close trade will strengthen the dependence between countries, and under this premise, it becomes particularly important to study the frequency of trade between countries. In this paper, the countries along the Belt and Road are classified by the method of high-order directed graph clustering, and the trade transactions between the countries are represented by a small network subgraph. Then, the 65 trading countries are classified by cutting graph and K-means clustering method, and the classification results are obtained by running relevant codes in MATLAB. The results are represented by the lattice graph. [ABSTRACT FROM AUTHOR]

Neural network algorithms and intelligent algorithms are hot topics in the field of deep learning. In this study, the neural network algorithm and intelligence are optimized, and it is used in simulation experiments to improve the target image recognition ability of the algorithm in the machine vision environment. First, this paper introduces the application of neural networks in the field of machine vision. Second, in the experiment, the improved VGG-16 convolutional neural network (CNN) model is applied to metal block defect detection. Experimental results show that the optimized network can classify metal block defects with the maximum accuracy of 99.28%. Then, the intelligent algorithm based on neural network is studied, and the CIFAR-10 data set is taken as the experimental target for training test and verification test. Using BP algorithm, particle swarm optimization algorithm (PSO-BP), and improved neural network algorithm, respectively, the convergence speed of ICS algorithm based on BP neural network is compared. In contrast, ICS-BP algorithm has the fastest convergence speed and converges when the number of iterations is 32, followed by PSO-BP algorithm. [ABSTRACT FROM AUTHOR]

Using surrogate model to assist parameter optimization of oil and gas reservoir development can greatly reduce the call times of numerical simulator and accelerate the optimization process. However, for serial simulators or parallel simulators with low speedup ratio, the conventional method is still time-consuming. Firstly, an improved surrogate model assisted particle swarm optimization (PSO) algorithm was proposed in this paper. Then, the performance of the algorithm was analyzed using the Rastrigin function. Finally, the key operation parameters of a gas hydrate reservoir by depressurization−to−hot−water−flooding method were optimized with the new method. The results show that the new method only affects the update of the global optimal particle without interfering with the calculation process of the local optimal particles at the early stage of optimization. It realizes the rapid addition of the particle samples through the good parallel features of the PSO algorithm, and therefore, improve the precision of surrogate model in a short time. At the late stage of optimization, it is transformed into a local surrogate model to achieve rapid convergence, when the training time of the surrogate model exceeds the calculation time of the simulator. Both the optimization of Rastrigin function and operation parameters of gas hydrate development reveal that the new algorithm greatly reduces the number of iterations under the same accuracy and thus successfully accelerates the optimization process. [ABSTRACT FROM AUTHOR]

To improve the machining accuracy and production efficiency of precision components with deep hole structures, an online prediction method of the inner hole roundness error, which cannot be directly measured in real time during the machining process, is proposed in this paper. For online prediction of the workpiece roundness error (WRE) during machining, a predictive model based on correlation analysis and a proportional method is proposed according to the spindle synchronous error motion (SSEM) by three-probe method testing. To improve the prediction accuracy of the WRE, a particle swarm optimization (PSO) algorithm is introduced for optimizing a probe mounting angle of a three-probe method, and a harmonic wavelet method for SSEM feature extraction is proposed. Using the PSO algorithm, the optimal probe mounting angle of the three-probe method is obtained, the influence of spindle surface roundness on SSEM is eliminated, and the higher-order harmonic suppression of the three-probe method is avoided effectively. By the harmonic wavelet method, the accurate SSEM extraction is enhanced and the WRE prediction accuracy is promoted. The experiments show that the inner hole roundness error online prediction method proposed in this paper has high prediction accuracy. [ABSTRACT FROM AUTHOR]

In recent years, disasters have seriously affected the normal development of financial business in some regions. At the time of disaster, how to effectively integrate resources of all parties, deal with sudden financial disasters efficiently, and restore financial services in time has become an important task. Therefore, this paper adopts Particle Swarm Optimization (PSO) to improve the traditional BP Neural Network (BPNN) and finally constructs a Particle Swarm Optimization powered BP Neural Network (PSO-BPNN) model for the intelligent emergency risk avoidance of sudden financial disasters in digital economy. At the same time, the proposed algorithm is also compared to GA-BPNN and BPNN algorithms, which are also intelligent algorithms. Experimental results show that the hybrid PSO-BPNN algorithm is superior to GA-BPNN algorithm and BPNN algorithm in simulation and prediction effect. It can accurately predict the sudden financial disaster in recent period, so the model has a good application prospect. [ABSTRACT FROM AUTHOR]

Slime mould algorithm (SMA) is a population-based metaheuristic algorithm inspired by the phenomenon of slime mould oscillation. The SMA is competitive compared to other algorithms but still suffers from the disadvantages of unbalanced exploitation and exploration and is easy to fall into local optima. To address these shortcomings, an improved variant of SMA named MSMA is proposed in this paper. Firstly, a chaotic opposition-based learning strategy is used to enhance population diversity. Secondly, two adaptive parameter control strategies are proposed to balance exploitation and exploration. Finally, a spiral search strategy is used to help SMA get rid of local optimum. The superiority of MSMA is verified in 13 multidimensional test functions and 10 fixed-dimensional test functions. In addition, two engineering optimization problems are used to verify the potential of MSMA to solve real-world optimization problems. The simulation results show that the proposed MSMA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability. [ABSTRACT FROM AUTHOR]

Summary: The process of constructing a reliable mathematical model of solid oxide fuel cell (SOFC) is a challenge due to its complex nature. This paper proposes a new methodology incorporated a recent meta‐heuristic algorithm named parasitism‐predation algorithm (PPA) to estimate the optimal parameters of SOFC equivalent circuit. Two experiments are conducted in this work; the first one comprises four measured datasets for a commercial enhanced cylindrical SOFC manufactured by Siemen Energy. While the second series consists of five measured datasets for a theoretical 5KW dynamic SOFC stack with 96 connected cells. The collected datasets are measured at different operating conditions. An excessive comparative study is presented with other optimizers of comprehensive learning particle swarm optimization (CLPSO), improved PSO with difference mean with perturbation (DMP_PSO), heterogeneous CLPSO (HCLPSO), locally informed PSO (LIPS), modified CSO with tri‐competitive mechanism (MCSO), opposition‐based learning competitive PSO (OBLCPSO), ranking‐based biased learning swarm optimizer (RBLSO), competitive swarm optimizer (CSO), hybrid Jaya with DE (JayaDE), and social learning PSO (SLPSO). Furthermore, statistical analyses of the ranking tests, multiple sign tests, Friedman tests, and ANOVA are performed. The obtained results confirmed the proposed PPA's competence in constructing a reliable model of SOFC as it provides the least mean square error (MSE) between the measured and estimated characteristics of 2.164e−6 in the first series of experiments at 1073 K, in contrast, the most peer (CLPSO) provides 5.57e−6. Similarly, in the second series of experiments, PPA achieves lease MSE of 7.17e−2 at 973 K; meanwhile, the most peer (CLPSO) attains 5.44e−1. [ABSTRACT FROM AUTHOR]

Target threat assessment technology is one of the key technologies of intelligent tactical aid decision-making system. Aiming at the problem that traditional beyond-visual-range air combat threat assessment algorithms are susceptible to complex factors, there are correlations between assessment indicators, and accurate and objective assessment results cannot be obtained. A target threat assessment algorithm based on linear discriminant analysis (LDA) and improved glowworm swarm optimization (IGSO) algorithm to optimize extreme learning machine (ELM) is proposed in this paper. Firstly, the linear discriminant analysis method is used to classify the threat assessment indicators, eliminate the correlation between the assessment indicators, and achieve dimensionality reduction of the assessment indicators. Secondly, a prediction model with multiple parallel extreme learning machines as the core is constructed, and the input weights and thresholds of extreme learning machines are optimized by the improved glowworm swarm optimization algorithm, and the weighted integration is carried out according to the training level of the kernel. Then, the threat assessment index functions of angle, speed, distance, altitude, and air combat capability are constructed, respectively, and the sample data of air combat target threat assessment are obtained by combining the structure entropy weight method. Finally, the air combat data is selected from the air combat maneuvering instrument (ACMI), and the accuracy and real-time performance of the LDA-IGSO-ELM algorithm are verified through simulation. The results show that the algorithm can quickly and accurately assess target threats. [ABSTRACT FROM AUTHOR]

Summary: In this paper, a phase‐lock loop control algorithm based on enhanced complex coefficient filter (ECCF‐PLL) is proposed to estimate the fundamental frequency positive‐sequence components (FFPSCs) of current and voltage signals. To mitigate power quality (PQ) problems, suitable gating pulses required for the unified power quality conditioner (UPQC) are followed by the reference signal generation and extraction of FFPSC. The power angle control (PAC) concept is used here to perform the functionality of the UPQC‐S controller for mitigation of PQ problems and sharing load reactive power between both VSCs as UPQC. The proposed ECCF‐PLL can quickly estimate the properties of the signals (grid frequency, phase angle and fundamental amplitude) under adverse grid conditions. Its sequence‐selective filtering ability enables the ECCF‐PLL to eliminate/extract disturbances before the signal enters the PLL control loop structure, while ECCF‐PLL manages an acceptable dynamic response. In addition to the ECCF‐PLL‐based algorithm, a particle swarm optimization (PSO) technique is implemented to estimate the value of the proportional–integral (PI) gains. The numerical values acquired by the PSO algorithm are chosen as PI gains, thereby boosting the DC and AC bus voltages at reference level at nearly six iterations within a few cycles. Detailed analysis of UPQC‐S is done through MATLAB and its interface with a Xilinx Spartan‐3 FPGA XC3S5000 board under OP‐5142 system for compensation of various current‐ and voltage‐based PQ issues through ECCF‐PLL with optimized PI controller gains. The performance of developed system is tested under transient and steady‐state conditions. [ABSTRACT FROM AUTHOR]

This paper presents a new detection method of fault and partial shading condition (PSC) in a photovoltaic (PV) domestic network, considering maximum power point tracking (MPPT). The MPPT has been executed by employing a boost converter using particle swarm optimization (PSO) technique. The system is composed of two photovoltaic arrays. Each PV array contains three panels connected in series, including distinct MPPT. The PSC detection exploits the neighboring PV system data. This suggested innovative algorithm is proficient in detecting these subjects: (a) fault, (b) partial shading condition, (c) solar panel (d) panel's relevant bypass diode failure, (d) converter failure alongside specifying the failed semiconductor, and (e) PV disconnection failure. The simulation process has been implemented using MATLAB/Simulink software. To this end, the proposed method was investigated experimentally using two 250 W PV solar set under various PSCs and faults. A data exchange link is used to implement an integrated management system. The Zigbee protocol was also chosen to data exchange of converters. The results validated the applicability and practicality of this algorithm in domestic PV systems. [ABSTRACT FROM AUTHOR]

Most network pruning methods rely on rule-of-thumb for human experts to prune the unimportant channels. This is time-consuming and can lead to suboptimal pruning. In this paper, we propose an effective SuperPruner algorithm, which aims to find optimal pruned structure instead of pruning unimportant channels. We first train a VerifyNet, a kind of super network, which is able to roughly evaluate the performance of any given network structure. The particle swarm optimization algorithm is then used to search for optimal network structure. Lastly, the weights in the VerifyNet are used as the initial weights of the optimal pruned structure to make fine-tuning. VerifyNet is a network performance evaluation; our algorithm can quickly prune the network under any hardware constraints. Our algorithm can be applied in multiple fields such as object recognition and semantic segmentation. Extensive experiment results demonstrate the effectiveness of SuperPruner. For example, on CIFAR-10, the pruned VGG16 achieves 93.18% Top-1 accuracy and reduces 74.19% of FLOPs and 89.25% of parameters. Compared with state-of-the-art methods, our algorithm can achieve higher pruned ratio with less accuracy cost. [ABSTRACT FROM AUTHOR]

The sparrow search algorithm is a new type of swarm intelligence optimization algorithm with better effect, but it still has shortcomings such as easy to fall into local optimality and large randomness. In order to solve these problems, this paper proposes an adaptive spiral flying sparrow search algorithm (ASFSSA), which reduces the probability of getting stuck into local optimum, has stronger optimization ability than other algorithms, and also finds the shortest and more stable path in robot path planning. First, the tent mapping based on random variables is used to initialize the population, which makes the individual position distribution more uniform, enlarges the workspace, and improves the diversity of the population. Then, in the discoverer stage, the adaptive weight strategy is integrated with Levy flight mechanism, and the fusion search method becomes extensive and flexible. Finally, in the follower stage, a variable spiral search strategy is used to make the search scope of the algorithm more detailed and increase the search accuracy. The effectiveness of the improved algorithm ASFSSA is verified by 18 standard test functions. At the same time, ASFSSA is applied to robot path planning. The feasibility and practicability of ASFSSA are verified by comparing the algorithms in the raster map planning routes of two models. [ABSTRACT FROM AUTHOR]

Summary: This paper proposes a novel methodology for installing a converter station at optimal AC bus in a hybrid AC‐DC system using a multi‐objective unified optimal power flow (MO‐UOPF). The MO‐UOPF model is developed here for the voltage source converter‐high voltage direct current (VSC‐HVDC) network. The various techno‐economic objectives are considered for the OPF problem: minimizing total generation cost, AC/DC transmission line losses with converter station losses, enhancement of voltage stability improvement, and reduction in CO2 gas emissions. The particle swarm optimization (PSO) algorithm has proven its superiority over many meta‐heuristic algorithms for solving the multi‐objective optimization problem. Also, various improved versions of PSO have been developed since its inception. Here, the MO‐UOPF problem is solved using a modified multi‐objective particle swarm optimization (MO‐PSO) technique with a simultaneous approach. The proposed methodology is analyzed with modified 5‐bus and IEEE‐30 bus test systems with different configurations for two‐terminal point‐to‐point transmission. [ABSTRACT FROM AUTHOR]

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment. [ABSTRACT FROM AUTHOR]

Aiming at the inherent problems of swarm intelligence algorithm, such as falling into local extremum in early stage and low precision in later stage, this paper proposes an improved sparrow search algorithm (ISSA). Firstly, we introduce the idea of flight behavior in the bird swarm algorithm into SSA to keep the diversity of the population and reduce the probability of falling into local optimum; Secondly, we creatively introduce the idea of crossover and mutation in genetic algorithm into SSA to get better next-generation population. These two improvements not only keep the diversity of the population at all times but also make up for the defect that the sparrow search algorithm is easy to fall into local optimum at the end of the iteration. The optimization ability of the improved SSA is greatly improved. [ABSTRACT FROM AUTHOR]

The advanced analysis and research methods of big data will provide theoretical support for the integration of athletes' talent training. The advanced technological methods of big data will also give full play to the advantages of tapping the potential of talents and actively improve the success rate of grassroots young athletes. This paper proposes an improved Adaptive Particle Swarm Optimization (APSO) algorithm for the optimization of radial basis function (RBF) neural network parameters. The basic structure of RBF neural network is introduced, and the influence of parameters on the performance of RBF neural network is analyzed. The optimization method of RBF neural network parameters is analyzed, and Particle Swarm Optimization (PSO) algorithm is selected as the parameter optimization method of RBF neural network. In addition, an improved APSO algorithm is proposed according to the advantages and disadvantages of PSO and compared with other PSO algorithms. Experimental results show that the improved PSO algorithm has better accuracy. The improved PSO algorithm is applied to the parameter optimization of RBF neural network, and the experimental results prove the superiority of the proposed method. By weighting the second-level indicators, the weights of the second-level indicators of athletes' competitive ability are in order of skill, athletic quality, psychological ability, and artistic expression. Skills are the main factors that determine the level of competitive ability. Sports quality and psychological ability are important guarantees for supporting the normal performance of skills. Artistic expressiveness is a supplementary factor for competitive ability. The various elements cooperate with each other and interact with each other. The indicators do not exist alone but cooperate with each other to support the formation of the entire athletic ability system. In the content of the competitive ability index of excellent athletes, technical ability is the core, and sports quality, psychological ability, and artistic performance ability ultimately exist to serve the improvement of technical ability. The competition scores of the 100 athletes counted in this article are all above 9.0 points. The difference between APSO-RBF's action quality scores of 100 athletes and the real value is less than 3%. In terms of movement difficulty, the APSO-RBF evaluated athletes' scores are close to 1.65 points, which is basically the same as the real value. [ABSTRACT FROM AUTHOR]

Parameter tuning of PID controller for liquid level control of beer filling machine was studied in this paper, which can meet the demand of accurate controlling in beer production and improve the rapidity under the same conditions. Firstly, an improved genetic algorithm was proposed which has been verified by eight kinds of test functions. Simulation results revealed that, in comparation with other modified particle swarm optimization algorithm and modified genetic algorithm, the algorithm proposed in this work is not only capable to improve the convergence speed and precision under the same experimental conditions but also to improve the probability to converge to the optimal value. Finally, the proposed algorithm was applied to the parameter tuning of the PID controller of beer filling machine for liquid level control. Superior property had been obtained, which implied an effective improvement in the rapidity with the premise of steady-state error exclusion. [ABSTRACT FROM AUTHOR]

Feature selection is an essential step in the preprocessing of data in pattern recognition and data mining. Nowadays, the feature selection problem as an optimization problem can be solved with nature-inspired algorithm. In this paper, we propose an efficient feature selection method based on the cuckoo search algorithm called CBCSEM. The proposed method avoids the premature convergence of traditional methods and the tendency to fall into local optima, and this efficient method is attributed to three aspects. Firstly, the chaotic map increases the diversity of the initialization of the algorithm and lays the foundation for its convergence. Then, the proposed two-population elite preservation strategy can find the attractive one of each generation and preserve it. Finally, Lévy flight is developed to update the position of a cuckoo, and the proposed uniform mutation strategy avoids the trouble that the search space is too large for the convergence of the algorithm due to Lévy flight and improves the algorithm exploitation ability. The experimental results on several real UCI datasets show that the proposed method is competitive in comparison with other feature selection algorithms. [ABSTRACT FROM AUTHOR]