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]

In order to improve the autonomy and intelligence of group animation behavior, this paper proposes a particle swarm optimization algorithm for automatic control of group animation behavior. After the user inputs the group animation behavior construction target, the individual path is planned according to the fixed behavior rules, and the particle swarm optimization algorithm and the improved artificial fish swarm optimization algorithm are used to select the optimal action for the individual in the group animation according to the top-down control process. The experimental results show that after the PSO converges to the global optimal solution, the evolution times of the PSO converge to the global optimal solution again when the surrounding environment changes 10 times. The population diversity of particle swarm optimization algorithm is obviously better than those of the other two algorithms in the process of automatically controlling the movement of individuals to the circle and to the stand in the crowd animation. Compared with the original algorithm AFSA, the improved artificial fish swarm algorithm proposed in this paper is easier to obtain the global optimal value, and the optimization speed is also improved. In conclusion, the example analysis verifies that the algorithm can effectively realize the automatic control of group animation behavior and has high convergence speed and high autonomy. [ABSTRACT FROM AUTHOR]

Based on the theory and application, this paper discusses the optimization of art image segmentation algorithm based on FFNN (Feed Forward Neural Network). In this paper, residual units are used in the corresponding stages of encoder and decoder, and feature information of several convolution layers in each convolution stage of encoder is extracted at the same time. And the feature pyramid module is used to extract multiscale features from the feature map of the last convolution stage in the encoder. Finally, pixel by pixel additions combine the previously mentioned feature information into the corresponding layer of the decoder. Additionally, an improved weight adaptive algorithm based on feature preservation is suggested in this paper, which addresses the issue that the conventional image segmentation algorithm is noise-sensitive. The adaptive connection weight mechanism is also introduced. The accuracy and recall rates of this optimization algorithm can both reach 96.574%, according to the results of 50% cross-validation. All the segmentation performance evaluation indexes of this algorithm are higher than the existing main algorithms. Moreover, the algorithm takes a short time, does not need too much manual intervention, and can effectively segment artistic images. The optimization algorithm in this paper has certain reference significance for the related research of artistic image segmentation. [ABSTRACT FROM AUTHOR]

With regard to large dimensions of contemporary data sets and restricted computational time of intelligent systems, reducing the dimensions of data sets is necessary. Feature selection is a practical way to remove a set of redundant, irrelevant, and noisy features. In this way, the speed of decision‐making procedure will be increased while the accuracy of decisions will be retained. To this end, numerous attentions have been attracted to the topic and consequently, extensive range of methods has been proposed. Regarding the goals of the feature selection concept, the proposed algorithms in this field must be fast and accurate. Therefore, this paper proposes a light meanwhile accurate algorithm to fulfill the mentioned goals. The presented algorithm takes the speed advantage of Whale Optimization Algorithm (WOA) to propose a novel feature selection method for intelligent systems. Moreover, to reach the goal of accuracy, the proposed strategy considers three important fitness objectives, namely, the number of selected features, the accuracy of classification, and information gain. The proposed scheme considers an accurate multiobjective fitness function instead of manipulating the basic algorithm. The reason is that improving the basic algorithms, WOA in our case, may lead to loading more computational complexity. Also, to make the proposed algorithm as light as possible, this paper considers K‐nearest neighbor algorithm as the main classifier. The proposed light feature selection algorithm is run on different data sets. Experimental results prove that this algorithm is able to reduce the number of features meanwhile it retains, and in some cases even increases, the accuracy of classification. [ABSTRACT FROM AUTHOR]

Feature selection provides the optimal subset of features for data mining models. However, current feature selection methods for high-dimensional data also require a better balance between feature subset quality and computational cost. In this paper, an efficient hybrid feature selection method (HFIA) based on artificial immune algorithm optimization is proposed to solve the feature selection problem of high-dimensional data. The algorithm combines filter algorithms and improves clone selection algorithms to explore the feature space of high-dimensional data. According to the target requirements of feature selection, combined with biological research results, this method introduces the lethal mutation mechanism and the Cauchy operator to improve the search performance of the algorithm. Moreover, the adaptive adjustment factor is introduced in the mutation and update phases of the algorithm. The effective combination of these mechanisms enables the algorithm to obtain a better search ability and lower computational costs. Experimental comparisons with 19 state-of-the-art feature selection methods are conducted on 25 high-dimensional benchmark datasets. The results show that the feature reduction rate for all datasets is above 99%, and the performance improvement for the classifier is between 5% and 48.33%. Compared with the five classical filtering feature selection methods, the computational cost of HFIA is lower than the two of them, and it is far better than these five algorithms in terms of the feature reduction rate and classification accuracy improvement. Compared with the 14 hybrid feature selection methods reported in the latest literature, the average winning rates in terms of classification accuracy, feature reduction rate, and computational cost are 85.83%, 88.33%, and 96.67%, respectively. [ABSTRACT FROM AUTHOR]

Considering that in the process of job scheduling, the cluster load should be prebalanced rather than remedied when the load is seriously unbalanced; therefore, in this paper, the task scheduling flow of the Hadoop cluster is analyzed deeply. On the Hadoop platform, a self-dividing algorithm is proposed for load balancing. An intelligent optimization algorithm is used to solve load balance. A dynamic feedback load balancing scheduling method is proposed from the point of view of task scheduling. In order to solve the shortcoming of the fair scheduling algorithm, this paper proposes two ways to improve the resource utilization and overall performance of Hadoop. When the mapping task is completed and the tasks to be reduced are assigned, the task assignment is based on the performance of the nodes to be reduced. It gives full play to the advantages of the ant colony algorithm and the hive colony algorithm so that the fusion algorithm can better deal with load balance. Then, three existing scheduling algorithms are introduced in detail: single queue scheduling, capacity scheduling, and fair scheduling. On this basis, an improved task scheduling strategy based on genetic algorithm is proposed to allocate and execute application tasks to reduce task completion time. The experiment verifies the effectiveness of the algorithm. The LBNP algorithm greatly improves the efficiency of reducing task execution and job execution. The delay capacity scheduling algorithm can ensure that most tasks can achieve localization scheduling, improve resource utilization, improve load balance, and speed up job completion time. [ABSTRACT FROM AUTHOR]

