Search

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. [ABSTRACT FROM AUTHOR]

With the increasing openness and development of network technology, the network based on the wireless sensor network system has increasingly become an important tool for human social life and production, but it also brings some network security problems. Among them, focus is on network privacy disclosure and foreign intrusion and the research of intrusion detection and privacy protection has increasingly become an important topic of network security. This paper deeply studies the wireless sensor network system based on neural network on the basis of traditional privacy protection and intrusion detection system. Firstly, it applies particle swarm optimization algorithm and constructs a wireless sensor network intrusion detection system based on particle swarm optimization algorithm. The system includes important modules such as data extraction, data analysis, data feedback, and auxiliary decision-making. Compared with other algorithms, particle swarm optimization algorithm does not rely on problem information. It mainly uses real numbers to solve, so the algorithm has strong universality. At the same time, its corresponding principle is simple and easy to implement and less parameters need to be adjusted. Compared with other algorithms, particle swarm optimization algorithm has fast convergence speed and little memory requirement for the computer. At the same time, this paper uses the leap of particle swarm optimization algorithm to make it easier to find the global optimal solution. At the corresponding level of wireless sensor network privacy protection, based on the original data aggregation privacy protection scheme, this paper proposes a privacy protection scheme based on polynomial regression and a user privacy protection scheme based on the same state encryption, which further improves the security of privacy protection and facilitates the management of information. To realize the integrity of user privacy information protection, this paper realizes the decryption of data based on the correlation between binary metadata and compares the corresponding decrypted data with aggregated data, so as to complete the integrity of privacy data protection. The experimental results show that the binary metadata correlation decryption method proposed in this paper and the introduction of the corresponding particle swarm optimization algorithm improve the stability of the system by about 10%, the corresponding system security by a positive proportion, and the integrity of private data by about 10%; therefore, the algorithm proposed in this paper has obvious advantages. [ABSTRACT FROM AUTHOR]

This paper aims to map the task of reliable transmission of wireless sensor networks. At the same time, this paper transforms the mapping problem of wireless sensor networks into a problem of reducing the energy consumption of mapping under many constraints such as reliability and scheduling length and uses discrete particle swarm optimization algorithm to map. For optimization, the algorithm performs iterative calculations to obtain the best mapping node for each operation so that the inertia coefficient of the existing particle swarm optimization algorithm is improved and linearly minimized with the number of iterations. When resource-demanding tasks need to allocate dynamic resources to multiple nodes to complete collaboratively, adding the mapping principle of the nearest node in the discrete particle swarm optimization mapping reduces the energy consumption of communication between tasks. An in-depth analysis of the influencing factors of the ice and snow tourism market shows that the per capita disposable income of urban residents and the number of urban residents have a significant impact on the ice and snow tourism market demand. In addition, regression analysis and demand-based forecasting are important methods to analyze the scale and development trend of tourism. At the same time, it shows an important position in the purpose of urban tourism and regional market share so as to provide a basis for decision-making in tourism destination marketing. This paper mainly studies and analyzes the wireless sensor network and further introduces it into dynamic resource allocation and ice and snow tourism, which can promote the continuous development of dynamic resource allocation and ice and snow tourism. [ABSTRACT FROM AUTHOR]

With the significant increase of social informatization, the emerging information technology represented by machine vision has been applied to more and more scenes. Among them, the detection and extraction of human skeleton in a dance video based on this technology has a huge market demand in education and training. However, the existing detection and extraction technology has the problems of slow recognition speed and low extraction accuracy. Therefore, this paper proposes a neural network based on particle swarm optimization to detect and extract human skeletons in a dance video. Through the research and test on different data sets, it is found that the neural network based on particle swarm optimization algorithm has good detection and extraction ability and has high accuracy for the detection and recognition of human skeleton points. Among them, on all MPII data sets, the average accuracy of PSO-LSTM proposed in this paper is 3.9% higher than that of other optimal algorithms; on the PoseTrack data set, the average accuracy of detection and extraction is improved by 2.3%. The above results show that the neural network based on particle swarm optimization has fast detection speed and good extraction accuracy and can be used for the detection and extraction of human skeleton in a dance video. [ABSTRACT FROM AUTHOR]

