A Multi-Objective Optimization Problem Solving Method Based on Improved Golden Jackal Optimization Algorithm and Its Application.

The traditional golden jackal optimization algorithm (GJO) has slow convergence speed, insufficient accuracy, and weakened optimization ability in the process of finding the optimal solution. At the same time, it is easy to fall into local extremes and other limitations. In this paper, a novel golden jackal optimization algorithm (SCMGJO) combining sine-cosine and Cauchy mutation is proposed. On one hand, tent mapping reverse learning is introduced in population initialization, and sine and cosine strategies are introduced in the update of prey positions, which enhances the global exploration ability of the algorithm. On the other hand, the introduction of Cauchy mutation for perturbation and update of the optimal solution effectively improves the algorithm's ability to obtain the optimal solution. Through the optimization experiment of 23 benchmark test functions, the results show that the SCMGJO algorithm performs well in convergence speed and accuracy. In addition, the stretching/compression spring design problem, three-bar truss design problem, and unmanned aerial vehicle path planning problem are introduced for verification. The experimental results prove that the SCMGJO algorithm has superior performance compared with other intelligent optimization algorithms and verify its application ability in engineering applications.

Solving Engineering Optimization Problems Based on Multi-Strategy Particle Swarm Optimization Hybrid Dandelion Optimization Algorithm.

In recent years, swarm intelligence optimization methods have been increasingly applied in many fields such as mechanical design, microgrid scheduling, drone technology, neural network training, and multi-objective optimization. In this paper, a multi-strategy particle swarm optimization hybrid dandelion optimization algorithm (PSODO) is proposed, which is based on the problems of slow optimization speed and being easily susceptible to falling into local extremum in the optimization ability of the dandelion optimization algorithm. This hybrid algorithm makes the whole algorithm more diverse by introducing the strong global search ability of particle swarm optimization and the unique individual update rules of the dandelion algorithm (i.e., rising, falling and landing). The ascending and descending stages of dandelion also help to introduce more changes and explorations into the search space, thus better balancing the global and local search. The experimental results show that compared with other algorithms, the proposed PSODO algorithm greatly improves the global optimal value search ability, convergence speed and optimization speed. The effectiveness and feasibility of the PSODO algorithm are verified by solving 22 benchmark functions and three engineering design problems with different complexities in CEC 2005 and comparing it with other optimization algorithms.

Gorilla optimization algorithm combining sine cosine and cauchy variations and its engineering applications.

To address the issues of lacking ability, loss of population diversity, and tendency to fall into the local extreme value in the later stage of optimization searching, resulting in slow convergence and lack of exploration ability of the artificial gorilla troops optimizer algorithm (AGTO), this paper proposes a gorilla search algorithm that integrates the positive cosine and Cauchy's variance (SCAGTO). Firstly, the population is initialized using the refractive reverse learning mechanism to increase species diversity. A positive cosine strategy and nonlinearly decreasing search and weight factors are introduced into the finder position update to coordinate the global and local optimization ability of the algorithm. The follower position is updated by introducing Cauchy variation to perturb the optimal solution, thereby improving the algorithm's ability to obtain the global optimal solution. The SCAGTO algorithm is evaluated using 30 classical test functions of Test Functions 2018 in terms of convergence speed, convergence accuracy, average absolute error, and other indexes, and two engineering design optimization problems, namely, the pressure vessel optimization design problem and the welded beam design problem, are introduced for verification. The experimental results demonstrate that the improved gorilla search algorithm significantly enhances convergence speed and optimization accuracy, and exhibits good robustness. The SCAGTO algorithm demonstrates certain solution advantages in optimizing the pressure vessel design problem and welded beam design problem, verifying the superior optimization ability and engineering practicality of the SCAGTO algorithm.

Towards an Optimal KELM Using the PSO-BOA Optimization Strategy with Applications in Data Classification.

The features of the kernel extreme learning machine-efficient processing, improved performance, and less human parameter setting-have allowed it to be effectively used to batch multi-label classification tasks. These classic classification algorithms must at present contend with accuracy and space-time issues as a result of the vast and quick, multi-label, and concept drift features of the developing data streams in the practical application sector. The KELM training procedure still has a difficulty in that it has to be repeated numerous times independently in order to maximize the model's generalization performance or the number of nodes in the hidden layer. In this paper, a kernel extreme learning machine multi-label data classification method based on the butterfly algorithm optimized by particle swarm optimization is proposed. The proposed algorithm, which fully accounts for the optimization of the model generalization ability and the number of hidden layer nodes, can train multiple KELM hidden layer networks at once while maintaining the algorithm's current time complexity and avoiding a significant number of repeated calculations. The simulation results demonstrate that, in comparison to the PSO-KELM, BBA-KELM, and BOA-KELM algorithms, the PSOBOA-KELM algorithm proposed in this paper can more effectively search the kernel extreme learning machine parameters and more effectively balance the global and local performance, resulting in a KELM prediction model with a higher prediction accuracy.