In order to improve the effect of agricultural machinery task scheduling, this paper starts from the perspective of multiobjective optimization to achieve task scheduling based on multiobjective particle swarm optimization algorithm. The position of each particle is a combination of resource options for each construction activity, and the displacement range and speed range of the particles are determined. Moreover, this paper uses the method of introducing an external storage library to store the current noninferior solutions and uses the adaptive grid method and the roulette selection method to select the global optimal solution of the particles. In addition, this paper proposes a task scheduling algorithm suitable for modern agricultural machinery based on the actual needs of current agricultural machinery task scheduling. The experimental results show that the agricultural machinery task scheduling algorithm based on multiobjective optimization proposed in this paper has a good agricultural machinery task scheduling effect and meets the basic purpose of optimizing the algorithm in this paper. [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]

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation. [ABSTRACT FROM AUTHOR]

In this paper, a new human resource scheduling algorithm is proposed based on the optimization simulation of the human resource scheduling algorithm to find the most suitable human resource allocation scheme for different regions. A simulation system for human resource allocation is proposed, which integrates the scheduling algorithm of this paper and conducts simulation experiments using the historical data of enterprise problems in each region collected in a smart city. The simulation experiment proves that the dispatching algorithm in this paper is more reasonable than the current dispatching algorithm, and the relationship between enterprise problems and the number of employees is also found, and finally, the simulation system in this paper is proved to be stable through large-scale simulation experiment. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem that the radar detection system is difficult to detect the "low, small, slow" UAV, the high-performance computing early warning neural network is used to recognize the air UAV in real time and extract the target category and image space location information; the PSO algorithm is used to optimize the parameters of the anti-UAV to ensure that the anti-UAV not only relies on factors but also fully combines the dependence of the visual field factor to quickly obtain the optimal solution through analyzing the high-performance computing early warning neural network in this paper. This algorithm is used to initialize the anti-UAV resources and improve the global optimization capability of the algorithm proposed in this paper. Finally, the experimental results show that the proposed PSO algorithm has better high-performance computing early warning performance to meet the actual needs of network high-performance computing early-warning neural networks. [ABSTRACT FROM AUTHOR]

Attribute reduction is a popular topic in research on rough sets. In the classical model, much progress has been made in the study of the attribute reduction of indiscernibility and discernibility relations. To enhance the fault tolerance of the model, concepts of both indiscernibility and discernibility relations involving uncertain or imprecise information are proposed in this paper. The attribute reductions of the relative β -indiscernibility relation and relative β -discernibility relation and their algorithms are proposed. When the precision satisfies certain conditions, the reduction of two relation concepts can be converted into a positive region reduction. Therefore, the discernibility matrix is used to construct the reductions of the two relation concepts and the positive region. Furthermore, the corresponding algorithm of the relative β -indiscernibility (discernibility) relation reduction can be optimized when the precision is greater than 0.5, and this is used to develop an optimization algorithm that constructs the discernibility matrix more efficiently. Experiments show the feasibility of the two relation reduction algorithms. More importantly, the reduction algorithms of the two relations and the optimization algorithm are compared to demonstrate the feasibility of the optimization algorithm proposed in this paper. [ABSTRACT FROM AUTHOR]

Most of the current algorithms for solving distributed online optimization problems are based on the first-order method, which are simple in computation but slow in convergence. Newton's algorithm with fast convergence speed needs to calculate the Hessian matrix and its inverse, leading to computationally complex. A distributed online optimization algorithm based on Newton's step is proposed in this paper, which constructs a positive definite matrix by using the first-order information of the objective function to replace the inverse of the Hessian matrix in Newton's method. The convergence of the algorithm is proved theoretically and the regret bound of the algorithm is obtained. Finally, numerical experiments are used to verify the feasibility and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm has an efficient performance on practical problems, compared to several existing gradient descent algorithms. [ABSTRACT FROM AUTHOR]

Since entering the era of big data, the degree of information sharing is getting higher and higher; the information exchange is becoming more and more convenient, but at the same time, personal information is also easy to be exposed to the network environment, if it is used by criminals to lead to information leakage, and then bring certain risks. Therefore, it is in the information age and do a good job of network information security and confidentiality. At present, the security and secrecy of network information are mainly realized by cryptography. Public key cryptography can encrypt information and ensure the security of information transmission, so it is widely used in the contemporary society. At present, elliptic curve encryption is highly respected in the research field of public key cryptosystem. Elliptic curve encryption is divided into two main points, multiplication and inversion, respectively. Through the comparison of these two algorithms, it can be found that there are several choices if the main research objective is to save time, and the Euclidean extension method is mainly discussed in this paper. In other words, more efficient algorithms are used in the hardware implementation process, and a variety of algorithms can be used instead of a single curve algorithm. In this process, we can find the special features of upper level operation and bottom level finite operation. The upper level operation is KP operation, while the bottom level operation is fast calculation of four kinds of K in finite field operation, and finally realize FPGA algorithm. With the help of Quartus ii developed by predecessors, the upper and lower operations of elliptic curve are carried out using VHDL language. Combined ANXIX9.62 in the elliptic curve of each module to test, so as to ensure the accuracy of the data, reduces the error. According to the test results, the designed chip can efficiently complete the elliptic curve encryption system in the whole process. And the average KP operation time can reach 15.15 ms at 20 MHz frequency. At the same time, the chip can complete the operation on ECC public key with any variable curve in F domain less than 256. Therefore, this chip is a high-speed elliptic curve cryptographic chip with optional system parameters. Based on this, this article on the elliptic curve encryption algorithm based on FPGA hardware implementation of system design, from the view of mathematical study analysis, was carried out on the elliptic curve cryptosystem, according to the above two big difficulty, namely, the polynomial of GF(2), the finite field multiplication, and inversion; there will be a detailed studies of discussion, through software comparison to find the differences between different software, especially the software implementation performance level. In addition, it will also focus on the design of elliptic curve algorithm PGA, so as to explore the solution of the algorithm hardware. [ABSTRACT FROM AUTHOR]