Aiming at the problems of single planning technology and relatively few resource types in the process of regional comprehensive energy system planning at the current stage, this paper proposes a method based on the construction of regional comprehensive energy system planning and the operation model. Through the integration of the particle swarm optimization algorithm, this method can better realize the optimization and economic operation of the regional comprehensive energy system and build a system optimization mode based on two stages of planning and operation to pursue the optimal configuration of system equipment. Through the simulation algorithm, it is found that the solution time of the traditional basic particle swarm optimization algorithm is 10.49s, while the average solution time of the particle swarm optimization system proposed in this study is 7.93s; the efficiency is increased by 24.4%, and the system operation efficiency is significantly improved, providing theoretical and technical guidance for the economic operation of the regional comprehensive energy system. [ABSTRACT FROM AUTHOR]

In recent years, the use of long short-term memory (LSTM) has made significant contributions to various fields and the use of intelligent optimization algorithms combined with LSTM is also one of the best ways to improve model shortcomings and increase classification accuracy. Reservoir identification is a key and difficult point in the process of logging, so using LSTM to identify the reservoir is very important. To improve the logging reservoir identification accuracy of LSTM, an improved equalization optimizer algorithm (TAFEO) is proposed in this paper to optimize the number of neurons and various parameters of LSTM. The TAFEO algorithm mainly employs tent chaotic mapping to enhance the population diversity of the algorithm, convergence factor is introduced to better balance the local and global search, and then, a premature disturbance strategy is employed to overcome the shortcomings of local minima. The optimization performance of the TAFEO algorithm is tested with 16 benchmark test functions and Wilcoxon rank-sum test for optimization results. The improved algorithm is superior to many intelligent optimization algorithms in accuracy and convergence speed and has good robustness. The receiver operating characteristic (ROC) curve is used to evaluate the performance of the optimized LSTM model. Through the simulation and comparison of UCI datasets, the results show that the performance of the LSTM model based on TAFEO has been significantly improved, and the maximum area under the ROC curve value can get 99.43%. In practical logging applications, LSTM based on an equalization optimizer is effective in well-logging reservoir identification, the highest recognition accuracy can get 95.01%, and the accuracy of reservoir identification is better than other existing identification methods. [ABSTRACT FROM AUTHOR]

People's lives are undergoing tremendous changes with the development of the times. Compared with the past, people's pursuit of spiritual and cultural life also makes our education field usher in a huge development to adapt to the changes in the context of the times. But, at the same time, the development of labor education is gradually being downplayed by people, resulting in a series of problems such as people preferring comfort and not working. Aiming at this common problem, this paper will use the ant colony algorithm and particle swarm optimization algorithm in the computer intelligent algorithm to optimize the way of labor education. It includes the principle and basic process of the ant colony algorithm, the establishment of the mathematical model of the original ant colony algorithm, and the improved algorithm of the ant colony algorithm. The research results of the optimization method of labor education showed the following: when the number of ant colonies reaches 51, the number of iterations of the algorithm will be the least, and the corresponding shortest path is also the best solution; when the combination of pheromone intensity and volatility factor is 3, the optimal solution can be quickly found, and the algorithm inflection point of MMAS is 44.82. From the research results, it can be seen that the computer intelligent algorithm has a good choice for the optimization of labor education and can achieve a major breakthrough in the traditional model of labor education. [ABSTRACT FROM AUTHOR]