An Energy-Saving and Efficient Deployment Strategy for Heterogeneous Wireless Sensor Networks Based on Improved Seagull Optimization Algorithm.

The Internet of Things technology provides convenience for data acquisition in environmental monitoring and environmental protection and can also avoid invasive damage caused by traditional data acquisition methods. An adaptive cooperative optimization seagull algorithm for optimal coverage of heterogeneous sensor networks is proposed in order to address the issue of coverage blind zone and coverage redundancy in the initial random deployment of heterogeneous sensor network nodes in the sensing layer of the Internet of Things. Calculate the individual fitness value according to the total number of nodes, coverage radius, and area edge length, select the initial population, and aim at the maximum coverage rate to determine the position of the current optimal solution. After continuous updating, when the number of iterations is maximum, the global output is output. The optimal solution is the node's mobile position. A scaling factor is introduced to dynamically adjust the relative displacement between the current seagull individual and the optimal individual, which improves the exploration and development ability of the algorithm. Finally, the optimal seagull individual position is fine-tuned by random opposite learning, leading the whole seagull to move to the correct position in the given search space, improving the ability to jump out of the local optimum, and further increasing the optimization accuracy. The experimental simulation results demonstrate that, compared with the coverage and network energy consumption of the PSO algorithm, the GWO algorithm, and the basic SOA algorithm, the coverage of the PSO-SOA algorithm proposed in this paper is 6.1%, 4.8%, and 1.2% higher than them, respectively, and the energy consumption of the network is reduced by 86.8%, 68.4%, and 52.6%, respectively. The optimal deployment method based on the adaptive cooperative optimization seagull algorithm can improve the network coverage and reduce the network cost, and effectively avoid the coverage blind zone and coverage redundancy in the network.

Application of Swarm Intelligence Optimization Algorithms in Image Processing: A Comprehensive Review of Analysis, Synthesis, and Optimization.

Image processing technology has always been a hot and difficult topic in the field of artificial intelligence. With the rise and development of machine learning and deep learning methods, swarm intelligence algorithms have become a hot research direction, and combining image processing technology with swarm intelligence algorithms has become a new and effective improvement method. Swarm intelligence algorithm refers to an intelligent computing method formed by simulating the evolutionary laws, behavior characteristics, and thinking patterns of insects, birds, natural phenomena, and other biological populations. It has efficient and parallel global optimization capabilities and strong optimization performance. In this paper, the ant colony algorithm, particle swarm optimization algorithm, sparrow search algorithm, bat algorithm, thimble colony algorithm, and other swarm intelligent optimization algorithms are deeply studied. The model, features, improvement strategies, and application fields of the algorithm in image processing, such as image segmentation, image matching, image classification, image feature extraction, and image edge detection, are comprehensively reviewed. The theoretical research, improvement strategies, and application research of image processing are comprehensively analyzed and compared. Combined with the current literature, the improvement methods of the above algorithms and the comprehensive improvement and application of image processing technology are analyzed and summarized. The representative algorithms of the swarm intelligence algorithm combined with image segmentation technology are extracted for list analysis and summary. Then, the unified framework, common characteristics, different differences of the swarm intelligence algorithm are summarized, existing problems are raised, and finally, the future trend is projected.

Bio-Inspired Swarm Intelligence Optimization Algorithm-Aided Hybrid TDOA/AOA-Based Localization.

A TDOA/AOA hybrid location algorithm based on the crow search algorithm optimized by particle swarm optimization is proposed to address the challenge of solving the nonlinear equation of time of arrival (TDOA/AOA) location in the non-line-of-sight (NLoS) environment. This algorithm keeps its optimization mechanism on the basis of enhancing the performance of the original algorithm. To obtain a better fitness value throughout the optimization process and increase the algorithm's optimization accuracy, the fitness function based on maximum likelihood estimation is modified. In order to speed up algorithm convergence and decrease needless global search without compromising population diversity, an initial solution is simultaneously added to the starting population location. Simulation findings demonstrate that the suggested method outperforms the TDOA/AOA algorithm and other comparable algorithms, including Taylor, Chan, PSO, CPSO, and basic CSA algorithms. The approach performs well in terms of robustness, convergence speed, and node positioning accuracy.