Recent advancements in computer science include some optimization models that have been developed and used in real applications. Some metaheuristic search/optimization algorithms have been tested to obtain optimal solutions to speed controller applications in self-driving cars. Some metaheuristic algorithms are based on social behaviour, resulting in several search models, functions, and parameters, and thus algorithm-specific strengths and weaknesses. The present paper proposes a fitness function on the basis of the mathematical description of proportional integrative derivate controllers showing that mean square error is not always the best measure when looking for a solution to the problem. The fitness developed in this paper contains features and equations from the mathematical background of proportional integrative derivative controllers to calculate the best performance of the system. Such results are applied to quantitatively evaluate the performance of twenty-one optimization algorithms. Furthermore, improved versions of the fitness function are considered, in order to investigate which aspects are enhanced by applying the optimization algorithms. Results show that the right fitness function is a key point to get a good performance, regardless of the chosen algorithm. The aim of this paper is to present a novel objective function to carry out optimizations of the gains of a PID controller, using several computational intelligence techniques to perform the optimizations. The result of these optimizations will demonstrate the improved efficiency of the selected control schema. [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]

At present, there are some problems in the process of human motion recognition, such as poor timeliness and low fault tolerance rate. How to effectively identify the motion process accurately has become a hot spot in the optimization system. In the existing research studies, the recognition accuracy is not very good and the response time is long. To end this issue, the paper proposed an information processing system and optimization method of human motion recognition based on the GA-BP neural network algorithm. Firstly, a human motion recognition system based on dynamic capture recognition technology is designed, which realizes the recognition of motion information from common postures such as action span, speed change, motion trajectory, and other aspects in the process of human motion. Secondly, the proposed algorithm is used to comprehensively analyse and evaluate the motion state. Finally, experiments are designed to verify and analyse the results. Compared to some baseline methods in human motion recognition information systems, the system in this paper based on the GA-BP neural network algorithm has the advantages of higher data accuracy and response speed, which can quickly and accurately identify the muscle group change in the process of human motion, and it can also provide customized motion suggestions based on the results. [ABSTRACT FROM AUTHOR]

This paper proposed a method based on the SBAS-InSAR and gray wolf optimization algorithm aiming at the time-consuming and laborious defects of the traditional method used to obtain the expected parameters of the probability integral method and the shortcomings of the InSAR technology in the field of large gradient deformation detection in the mining area. The fitness function of the algorithm was established based on the geometric relationship between the radar side imaging and the three-dimensional model of the probability integral method. The stable sinking point of the settlement boundary obtained by SBAS-InSAR was used as the input value for the calculation of the predicted parameters of the probability integral method. Firstly, the simulation experiment was employed for the simulation of the direction of the InSAR line of sight combined with the geological mining conditions of the assumed working face, thereby obtaining the probability integral prediction parameters of the working face. Consequently, the maximum relative error of q , b , tanβ, and θ 0 does not exceed 8%, and that of S 1 , S 2 , S 3 , and S 4 does not exceed 35.5% (low parameter sensitivity). The error of the LOS-direction deformation fitting is 0.076 m, which meets the tolerance requirements, and the result is trustworthy. At last, the parameter finding method is applied to the engineering example, that is, the 112201 working face of Xiaobaodang Coal Mine in the northern Shaanxi mining area. The settlement value of the stable boundary point is obtained based on the SBAS-InSAR results, which is substituted into the fitness function. And the GWO optimization algorithm is used for optimization and parameter finding; the probability integral expected parameters of the working face are calculated as q = 0.63 , b = 0.37 , tan β = 2.76 , θ 0 = 83.94 , S 1 = − 36.34 m , S 2 = 26.69 m , S 3 = − 45.64 m , and S 4 = 39.62 m. Substitute the obtained parameters into the probability integral model for the prediction of the vertical and horizontal displacements of the working face, and verify its accuracy with the GPS measured data. The results showed that the maximum absolute error of vertical displacement reached 116 mm, the median error was 63 mm, and the maximum absolute error of north-south horizontal movement reached 56 mm; meanwhile, the median error was 23 mm, the maximum absolute error of east-west horizontal movement reached 61 mm, and the median error was 29 mm; all the above parameters are within the tolerance range, indicating that the method for the calculation of probability integral parameters proposed in this paper is applicable in actual engineering. [ABSTRACT FROM AUTHOR]

Summary: The continuous increase of the distributed energy resources (DERs) penetration levels leads to voltage stability problems in the distribution system. One of the approaches for the mentioned emerging challenge is the proper placement of automatic voltage regulators (AVRs). This paper investigates the optimal placement and sizing of AVRs in a distribution network by presenting a new modification of the teaching‐learning‐based optimization (TLBO) algorithm. The objective functions consist of minimizing the distribution system voltage deviation, energy generation cost, and electrical losses. The modification improves the convergence velocity and accuracy of the TLBO algorithm using the combination of mutation technique and quasi‐opposition‐based‐learning concept. This paper compares the performance of the proposed algorithm with other famous evolutionary algorithms. The test distribution system contains installed DERs that work more efficiently after the placement of AVRs based on the mentioned objective functions by the proposed optimization algorithm. The simulation results display the best optimization algorithms for AVRs placement with a significant level of less than 0.10 (ie, probability‐value). The proposed multiobjective optimization algorithm's considerable merit is the accuracy and convergence velocity in solving this specific optimization problem. [ABSTRACT FROM AUTHOR]