This paper proposes a secure clustering strategy based on improved particle swarm optimization (PSO) in the environment of the Internet of Things (IoT). First, in the process of cluster head election, by considering the residual energy and load balance of nodes, a new fitness function is established to evaluate and select better candidate cluster head nodes. Second, the optimized adaptive learning factor is used to adjust the location update speed of candidate cluster head nodes, expand the local search, and accelerate the convergence speed of global search. Finally, in the stage of forwarding node election and data transmission, in order to reduce the energy consumption of forwarding nodes, each cluster head node elects a forwarding node among the ordinary nodes in its cluster, so that the elected forwarding nodes have the optimal energy and location relationship. Experiments show that the proposed method effectively prolongs the network lifetime compared with the comparison methods. The average node degree of the proposed method is less than 2.5. [ABSTRACT FROM AUTHOR]

With the continuous development of e-commerce, logistics and express services have penetrated into every aspect of people's life. Research on the optimization of logistics network model is helpful to reduce the waste of routes, improve the utilization rate of transportation tools and hubs, and thus reduce the organizational cost of logistics. In this paper, the basic model of hub-and-spoke network (HSN) is constructed based on the principle of minimizing the connection distance and total cost between hubs. By discretizing the particles in the continuous motion space, the discrete particle swarm optimization (PSO) algorithm is designed and the Exchange () exchange function is used to improve its search strategy to update the individual optimal value and the global optimal value. Finally, the improved double-layer discrete PSO algorithm is obtained to solve the logistics network model. The results show that the optimized PSO algorithm has faster convergence speed and higher precision, and the application of the logistics network model is helpful to integrate logistics resources, reduce logistics costs, and improve logistics efficiency. [ABSTRACT FROM AUTHOR]

The jet pipe servo (JPS) valve is one key component, whose dynamic performance directly influences the aircraft's maneuverability. In this paper, a more accurate mathematical model and a novel multiobjective hierarchical encourage particle swarm optimization genetic algorithm (HEPGA) are proposed to improve the dynamic performance of the jet pipe servo valve. By optimizing the main structure parameters of the jet pipe servo valve, the adjustment and overshoot in the dynamic performance are reduced by 24.28% and 51.39%, respectively, compared with the prototype before optimization. To obtain a more accurate mathematical model, the computational fluid dynamics (CFD) is introduced to modify the analytical model considering the turbulent submerged free jet. Different from conventional numerical simulation, the dynamic mesh technique is used to analyze the flow field distribution by considering the force interaction of various parts of the jet pipe servo valve under actual working condition. Then, the HEPGA with better convergence is utilized because of the conflict of adjustment and overshoot. This proposed hybrid algorithm introduces the concept of staff welfare system to divide the population into elite individuals and excellent individuals of particle swarm optimization and general individuals of genetic algorithm. Meanwhile, the convergency performance of the HEPGA is evaluated through the Rosenbrock function by comparing with other particle swarm genetic hybrid methods. Subsequently, the experimental platform is constructed and the dynamic performance tests are conducted on the prototype after optimization. The experimental results verify the accuracy of the established mathematical model and the significant improvement of dynamic performance of the jet pipe servo valve. [ABSTRACT FROM AUTHOR]