A Novel Topology Optimization Protocol Based on an Improved Crow Search Algorithm for the Perception Layer of the Internet of Things.

In wireless sensor networks, each sensor node has a finite amount of energy to expend. The clustering method is an efficient way to deal with the imbalance in node energy consumption. A topology optimization technique for wireless sensor networks based on the Cauchy variation optimization crow search algorithm (CM-CSA) is suggested to address the issues of rapid energy consumption, short life cycles, and unstable topology in wireless sensor networks. At the same time, a clustering approach for wireless sensor networks based on the enhanced Cauchy mutation crow search algorithm is developed to address the issue of the crow algorithm's sluggish convergence speed and ease of falling into the local optimum. It utilizes the Cauchy mutation to improve the population's variety and prevent settling for the local optimum, as well as to broaden the range of variation and the capacity to carry out global searches. When the leader realizes he is being followed, the discriminative probability is introduced to improve the current person's location update approach. According to the simulation findings, the suggested CM-CSA algorithm decreases the network's average energy consumption by 66.7%, 50%, and 33.3% and enhances its connectivity performance by 52.9%, 37.6%, and 23.5% when compared to the PSO algorithm, AFSA method, and basic CSA algorithm.

Effective detection of Alzheimer's disease by optimizing fuzzy K-nearest neighbors based on salp swarm algorithm.

Alzheimer's disease (AD) is a typical senile degenerative disease that has received increasing attention worldwide. Many artificial intelligence methods have been used in the diagnosis of AD. In this paper, a fuzzy k-nearest neighbor method based on the improved binary salp swarm algorithm (IBSSA-FKNN) is proposed for the early diagnosis of AD, so as to distinguish between patients with mild cognitive impairment (MCI), Alzheimer's disease (AD) and normal controls (NC). First, the performance and feature selection accuracy of the method are validated on 5 different benchmark datasets. Secondly, the paper uses the Structural Magnetic Resolution Imaging (sMRI) dataset, in terms of classification accuracy, sensitivity, specificity, etc., the effectiveness of the method on the AD dataset is verified. The simulation results show that the classification accuracy of this method for AD and MCI, AD and NC, MCI and NC are 95.37%, 100%, and 93.95%, respectively. These accuracies are better than the other five comparison methods. The method proposed in this paper can learn better feature subsets from serial multimodal features, so as to improve the performance of early AD diagnosis. It has a good application prospect and will bring great convenience for clinicians to make better decisions in clinical diagnosis.

An Energy Efficient and Reliable Multipath Transmission Strategy for Mobile Wireless Sensor Networks.

Multipath data transmission is a key problem that needs to be solved urgently in wireless sensor networks. In this paper, sensor node failure, link failure, energy exhaustion, and external interference affect the stability and reliability of network data transmission. A multipath transmission strategy for wireless sensor networks based on improved shuffled frog leaping algorithm is proposed. A mathematical model of multipath transmission in wireless sensor networks is established. In the shuffled frog leaping algorithm, combined with the transition probability in the particle swarm optimization algorithm, random individuals in the subgroup are introduced to assist the search when updating the frog individual position, which improves the algorithm's ability to jump out of the local optimum and improves the quality of the optimization algorithm solution. The model is applied to multipath transmission in wireless sensor networks. Then, the shuffled frog leaping algorithm is used to update, divide, and reorganize the sensor nodes to select the optimal node to establish the optimal transmission path and improve the stability and reliability of the network. Simulation experiments show that the algorithm in this paper can ensure the reliability of data transmission, reduce the network packet loss rate and network energy consumption, and reduce the average delay of data transmission.

Analysis and Prospect of the Application of Wireless Sensor Networks in Ubiquitous Power Internet of Things.

With the rapid development of the economy and society, the low efficiency and high loss of the traditional power grid can no longer meet the growing social demand, and the power grid market is facing a reform. Smart grid, as a next-generation power system, it can effectively improve the performance of traditional power grids. The ubiquitous power Internet of Things (UPIOT) replaces the traditional grids with efficient, safe, reliable, and flexible new grids, improves the utilization efficiency of the grid, reduces the loss of the power grid in the transmission process, and can meet the needs of different types of markets and users. As an advanced information acquisition and processing technology, wireless sensor networks have been widely used in medical, industrial, agricultural, commercial, and public management fields. It is an important means to promote future economic development and build a harmonious society. In the power system, wireless sensor network technology can be widely used in many fields such as line fault location, real-time monitoring, smart meter reading, and relay protection. In this paper, the basic concepts and overall architecture of ubiquitous power Internet of Things are summarized. Then, we summarize the research status of the wireless sensor network in smart grid, including power equipment, line monitoring, smart grid wireless automatic meter reading, distribution network relay protection, power assets life-cycle management, power grid fault location, and power grid fault diagnosis. In view of the technical characteristics of wireless sensor networks, combined with the production links of power systems, the application framework of wireless sensor network technology in the power systems is constructed. The application of wireless sensor networks is prospected from the aspects of network development of relay protection, application research of smart substation, application research of power grid catastrophe, security protection of power system, and deep-seated ubiquitous power Internet of Things.