With the continuous development of China's cultural industry, people's health has become one of the topics of the highest concern. Therefore, all the application models of physical health test data in the actual analysis have become the current research focus and trend direction of healthy constitution. This paper summarizes the significant problems in the analysis of physical health test data, through the comprehensive analysis and investigation of physical health test data, combined with the measurement of the test indicators, through the analysis and processing system of youth physical health data, the use process of national youth group physical health standard data management software, and decision tree intelligent algorithm in physical health. The research steps of test data analysis and application model summarize the application characteristics of physical health test data in the application process. Based on this, a decision tree intelligent algorithm is proposed, and the corresponding functions and optimization formulas of the algorithm are substituted. In the process of actual sample checking calculation, each weight range and corresponding errors are inferred and analyzed by combining examples. This paper summarizes the application model and optimization model of health test data analysis based on decision tree intelligent algorithm. Through the repeated test of the research data, the feasible area and application scope of the algorithm are obtained, and the practical optimization scheme and application ideas under the algorithm are obtained. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things has developed rapidly in people's lives. This brand-new technology is flooding people's lives and widely used in many fields, such as medical field, science and technology field, and industry and agriculture field. As a modern technology, the Internet of Things has many characteristics of low power consumption and multifunction, and it also has the characteristics of data-aware computing. This is the characteristic of this new product. In people's daily life, the Internet of Things is also closely related to people's daily life. In the tourism industry, the Internet of Things can make the best use of everything and give full play to its various advantages as much as possible. The Internet of Things can perceive cross-modal tourism routes. So here, this paper summarizes various algorithms recommended by the Internet of Things for this tourist route and works out the experimental data methods of these algorithms for cross-modal tourism route recommendation. The proposed algorithm is verified by data simulation, compared with related algorithms. We analyze and summarize the simulation results. At present, there is no comparative analysis of the performance of ant colony algorithm, genetic algorithm, and its optimization algorithm in tourism route recommendation. On the basis of crawling the tourism data in the Internet, this paper applies ant colony algorithm, genetic algorithm, max–min optimization ant colony algorithm, and hybrid ant colony algorithm based on greedy solution to tourism route recommendation and evaluates and compares the algorithms from three aspects: average evaluation score, optimal evaluation score, and algorithm time. Experimental results show that the max–min optimization ant colony algorithm and the hybrid ant colony algorithm based on greedy solution can be effectively applied to automated tourist route recommendation. [ABSTRACT FROM AUTHOR]

Artificial intelligence technology has brought tremendous changes to human life and production methods. Mobile robots, UAVs, and autonomous driving technology have gradually entered people's daily life. As a typical issue for a mobile robot, the planning of an optimal mobile path is very important, especially in the military and emergency rescue. In order to ensure the efficiency of operation and the accuracy of the path, it is crucial for the robot to find the optimal path quickly and accurately. This paper discusses a new method and MP-SAPSO algorithm for addressing the issue of path planning based on the PSO algorithm by combining particle swarm optimization (PSO) algorithm with the simulated annealing (SA) algorithm and mutation particle and adjusting the parameters. The MP-SAPSO algorithm improves the accuracy of path planning and the efficiency of robot operation. The experiment also demonstrates that the MP-SAPSO algorithm can be used to effectively address path planning issue of mobile robots. [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]

The existing automatic parking algorithms often neglect the unknown obstacles in the parking environment, which causes a hidden danger to the safety of the automatic parking system. Therefore, this paper proposes parking space detection and path planning based on the VIDAR method (vision-IMU-based detection and range method) to solve the problem. In the parking space detection stage, the generalized obstacles are detected based on VIDAR to determine the obstacle areas, and then parking lines are detected by the Hough transform to determine the empty parking space. Compared with the parking detection method based on YOLO v5, the experimental results demonstrate that the proposed method has higher accuracy in complex parking environments with unknown obstacles. In the path planning stage, the path optimization algorithm of the A ∗ algorithm combined with the Bezier curve is used to generate smooth curves, and the environmental information is updated in real time based on VIDAR. The simulation results show that the method can make the vehicle efficiently avoid the obstacles and generate a smooth path in a dynamic parking environment, which can well meet the safety and stationarity of the parking requirements. [ABSTRACT FROM AUTHOR]

We present a semiglobal stereo matching technique that combines enhanced census transform with unidirectional dynamic programming optimization. This method not only improves matching accuracy but also substantially reduces noise interference by using the 8-domain pixel median instead of the centre pixel in the standard technique and optimizing the initial matching generation value with the 8-path aggregation optimization algorithm. The experimental findings show that this suggested strategy efficiently avoids interference produced by various noises and reduces the false matching rate significantly. [ABSTRACT FROM AUTHOR]

Fog computing domain plays a prominent role in supporting time-delicate applications, which are associated with smart Internet of Things (IoT) services, like smart healthcare and smart city. However, cloud computing is a capable standard for IoT in data processing owing to the high latency restriction of the cloud, and it is incapable of satisfying needs for time-sensitive applications. The resource provisioning and allocation process in fog-cloud structure considers dynamic alternations in user necessities, and also restricted access resources in fog devices are more challenging. The global adoption of IoT-driven applications has led to the rise of fog computing structure, which permits perfect connection for mobile edge and cloud resources. The effectual scheduling of application tasks in fog environments is a challenging task because of resource heterogeneity, stochastic behaviours, network hierarchy, controlled resource abilities, and mobility elements in IoT. The deadline is the most significant challenge in the fog computing structure due to the dynamic variations in user requirement parameters. In this paper, Mayfly Taylor Optimisation Algorithm (MTOA) is developed for dynamic scheduling in the fog-cloud computing model. The developed MTOA-based Deep Q-Network (DQN) showed better performance with energy consumption, service level agreement (SLA), and computation cost of 0.0162, 0.0114, and 0.0855, respectively. [ABSTRACT FROM AUTHOR]