SI is a relatively recent technology that was inspired by observations of natural social insects and artificial systems. This system comprises multiple individual agents who rely on collective behavior in decentralized and self-organized networks. One of the biggest difficulties for existing computer techniques is learning from such large datasets, which is addressed utilizing big data. Big data-based categorization refers to the challenge of determining which set of classifications a new discovery belongs to. This classification is based on a training set of data that comprises observations that have been assigned to a certain category. In this paper, CIN-big data value calculation based on particle swarm optimization (BD-PSO) algorithm is proposed by operating in local optima and to improve the operating efficiency. The convergence speed of the particle swarm optimization (PSO), which operates in the local optima, is improved by big data-based particle swarm optimization (BD-PSO). It improves computing efficiency by improving the method, resulting in a reduction in calculation time. The performance of the BD-PSO is tested on four benchmark dataset, which is taken from the UCI. The datasets used for evaluation are wine, iris, blood transfusion, and zoo. SVM and CG-CNB are the two existing methods used for the comparison of BD-PSO. It achieves 92% of accuracy, 92% of precision, 92% of recall, and 1.34 of F1 measure, and time taken for execution is 149 ms, which in turn outperforms the existing approaches. It achieves robust solutions and identifies appropriate intelligent technique related to the optimization problem. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of network security situation prediction and the convergence speed of prediction algorithm, this paper proposes a combined prediction model (EMD-ELPSO-BiGRU) based on empirical mode decomposition (EMD) and improved particle swarm optimization (ELPSO) to optimize BiGRU neural network. Firstly, the network security situation data sequence is decomposed into a series of intrinsic mode function by EMD. Then, a particle swarm optimization algorithm (ELPSO) based on cooperative update of evolutionary state judgment and learning strategy is proposed to optimize the hyper-parameters of BiGRU neural network. Finally, a network security situation prediction model based on EMD-ELPSO-BiGRU is constructed to predict each intrinsic mode function, respectively, and the prediction results are superimposed to obtain the final network security situation prediction value. Simulation results show that ELPSO has better optimization performance, and EMD-ELPSO-BiGRU model has higher prediction accuracy and significantly improved convergence speed compared with other traditional prediction methods. [ABSTRACT FROM AUTHOR]

To address the shortcomings of the whale optimization algorithm (WOA) in terms of insufficient global search ability and slow convergence speed, a differential evolution chaotic whale optimization algorithm (DECWOA) is proposed in this paper. Firstly, the initial population is generated by introducing the Sine chaos theory at the beginning of the algorithm to increase the population diversity. Secondly, new adaptive inertia weights are introduced into the individual whale position update formula to lay the foundation for the global search and improve the optimization performance of the algorithm. Finally, the differential variance algorithm is fused to improve the global search speed and accuracy of the whale optimization algorithm. The impact of various improvement strategies on the performance of the algorithm is analyzed using different kinds of test functions that are randomly selected. The particle swarm optimization algorithm (PSO), butterfly optimization algorithm (BOA), WOA, chaotic feedback adaptive whale optimization algorithm (CFAWOA), and DECWOA algorithm are compared for the optimal search performance. Experimental simulations are performed using MATLAB software, and the results show that the improved whale optimization algorithm has a better global optimization-seeking capability. The improved whale optimization algorithm is applied to the distribution network fault location of IEEE-33 nodes, and the effectiveness and accuracy of the distribution network fault zone location based on the multistrategy improved whale optimization algorithm is verified. [ABSTRACT FROM AUTHOR]

As the continous innovation of new media technology, the media environment of the entire society has undergone profound changes. Digital technology has had a profound impact on the way news is disseminated. It has made a significant impact on the collecting, creation, and distribution of news, as well as the way viewers receive it. As a result, the news media's operation and management style is continually modified. However, in the process of news dissemination, the situations involved are complex and changeable, which leads to different digital technology applications. Aiming at different complex situations in news dissemination under the vision of new media art, this work designs a neural network to optimize the distribution for the required digital technology application schemes. The main work of this paper has the following two points. First, it systematically investigates the current research status of news communication based on digital technology and analyzes the research trends of digital technology and news communication in complex contexts under the vision of new media art. Second, a new neural network is proposed for the optimal application of digital technology for news propagation in different complex situations. This neural network uses an improved particle swarm optimization algorithm and an improved network training strategy to improve the BP network, which can effectively solve the shortcomings of the BP network. A large number of experiments have proved the effectiveness and correctness of this method. [ABSTRACT FROM AUTHOR]