A Data Collection Method for Mobile Wireless Sensor Networks Based on Improved Dragonfly Algorithm.

For the sensing layer of the Internet of Things, the mobile wireless sensor network has problems such as limited energy of the sensor nodes, unbalanced energy consumption, unreliability, and long transmission delay in the data collection process. It is proved by mathematical derivation and theory that this is a typical multiobjective optimization problem. In this paper, the optimization goal is to minimize the energy consumption and improve the reliability under time-delay constraints and propose a path optimization mechanism to optimize the mobile Sink of mobile wireless sensor networks based on the improved dragonfly optimization algorithm. The algorithm takes full advantage of the abundant storage space, sufficient energy, and strong computing power of the mobile Sink to ensure network connectivity and improve network communication efficiency. Through simulation comparison and analysis, compared with random movement method, artificial bee colony algorithm, and basic dragonfly optimization algorithm, the energy consumption of the network is reduced, the lifespan of the network is increased, and the connectivity and transmission delay of the network are improved. The proposed algorithm balances the energy consumption of the sensors nodes to meet the network service quality and improve the reliability of the network.

Data Collection Strategy Based on OSELM and Gray Wolf Optimization Algorithm for Wireless Sensor Networks.

In order to effectively reduce the energy consumption, improve the efficiency of data collection in HWSNs, and prolong the lifetime of the overall network, the clustering method is one of the most effective methods in the data collection methods for HWSNs. The data collection strategy of HWSNs based on the clustering method mainly includes three stages: (1) selecting the appropriate cluster head, (2) forming between clusters, and (3) transferring data between clusters. Among them, the selection of the cluster heads in the first stage. The optimal number of cluster heads in the formation of clusters in the second stage is the core and key to the clustering data collection of HWSNs. In the stage of cluster head selection, a data collection strategy for HWSNs based on the clustering method is proposed. Sink establishes an extreme learning machine neural network model. The cluster member nodes select cluster heads based on the remaining energy of the sensor node, the number of the neighbor node, and the distance to the sink. The best cluster head node is selected through the adaptive learning of the online sequence extreme learning machine. Through comprehensive consideration of various factors to complete the clustering process, the gray wolf algorithm is used to optimize the number of clusters, balance the effect of clustering, and improve the efficiency of data collection while reducing energy consumption. An energy efficient and reliable clustering data collection strategy for HWSNs based on the online sequence extreme learning machine and the gray wolf optimization algorithm is proposed in this paper. The simulation results show that the proposed algorithm not only significantly improves the efficiency of the data collection and reduces energy consumption but also comprehensively improves the reliability of the network and prolongs the network's lifetime.

A Data Collection Strategy for Heterogeneous Wireless Sensor Networks Based on Energy Efficiency and Collaborative Optimization.

In the clustering routing protocol, prolonging the lifetime of the sensor network depends to a large extent on the rationality of the cluster head node selection. The selection of cluster heads for heterogeneous wireless sensor networks (HWSNs) does not consider the remaining energy of the current nodes and the distribution of nodes, which leads to an imbalance of network energy consumption. A strategy for selecting cluster heads of HWSNs based on the improved sparrow search algorithm- (ISSA-) optimized self-organizing maps (SOM) is proposed. In the stage of cluster head selection, the proposed algorithm establishes a competitive neural network model at the base station and takes the nodes of the competing cluster heads as the input vector. Each input vector includes three elements: the remaining energy of the node, the distance from the node to the base station, and the number of neighbor nodes of the node. The best cluster head is selected through the adaptive learning of the improved competitive neural network. When selecting the cluster head node, comprehensively consider the remaining energy, the distance, and the number of times the node becomes a cluster head and optimize the cluster head node selection strategy to extend the network life cycle. Simulation experiments show that the new algorithm can reduce the energy consumption of the network more effectively than the basic competitive neural network and other algorithms, balance the energy consumption of the network, and further prolong the lifetime of the sensor network.