In this article, a novel methodology has been created based on optimized fuzzy PI controller using position control optimization (PCO). This proposed PCO algorithm ensures better control of brushless direct current motor (BLDCM) in order to reduce steady-state error and oscillation as well as improve the system response by optimizing the speed and position of rotor. The suitability of this technique has been simulated in different stages, so as to infer the optimization in results. The main motivation of this paper is to get better efficiency and optimum response from BLDCM, by comparing its performance characteristics with existing methods. The detailed investigation research through simulation is carried out using MATLAB/Simulink. However, in order to obtain well-defined results, the PCO technique was applied and the performance obtained was highly optimized than previously applied techniques. Through the simulations, the proposed approach can outperform the existing approaches such as PSO and moth-flame algorithm (MFA). [ABSTRACT FROM AUTHOR]

In intelligent warehouse, the problem of transporting goods in intelligent warehouse is becoming increasingly complex, and the traditional way of automatically guiding vehicles (AGVs) is inefficient, so automated robot systems are introduced into intelligent warehouses. In this paper, a task assignment model for robots is presented with the transportation problem of robots in intelligent warehouse as the research background. To solve the robot task assignment problem in intelligent warehouse, a novel Pareto-based multiobjective optimization algorithm (MOEA) is proposed, and the aggregation function is invoked to replace the crowding distance; the brain storm operator is used for crossover and mutation. Finally, the ability of the algorithm to solve the benchmark test problem suite and real-world problems is experimentally confirmed. [ABSTRACT FROM AUTHOR]

In the financial industry, it is of great significance to study the multiobjective portfolio optimization for obtaining a reasonable investment strategy. This paper designs the financial portfolio scheme based on the multiobjective optimization algorithm that is based on the framework of the NSGA-II algorithm. In order to introduce convergence information, aiming at the actual problem of the portfolio, the mixed individual coding mechanism with asset information expands the application of the multiobjective evolutionary algorithm in portfolio optimization. The portfolio scheme obtained is effective, which is helpful to improve the decision-making efficiency of financial investors and enriches the application of modern financial theory. [ABSTRACT FROM AUTHOR]

Strong ground clutter echoes make it difficult to detect low-altitude slow-speed small (LSS) targets. To suppress ground clutter effectively in LSS target detection, a robust transmit beamforming algorithm has been proposed in this paper. Sidelobes in the ground side can be cut down, with the excess energy concentrated on the air side, which would be cleaner and simpler. The objective function is a second-order cone programming problem and can be solved by the convex optimization algorithm. With the consideration of taking full advantage of transmit power, the weight vector is further processed under the unimodular constraint. Numerical experiments are carried out to demonstrate the validity and superiority of the proposed method. [ABSTRACT FROM AUTHOR]

While the modern communication system, embedded system, and sensor technology have been widely used at the moment, the wireless sensor network (WSN) composed of microdistributed sensors is favored due to its relatively excellent communication interaction, real-time computing, and sensing capabilities. Because GPS positioning technology cannot meet the needs of indoor positioning, positioning based on WSN has become the better option for indoor localization. In the field of WSN indoor positioning, how to cope with the impact of NLOS error on positioning is still a big problem to be solved. In order to mitigate the influence of NLOS errors, a Neural Network Modified Multiple Filter Localization (NNMML) algorithm is proposed in this paper. In this algorithm, LOS and NLOS cases are distinguished firstly. Then, KF and UKF are applied in the LOS case and the NLOS case, respectively, and appropriate grouping processing is carried out for NLOS data. Finally, the positioning results after multiple filtering are corrected by neural network. The simulation results illustrate that the location accuracy of NNMML algorithm is better than that of KF, EKF, UKF, and the version without neural network correction. It also shows that NNMML is suitable for the situation with large NLOS error. [ABSTRACT FROM AUTHOR]

Summary: This paper addresses the allocation of a hybrid system that includes PV‐DG and DSTATCOM. The planning problem considers the variations of load demand and solar irradiance under deterministic and probabilistic conditions. An efficient optimization algorithm called MPA is implemented to assign the optimal placement and ratings of the hybrid PV‐DG and DSTATCOM. The considered objective function is a multi‐objective function that includes the annual cost reduction, improvement of voltage profiles, and system stability improvement. The assessment is accomplished with the inclusion of a single and two‐hybrid system on a large 94‐bus system. For validating the effectiveness of the MPA, the yielded results are compared with the PSO, which is considered a commonly used algorithm. In deterministic conditions, the hourly variations of the load demand and solar radiation are considered in four yearly seasons, while in probabilistic conditions, 3 years of hourly historical data of solar irradiance and load demand are utilized to describe the uncertainties of the load demand and solar irradiance. The simulation results demonstrate that the optimal inclusion of a single‐hybrid PV‐DG and DSTATCOM system can enhance the system's technical performance (the voltage profile, the voltage stability) and enhance the economic scheme (total annual cost reduction). In addition, the inclusion of two‐hybrid systems is superior compared with the inclusion of a single‐hybrid system in terms of the considered objective functions, as well as the proposed technique is more efficient for solving the allocation problem of the hybrid system. [ABSTRACT FROM AUTHOR]