With the rapid development of China's social economy, it is the most important task for the water conservancy industry to make use of the existing water conservancy engineering measures to carry out the research on river basin flood control dispatching. Large-scale joint operation of river basins usually needs to consider meteorological and hydrological conditions, historical flood data, multireservoir engineering conditions, and multiple flood control targets, which is a complex decision-making problem. Therefore, electing the optimal operation model of reservoir flood control optimization is very important. In this paper, Luanhe River Basin is taken as the research area, and three kinds of constraints, namely, water balance constraint, reservoir flood control capacity constraint, and water release decision constraint, are set to construct the flood control optimization model. Taking the minimum square of the sum of reservoir discharge and interval flood discharge as the objective function, genetic algorithm (GA), particle swarm optimization (PSO), Spider swarm optimization (SSO), and grey wolf optimization (GWO) are introduced into flood control optimal operation to seek the minimum value of objective function, and the results are compared and analyzed. Through the analysis of optimization results, the optimization ability and convergence effect of grey wolf optimization algorithm are better than those of genetic algorithm and particle algorithm, and the results are more stable than those of spider swarm algorithm. It has a good model structure and can make full use of the results of three wolf groups for optimization. Through the analysis of scheduling results, the results of genetic algorithm and particle swarm optimization algorithm are similar, while those of spider swarm optimization algorithm and grey wolf optimization algorithm are similar and slightly better than those of the first two. Moreover, the search range of grey wolf optimization algorithm for solving long sequence problems is wider and the calculation time is shorter. Therefore, the grey wolf optimization algorithm can be applied to solve the flood control operation optimization model of Panjiakou Reservoir Group. [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 hypercube optimization search (HOS) approach is a new efficient and robust metaheuristic algorithm that simulates the dove's movement in quest of new food sites in nature, utilizing hypercubes to depict the search zones. In medical informatics, the classification of medical data is one of the most challenging tasks because of the uncertainty and nature of healthcare data. This paper proposes the use of the HOS algorithm for training multilayer perceptrons (MLP), one of the most extensively used neural networks (NNs), to enhance its efficacy as a decision support tool for medical data classification. The proposed HOS-MLP model is tested on four significant medical datasets: orthopedic patients, diabetes, coronary heart disease, and breast cancer, to assess HOS's success in training MLP. For verification, the results are compared with eleven different classifiers and eight well-regarded MLP trainer metaheuristic algorithms: particle swarm optimization (PSO), biogeography-based optimizer (BBO), the firefly algorithm (FFA), artificial bee colony (ABC), genetic algorithm (GA), bat algorithm (BAT), monarch butterfly optimizer (MBO), and the flower pollination algorithm (FPA). The experimental results demonstrate that the MLP trained by HOS outperforms the other comparative models regarding mean square error (MSE), classification accuracy, and convergence rate. The findings also reveal that the HOS help the MLP to produce more accurate results than other classification algorithms for the prediction of diseases. [ABSTRACT FROM AUTHOR]

Biorobotic fishes have a huge impact on the development of underwater devices due to both fast swimming speed and great maneuverability. In this paper, an enhanced CPG model is investigated for locomotion control of an elongated undulating fin robot inspired by black knife fish. The proposed CPG network includes sixteen coupled Hopf oscillators for gait generation to mimic fishlike swimming. Furthermore, an enhanced particle swarm optimization (PSO), called differential particle swarm optimization (D-PSO), is introduced to find a set of optimal parameters of the modified CPG network. The proposed D-PSO-based CPG network is not only able to increase the thrust force in order to make the faster swimming speed but also avoid the local maxima for the enhanced propulsive performance of the undulating fin robot. Additionally, a comparison of D-PSO with the traditional PSO and genetic algorithm (GA) has been performed in tuning the parametric values of the CPG model to prove the superiority of the introduced method. The D-PSO-based optimization technique has been tested on the actual undulating fin robot with sixteen fin-rays. The obtained results show that the average propulsive force of the untested material is risen 5.92%, as compared to the straight CPG model. [ABSTRACT FROM AUTHOR]