A Novel Coverage Optimization Strategy Based on Grey Wolf Algorithm Optimized by Simulated Annealing for Wireless Sensor Networks.

The coverage optimization problem of wireless sensor network has become one of the hot topics in the current field. Through the research on the problem of coverage optimization, the coverage of the network can be improved, the distribution redundancy of the sensor nodes can be reduced, the energy consumption can be reduced, and the network life cycle can be prolonged, thereby ensuring the stability of the entire network. In this paper, a novel grey wolf algorithm optimized by simulated annealing is proposed according to the problem that the sensor nodes have high aggregation degree and low coverage rate when they are deployed randomly. Firstly, the mathematical model of the coverage optimization of wireless sensor networks is established. Secondly, in the process of grey wolf optimization algorithm, the simulated annealing algorithm is embedded into the grey wolf after the siege behavior ends and before the grey wolf is updated to enhance the global optimization ability of the grey wolf algorithm and at the same time improve the convergence rate of the grey wolf algorithm. Simulation experiments show that the improved grey wolf algorithm optimized by simulated annealing is applied to the coverage optimization of wireless sensor networks. It has better effect than particle swarm optimization algorithm and standard grey wolf optimization algorithm, has faster optimization speed, improves the coverage of the network, reduces the energy consumption of the nodes, and prolongs the network life cycle.

New principle for busbar protection based on the Euclidean distance algorithm.

A new fast busbar protection algorithm based on the comparison of the similarity of back-wave waveforms is proposed in this paper. The S-transform is performed on the back-wave from each defected transmission line connected to the busbar, and the protection criterion is thus constructed by using the Euclidean distance to analyze the similarity of the back-waves, with the implementation of the S-transform between the transmission lines. When a fault occurs internally on the busbar, the Euclidean distance of the S-transformed back-wave between each associated transmission line is small, and there is a remarkable similarity between the waveform. When a fault occurs externally on the busbar, the Euclidean distance of the S-transformed backward traveling wave between the faulty line and the nonfaulty line is larger than that between the nonfaulty lines. The wave-forms of the faulty line and the nonfaulty line bear little similarity, while there is a striking similarity between the nonfaulty lines. Therefore, a protection criterion is established according to the ratio between the maximal similarity and the minimal similarity to discriminate the internal and external faults of the busbar zones. The simulation results show that the proposed busbar protection method can discriminate the internal and external faults of busbar zones in a sensitive and reliable way.

An Adaptive and Time-Efficient ECG R-Peak Detection Algorithm.

R-peak detection is crucial in electrocardiogram (ECG) signal analysis. This study proposed an adaptive and time-efficient R-peak detection algorithm for ECG processing. First, wavelet multiresolution analysis was applied to enhance the ECG signal representation. Then, ECG was mirrored to convert large negative R-peaks to positive ones. After that, local maximums were calculated by the first-order forward differential approach and were truncated by the amplitude and time interval thresholds to locate the R-peaks. The algorithm performances, including detection accuracy and time consumption, were tested on the MIT-BIH arrhythmia database and the QT database. Experimental results showed that the proposed algorithm achieved mean sensitivity of 99.39%, positive predictivity of 99.49%, and accuracy of 98.89% on the MIT-BIH arrhythmia database and 99.83%, 99.90%, and 99.73%, respectively, on the QT database. By processing one ECG record, the mean time consumptions were 0.872 s and 0.763 s for the MIT-BIH arrhythmia database and QT database, respectively, yielding 30.6% and 32.9% of time reduction compared to the traditional Pan-Tompkins method.

Combining Low-dimensional Wavelet Features and Support Vector Machine for Arrhythmia Beat Classification.

Automatic feature extraction and classification are two main tasks in abnormal ECG beat recognition. Feature extraction is an important prerequisite prior to classification since it provides the classifier with input features, and the performance of classifier depends significantly on the quality of these features. This study develops an effective method to extract low-dimensional ECG beat feature vectors. It employs wavelet multi-resolution analysis to extract time-frequency domain features and then applies principle component analysis to reduce the dimension of the feature vector. In classification, 12-element feature vectors characterizing six types of beats are used as inputs for one-versus-one support vector machine, which is conducted in form of 10-fold cross validation with beat-based and record-based training schemes. Tested upon a total of 107049 beats from MIT-BIH arrhythmia database, our method has achieved average sensitivity, specificity and accuracy of 99.09%, 99.82% and 99.70%, respectively, using the beat-based training scheme, and 44.40%, 88.88% and 81.47%, respectively, using the record-based training scheme.