Many optimization algorithms have been applied to solve high-dimensional instances of the 0-1 knapsack problem. However, these algorithms often fall into a local optimization trap and thus fail to obtain the global optimal solutions. To circumvent this shortcoming, a hybrid harmony search algorithm with distribution estimation is proposed in this paper. A few important features of the proposed algorithm are as follows: (i) the idea of probability distribution estimation is employed to design the adaptive search strategy, (ii) a fixed improvisation process is presented to improve the algorithm searching ability, (iii) a new method of initialization is used to ensure that the initialization is feasible harmony and (iv) an improved remediation approach is proposed to effectively repair the infeasible solutions. To assess the effectiveness of the proposed algorithm, some experiments are carried out. The experimental results reveal that the proposed algorithm is a reliable and promising alternative for solving the 0-1 knapsack problem. [ABSTRACT FROM AUTHOR]

Community structure detection in a complex network structure and function is used to understand network relations and find its evolution rule; monitoring and forecasting its evolution behavior have an important theoretical significance; in the epidemic monitoring, network public opinion analysis, recommendation, advertising push and combat terrorism, and safeguard national security, it has wide application prospect. A label propagation algorithm is one of the popular algorithms for community detection in recent years; the community detection algorithm based on tags that spread the biggest advantage is the simple algorithm logic, relative to the module of optimization algorithm, convergence speed is very fast, the clustering process without any optimization function, and the initialization before do not need to specify the number of complex network community. However, the algorithm has some problems such as unstable partitioning results and strong randomness. To solve this problem, this paper proposes an unsupervised label propagation community detection algorithm based on density peak. The proposed algorithm first introduces the density peak to find the clustering center, first determines the prototype of the community, and then fixes the number of communities and the clustering center of the complex network, and then uses the label propagation algorithm to detect the community, which improves the accuracy and robustness of community discovery, reduces the number of iterations, and accelerates the formation of the community. Finally, experiments on synthetic network and real network data sets are carried out with the proposed algorithm, and the results show that the proposed method has better performance. [ABSTRACT FROM AUTHOR]

It is well known that we, as human beings, are prone to a variety of undesirable emotions such as excitement, boredom, and fear, all of which are induced by varying degrees of negative states. In this paper, we designed an emotion-evoking experiment to induce calm, excited, bored, and fearful emotions, as well as low, moderate, and high levels of tension. Based on the six physiological signals such as heart rate and respiration rate of the subjects in these emotion states, feature extraction was performed after removing the baseline preprocessing, combined with particle swarm optimisation algorithm for feature selection, and the k-nearest neighbour algorithm was used to classify the different emotion and tension levels in the undesirable states. By comparing the results of several sets of experiments, we found that with baseline removal and particle swarm feature selection optimisation, our experimental results using k-nearest neighbour classification showed a significant improvement in recognition accuracy compared to the traditional k-nearest neighbour algorithm, which indicates that the proposed method has better recognition results. [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]

The security of wireless information transmission in large-scale multi-input and multioutput (MIMO) is the focus of research in wireless communication. Recently, a new artificial noise—SCO-AN which shows no orthogonality to the channel, is proposed to overcome the shortcomings of traditional artificial noise. In the previous research, the optimization function of SCO-AN is not convex, and its extremum cannot be obtained. Usually, nonconvex optimization algorithms or iterative relaxation algorithms are used to get the maximum value of the optimization objective function. Nonconvex optimization algorithms or iterative relaxation algorithms are greatly affected by the initial value, and the extremum cannot be obtained by a nonconvex optimization algorithm or iterative relaxation algorithm. In this paper, we creatively apply the strong law of large numbers to obtain the optimal value of the optimization function of SCO-AN under the condition of large-scale MIMO: the strong law of large numbers is applied to obtain the ergodic lower bound (ELB) expression of SC for SCO-AN. The power allocation (PA) problem of the SCO-AN system is discussed. We use a statistical method to get the formula for calculating the optimal power distribution coefficient of the SCO-AN system. The transmitter can use the optimal power ratio of PA to distribute the transmitted power without using the PA algorithm. The effect of imperfect channel state information is discussed. Through simulation, we found that more power should be generated for SCO-AN if the channel estimation is imperfect and the proposed method can achieve better security performance in the large-scale MIMO system. [ABSTRACT FROM AUTHOR]

The key to the problem of node coverage in wireless sensor networks (WSN) is to deploy a limited number of sensors to achieve maximum coverage. This paper studies the hybrid strategies of multiple evolutionary algorithms, and applies them to the problem of WSN node coverage. We first proposed the hybrid algorithm SFLA-WOA (SWOA) based on Shuffled Frog Leaping Algorithm (SFLA) and Whale Optimization Algorithm (WOA). The SWOA algorithm combines the advantages of SFLA and WOA; that is, it retains the unique evolution model of WOA and also has the excellent co-evolution capability of SFLA. Secondly, using the mutation, crossover and selection operations of the differential evolution (DE) algorithm to further optimize this hybrid algorithm, the SWOA-based SFLA-WOA-DE (SWOAD) algorithm is proposed. In addition, the performance of SWOA and SWOAD has been tested by 30 benchmark functions in the CEC 2017 test set. Experimental results show that the optimization effects of these two algorithms are very outstanding. Finally, the simulation results show that the optimization algorithm proposed in this paper has a good effect on improving the signal coverage of WSN under the actual three-dimensional terrain. [ABSTRACT FROM AUTHOR]

With the changes and development of the social era, my country's classic art is slowly being lost. In order to more effectively inherit and preserve classic art, the collection and sorting of classic art data through modern information technology has become a top priority. Database storage is a good way. However, as the amount of data grows, the requirements for computing processing power and query speed for massive amounts of data and information are also increasing day by day. Faced with this problem, this article is aimed at studying the optimization of database queries through effective algorithms to improve the efficiency of data query. Based on the traditional database query optimization algorithm, this article improves on the traditional algorithm and proposes a semi-join query optimization algorithm, which reduces the number of connection cards and the number of columns and uses the number of blocks that participate in the semi-link algorithm connection and preconnection preview and selection. And other functions reduce the size of the participating block, and the connection sent between sites reduces the cost of sending between networks. The graph data query optimization algorithm is used to optimize the graph data query in the database to reduce the extra task overhead and improve the system performance. The experimental results of this paper show that through the data query optimization algorithm of this paper, the additional task overhead is reduced by 19%, the system performance is increased by 22%, and the data query efficiency is increased by 31%. [ABSTRACT FROM AUTHOR]