With the large-scale optimization problems in the real world becoming more and more complex, they also require different optimization algorithms to keep pace with the times. Particle swarm optimization algorithm is a good tool that has been proved to deal with various optimization problems. Conventional particle swarm optimization algorithms learn from two particles, namely, the best position of the current particle and the best position of all particles. This particle swarm optimization algorithm is simple to implement, simple, and easy to understand, but it has a fatal defect. It is hard to find the global optimal solution quickly and accurately. In order to deal with these defects of standard particle swarm optimization, this paper proposes a particle swarm optimization algorithm (SHMPSO) based on the hybrid strategy of seed swarm optimization (using codes available from https://gitee.com/mr-xie123234/code/tree/master/). In SHMPSO, a subpopulation coevolution particle swarm optimization algorithm is adopted. In SHMPSO, an elastic candidate-based strategy is used to find a candidate and realize information sharing and coevolution among populations. The mean dimension learning strategy can be used to make the population converge faster and improve the solution accuracy of SHMPSO. Twenty-one benchmark functions and six industries-recognized particle swarm optimization variants are used to verify the advantages of SHMPSO. The experimental results show that SHMPSO has good convergence speed and good robustness and can obtain high-precision solutions. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth survey and performance evaluation of cat swarm optimization (CSO) algorithm. CSO is a robust and powerful metaheuristic swarm-based optimization approach that has received very positive feedback since its emergence. It has been tackling many optimization problems, and many variants of it have been introduced. However, the literature lacks a detailed survey or a performance evaluation in this regard. Therefore, this paper is an attempt to review all these works, including its developments and applications, and group them accordingly. In addition, CSO is tested on 23 classical benchmark functions and 10 modern benchmark functions (CEC 2019). The results are then compared against three novel and powerful optimization algorithms, namely, dragonfly algorithm (DA), butterfly optimization algorithm (BOA), and fitness dependent optimizer (FDO). These algorithms are then ranked according to Friedman test, and the results show that CSO ranks first on the whole. Finally, statistical approaches are employed to further confirm the outperformance of CSO algorithm. [ABSTRACT FROM AUTHOR]

The financial crisis of listed companies will bring huge losses to investors, so it is very important to establish a financial early warning model for investors and other stakeholders. The forward neural network model of particle swarm optimization is used to model and analyze the financial early warning of listed companies. In terms of data selection, earnings management indicators are substituted into the model for the common phenomenon of earnings management in listed companies. The results show that the accuracy of the model considering earnings management factors is improved from 65% to 70%. In the process of modeling, this paper uses the logistic regression model to further modify the model. The empirical results show that the accuracy of the model can be improved from 70% to 75%. When using the forward neural network model based on particle swarm optimization to make an empirical analysis of financial early warning of listed companies, adding quantitative indicators of earnings management can improve the accuracy of the model. In the demonstration, the correction of logistic regression model can also improve the accuracy of the particle swarm neural network financial early warning model. This greatly reduces the risk that companies with poor financial conditions will face bankruptcy and liquidation. [ABSTRACT FROM AUTHOR]

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

In this paper, a novel swarm-based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank-sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms. [ABSTRACT FROM AUTHOR]

The particle swarm optimization algorithm (PSO) is a meta-heuristic algorithm with swarm intelligence. It has the advantages of easy implementation, high convergence accuracy, and fast convergence speed. However, PSO suffers from falling into a local optimum or premature convergence, and a better performance of PSO is desired. Some methods adopt improvements in PSO parameters, particle initialization, or topological structure to enhance the global search ability and performance of PSO. These methods contribute to solving the problems above. Inspired by them, this paper proposes a variant of PSO with competitive performance called UCPSO. UCPSO combines three effective improvements: a cosine inertia weight, uniform initialization, and a rank-based strategy. The cosine inertia weight is an inertia weight in the form of a variable-period cosine function. It adopts a multistage strategy to balance exploration and exploitation. Uniform initialization can prevent the aggregation of initial particles. It distributes initial particles uniformly to avoid being trapped in a local optimum. A rank-based strategy is employed to adjust an individual particle's inertia weight. It enhances the swarm's capabilities of exploration and exploitation at the same time. Comparative experiments are conducted to validate the effectiveness of the three improvements. Experiments show that the UCPSO improvements can effectively improve global search ability and performance. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The recently proposed multiobjective particle swarm optimization algorithm based on competition mechanism algorithm cannot effectively deal with many-objective optimization problems, which is characterized by relatively poor convergence and diversity, and long computing runtime. In this paper, a novel multi/many-objective particle swarm optimization algorithm based on competition mechanism is proposed, which maintains population diversity by the maximum and minimum angle between ordinary and extreme individuals. And the recently proposed θ -dominance is adopted to further enhance the performance of the algorithm. The proposed algorithm is evaluated on the standard benchmark problems DTLZ, WFG, and UF1-9 and compared with the four recently proposed multiobjective particle swarm optimization algorithms and four state-of-the-art many-objective evolutionary optimization algorithms. The experimental results indicate that the proposed algorithm has better convergence and diversity, and its performance is superior to other comparative algorithms on most test instances. [ABSTRACT FROM AUTHOR]

This paper presents a variant of multiscale quantum harmonic oscillator algorithm for multimodal optimization named MQHOA-MMO. MQHOA-MMO has only two main iterative processes: quantum harmonic oscillator process and multiscale process. In the two iterations, MQHOA-MMO only does one thing: sampling according to the wave function at different scales. A set of benchmark test functions including some challenging functions are used to test the performance of MQHOA-MMO. Experimental results demonstrate good performance of MQHOA-MMO in solving multimodal function optimization problems. For the 12 test functions, all of the global peaks can be found without being trapped in a local optimum, and MQHOA-MMO converges within 10 iterations. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) and fireworks algorithm (FWA) are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which employs the master swarm and the slave swarm with different learning patterns to achieve a trade-off between the convergence speed and the swarm diversity. The particles in the master swarm and the slave swarm are encouraged to explore search for keeping the swarm diversity and to learn from the global best particle for refining a promising solution, respectively. When the evolutionary states of two swarms interact, an interaction mechanism is enabled. This mechanism can help the slave swarm in jumping out of the local optima and improve the convergence precision of the master swarm. The proposed PSO-DLP is evaluated on 20 benchmark functions, including rotated multimodal and complex shifted problems. The simulation results and statistical analysis show that PSO-DLP obtains a promising performance and outperforms eight PSO variants. [ABSTRACT FROM AUTHOR]