In the process of 3D printing, the setting of the initial layer is the most important step to achieve perfect printing results, and its main function is to prevent warping in 3D printing. There are three main types of the first layer: Raft, Brim, and Skirt. The Brim is a special skirt and is usually the preferred starting layer for the printing process. In order to increase the adhesion, multiple Brim contour edges will be printed, which increases the difficulty of removal. Otherwise, poor adhesion effect will occur. By analyzing the distinction between inner and outer contours of polygons, the offset process of contour points in different cases is calculated in this paper, and a simplified processing method of contour offset line is designed by using the idea of Douglas–Peucker simplifying curve feature points. According to the functional characteristics of the Brim edge structure, a novel platform attached support structure is generated based on ray-casting algorithm and contour offset algorithm. The proposed algorithm is encapsulated into the slicing engine and compared with three common initial layer structures for conducting part printing comparison experiments. The experimental results show that the edge structure realized by the proposed generation optimization algorithm of a novel platform attached support can effectively reduce the slicing execution time, and the auxiliary structure has little impact on the forming quality. It can be easier to remove on the premise and the warpage of the printing model is small. [ABSTRACT FROM AUTHOR]

As an important model of machine learning, Bayesian networks (BNs) have received a lot of attentions since they can be used for classification via probabilistic inference. However, since it is a complicated combination optimization problem, BN structure learning cannot be solved with classic convex optimization algorithms. Hence, evolutionary algorithms provide an alternative way to find a global solution to BN structure learning problem. In this paper, we improve the biased random-key genetic algorithm to solve the BN structure learning problem. Meanwhile, we apply a local optimization model as its decoder to improve the performance of the proposed algorithm. Finally, we conduct our experiments on nine benchmark networks and a real dataset of cross-site scripting (XSS) attack. Experimental results show that the proposed algorithm can obtain more accurate solutions than other state-of-the-art algorithms and achieve a good performance in XSS attack detection for web security. [ABSTRACT FROM AUTHOR]

This paper solves the shortcomings of sparrow search algorithm in poor utilization to the current individual and lack of effective search, improves its search performance, achieves good results on 23 basic benchmark functions and CEC 2017, and effectively improves the problem that the algorithm falls into local optimal solution and has low search accuracy. This paper proposes an improved sparrow search algorithm based on iterative local search (ISSA). In the global search phase of the followers, the variable helix factor is introduced, which makes full use of the individual's opposite solution about the origin, reduces the number of individuals beyond the boundary, and ensures the algorithm has a detailed and flexible search ability. In the local search phase of the followers, an improved iterative local search strategy is adopted to increase the search accuracy and prevent the omission of the optimal solution. By adding the dimension by dimension lens learning strategy to scouters, the search range is more flexible and helps jump out of the local optimal solution by changing the focusing ability of the lens and the dynamic boundary of each dimension. Finally, the boundary control is improved to effectively utilize the individuals beyond the boundary while retaining the randomness of the individuals. The ISSA is compared with PSO, SCA, GWO, WOA, MWOA, SSA, BSSA, CSSA, and LSSA on 23 basic functions to verify the optimization performance of the algorithm. In addition, in order to further verify the optimization performance of the algorithm when the optimal solution is not 0, the above algorithms are compared in CEC 2017 test function. The simulation results show that the ISSA has good universality. Finally, this paper applies ISSA to PID parameter tuning and robot path planning, and the results show that the algorithm has good practicability and effect. [ABSTRACT FROM AUTHOR]

Aiming at the problems existing in the traditional teaching mode, this paper intelligently optimizes English teaching courses by using multidirectional mutation genetic algorithm and its optimization neural network method. Firstly, this paper gives the framework of intelligent English course optimization system based on multidirectional mutation genetic BP neural network and analyses the local optimization problems existing in the traditional BP algorithm. A BP neural network optimization algorithm based on multidirectional mutation genetic algorithm (MMGA-BP) is presented. Then, the multidirectional mutation genetic BPNN algorithm is applied to the intelligent optimization of English teaching courses. The simulation shows that the multidirectional mutation genetic BP neural network algorithm can solve the local optimization problem of traditional BP neural network. Finally, a control group and an experimental group are set up to verify the role of multidirectional mutation genetic algorithm and its optimization neural network in the intelligent optimization system of English teaching courses through the combination of summative and formative teaching evaluations. The data show that MMGA-BP algorithm can significantly improve the scores of academic students in English courses and has better teaching performance. The effect of vocabulary teaching under the guidance of MMGA-BP optimization theory is very significant, which plays a certain role in the intelligent curriculum optimization of the experimental class. [ABSTRACT FROM AUTHOR]

In recent years, with the development of society and the rapid development of the animation industry, people are paying more and more attention to and requirements for animation production. As an indispensable part of animation production, picture composition plays a major role in animation production. It can give full play to the application of color matching and light and shadow design and enhance the depth and space of the animation screen. Tone space conversion refers to the conversion or representation of color data in one color space into corresponding data in another color space. Its purpose is to distinguish and process color components such as hue and saturation in an image. This article first introduces the domestic and foreign research status of digital image preprocessing and analyzes the basic principles of several color space conversions in detail. Then, several color space conversion algorithms are studied, and the performance of the algorithms is compared and analyzed. The paper focuses on the hardware implementation and optimization of the algorithm for converting RGB color space into HSI color space to meet the real-time requirements. This article focuses on the mutual conversion between the RGB tone space and the HSI tone space and describes in detail how each color component in the HSI tone space is converted from the three RGB color components from a geometric perspective, and then the conversion is derived, and several general conversion methods of RGB to HSI tone space are introduced; two conversion methods of geometric derivation method and standard modulus algorithm are implemented in the software, and the comparison verification is carried out, and the comparison is made from the perspective of hardware implementation. The pros and cons of the two methods are discussed. Finally, the paper summarizes the shortcomings in the design and proposes further research directions in the future. [ABSTRACT FROM AUTHOR]

To better reflect the precise clustering results of the data samples with different shapes and densities for affinity propagation clustering algorithm (AP), an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory (DPKT-AP) was proposed in this paper. DPKT-AP combined the ideology of integrated clustering with the AP algorithm, by introducing the density peak theory and k-means algorithm to carry on the three-stage clustering process. In the first stage, the clustering center point was selected by density peak clustering. Because the clustering center was surrounded by the nearest neighbor point with lower local density and had a relatively large distance from other points with higher density, it could help the k-means algorithm in the second stage avoiding the local optimal situation. In the second stage, the k-means algorithm was used to cluster the data samples to form several relatively small spherical subgroups, and each of subgroups had a local density maximum point, which is called the center point of the subgroup. In the third stage, DPKT-AP used the AP algorithm to merge and cluster the spherical subgroups. Experiments on UCI data sets and synthetic data sets showed that DPKT-AP improved the clustering performance and accuracy for the algorithm. [ABSTRACT FROM AUTHOR]

Summary: Energy management of the grid connected microgrid (MG) systems with low cost using a novel hybrid algorithm is implemented in this paper. The novel proposed hybrid technique is the combined performance of both the Random Forest (RF) and Coral Reefs Optimization (CRO) algorithm and in this way it is named as RFCRO. Optimum operation of micro‐sources for decreasing the electricity production cost by hourly day‐ahead and real‐time scheduling is the main objective of the paper. The proposed hybrid technique is to manage the power flows between the energy sources and the grid. To achieve this point, demand response and minimum cost of energy are determined. This technique is involved with the mathematical optimization problems that necessitate more than one fitness function to be optimized simultaneously. By using the inputs of MG‐like wind turbine, photovoltaic array, battery, and fuel cell with corresponding cost functions, the RF is employed to predict the load demand. CRO clarifies the squirrel in optimizing the configuration of MG based on the load demand. The proposed hybrid technique is implemented in MATLAB/Simulink working platform and compared with other solution techniques like BFOANN, ALO, GOAPSNN, and RBFNN‐SSA technique. The comparison result reveals that the superiority of the proposed technique confirms its ability to solve the problem. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of standard particle swarm optimization (PSO) algorithms that easily fall into local optimum, this paper proposes an optimization algorithm (LTQPSO) that improves quantum behavioral particle swarms. Aiming at the problem of premature convergence of the particle swarm algorithm, the evolution speed of individual particles and the population dispersion are used to dynamically adjust the inertia weights to make them adaptive and controllable, thereby avoiding premature convergence. At the same time, the natural selection method is introduced into the traditional position update formula to maintain the diversity of the population, strengthen the global search ability of the LTQPSO algorithm, and accelerate the convergence speed of the algorithm. The improved LTQPSO algorithm is applied to landscape trail path planning, and the research results prove the effectiveness and feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

In order to improve the effect of classroom teaching and realize the improvement of mathematics teaching quality, this article combines data-driven decision-making technology to design a mathematics teaching plan system and applies data-driven decision-making technology to the design of mathematics teaching plan by improving the big data algorithm. In addition, this paper designs a mathematics teaching plan design system based on data-driven decision-making technology. The system learning module displays the knowledge points in a chapter-sequential navigation mode and stores data or information in the nodes, which are connected to form a network structure through chains. Finally, this paper verifies the designed system with experiments. From the results of the experimental research data, it can be seen that the mathematical teaching plan design system based on the data-driven decision-making technology constructed in this article has good practical effects. On this basis, the system constructed in this article can be verified through further practice. [ABSTRACT FROM AUTHOR]

This paper presents an enhanced and improved particle swarm optimization (PSO) approach to overcome reliability-redundancy allocation problems in series, series-parallel, and complex systems. The problems mentioned above can be solved by increasing the overall system reliability and minimizing the system cost, weight, and volume. To achieve this with these nonlinear constraints, an approach is developed based on PSO. In particular, the inertia and acceleration coefficients of the classical particle swarm algorithm are improved by considering a normal distribution for the coefficients. The new expressions can enhance the global search ability in the initial stage, restrain premature convergence, and enable the algorithm to focus on the local fine search in the later stage, and this can enhance the perfection of the optimization process. Illustrative examples are provided as proof of the efficiency and effectiveness of the proposed approach. Results show that the overall system reliability is far better when compared with that of some approaches developed in previous studies for all three tested cases. [ABSTRACT FROM AUTHOR]

The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX) operator with differential evolution (DE) operator, which is used to enhance the diversity of the solutions more effectively. However, the amplification factor and the crossover probability are fixed in MOEA/D-DE, which would lead to a low convergence rate and be more likely to fall into local optimum. To overcome such a prematurity problem, this paper proposes three different adaptive operators in DE with crossover probability and amplification factors to adjust the parameter settings adaptively. We incorporate these three adaptive operators in MOEA/D-DE and MOEA/D-PaS to solve MOPs and many-objective optimization problems (MaOPs), respectively. This paper also designs a sensitive experiment for the changeable parameter η in the proposed adaptive operators to explore how η would affect the convergence of the proposed algorithms. These adaptive algorithms are tested on many benchmark problems, including ZDT, DTLZ, WFG, and MaF test suites. The experimental results illustrate that the three proposed adaptive algorithms have better performance on most benchmark problems. [ABSTRACT FROM AUTHOR]