In order to improve convergence velocity and optimization accuracy of the cuckoo search (CS) algorithm for solving the function optimization problems, a new improved cuckoo search algorithm based on the repeat-cycle asymptotic self-learning and self-evolving disturbance (RC-SSCS) is proposed. A disturbance operation is added into the algorithm by constructing a disturbance factor to make a more careful and thorough search near the bird’s nests location. In order to select a reasonable repeat-cycled disturbance number, a further study on the choice of disturbance times is made. Finally, six typical test functions are adopted to carry out simulation experiments, meanwhile, compare algorithms of this paper with two typical swarm intelligence algorithms particle swarm optimization (PSO) algorithm and artificial bee colony (ABC) algorithm. The results show that the improved cuckoo search algorithm has better convergence velocity and optimization accuracy. [ABSTRACT FROM AUTHOR]

This paper presents a comparative study of fuzzy controller design for the twin rotor multi-input multioutput (MIMO) system (TRMS) considering most promising evolutionary techniques. These are gravitational search algorithm (GSA), particle swarm optimization (PSO), artificial bee colony (ABC), and differential evolution (DE). In this study, the gains of four fuzzy proportional derivative (PD) controllers for TRMS have been optimized using the considered techniques. The optimization techniques are developed to identify the optimal control parameters for system stability enhancement, to cancel high nonlinearities in the model, to reduce the coupling effect, and to drive TRMS pitch and yaw angles into the desired tracking trajectory efficiently and accurately. The most effective technique in terms of system response due to different disturbances has been investigated. In this work, it is observed that GSA is the most effective technique in terms of solution quality and convergence speed. [ABSTRACT FROM AUTHOR]