Search

Edge computing enables portable devices to provide smart applications, and the indoor positioning technique offers accurate location-based indoor navigation and personalized smart services. To achieve the high positioning accuracy, an indoor positioning algorithm based on particle filter requires a large number of sample particles to approximate the probability density function, which leads to the additional computational cost and high fusion delay. Focusing on real-time and accurate positioning, an edge computing-enabled green multi-source fusion indoor positioning algorithm called APFP is proposed based on adaptive particle filter in this paper. APFP considers both pedestrian dead reckoning (PDR) signals in mobile terminals and the received signal strength indication (RSSI) of Bluetooth, and effectively merges the error-free accumulation of trilateral positioning and the accurate short-range positioning of PDR, which enables mobile terminals adaptively perform particle filter to reduce the computing time and power consumption while ensuring positioning accuracy simultaneously. Detailed experimental results show that, compared with the traditional particle filter algorithm and the map-constrained algorithm, the proposed APFP reduces fusion computing cost by 59.89% and 54.37%, respectively. [ABSTRACT FROM AUTHOR]

Shuffled frog-leaping algorithm (SFLA) is recently introduced memetic algorithm inspired by foraging behavior of frogs. SFLA partially follows particle swarm optimization in local search process and shuffled complex evolution algorithm in performing global search. The key concept about such algorithms is to gain an edge over traditional or deterministic mathematical techniques to achieve comparatively better solutions to the multimodal or multifaceted optimization problems. SFLA embeds the features of both particle swarm optimization (PSO) and shuffled complex evolution (SCE) algorithm. In this study SFLA named as O-SFLA is proposed. In general structure of SFLA, the frogs are divided into memeplexes based on their fitness values where they forage for food. In this study the opposition based learning concept is embedded into the memeplexes before the frog initiates foraging. The proposal is validated on performance optimization of the Paper Mill. [ABSTRACT FROM AUTHOR]

S-box is the only non-linear device in the cryptographic algorithm, and its quality determines the lower limit strength of the cryptographic algorithm. However, because the image data is highly correlated, the traditional encryption methods and their S-boxes, such as AES and DES are not suitable for using in image encryption. Based on this, this paper proposes an S-box generation algorithm based on a 4D hyperchaotic system and improved particle swarm optimization. Firstly, this paper improves on the Lorenz chaotic system and proposes a 4D hyperchaotic system with a higher Lyapunov exponent and more complex dynamics. Secondly, the idea of simulated annealing algorithm is introduced into the particle swarm optimization algorithm, which further improves the efficiency of the particle swarm optimization algorithm and improves the problem that the particle swarm optimization algorithm is easy to fall into the local optimal solution. Then an improved particle swarm optimization algorithm is used to optimize the nonlinearity of the S-box to improve the performance of the S-box. Finally, use the generated S-box to design an image encryption algorithm and prove the security of the S-box. The experimental results show that the S-box designed in this paper has excellent performance in the five indicators of Nonlinearity, SAC, BIC-NL, LP, and DP. At the same time, the encryption result can resist common attacks, so it has strong multimedia security. [ABSTRACT FROM AUTHOR]

Cryo-electron micrograph images have various characteristics such as varying sizes, shapes, and distribution densities of individual particles, severe background noise, high levels of impurities, irregular shapes, blurred edges, and similar color to the background. How to demonstrate good adaptability in the field of image vision by picking up single particles from multiple types of cryo-electron micrographs is currently a challenge in the field of cryo-electron micrographs. This paper combines the characteristics of the MixUp hybrid enhancement algorithm, enhances the image feature information in the pre-processing stage, builds a feature perception network based on the channel self-attention mechanism in the forward network of the Swin Transformer model network, achieving adaptive adjustment of self-attention mechanism between different single particles, increasing the network's tolerance to noise, Incorporating PReLU activation function to enhance information exchange between pixel blocks of different single particles, and combining the Cross-Entropy function with the softmax function to construct a classification network based on Swin Transformer suitable for cryo-electron micrograph single particle detection model (Swin-cryoEM), achieving mixed detection of multiple types of single particles. Swin-cryoEM algorithm can better solve the problem of good adaptability in picking single particles of many types of cryo-electron micrographs, improve the accuracy and generalization ability of the single particle picking method, and provide high-quality data support for the three-dimensional reconstruction of a single particle. In this paper, ablation experiments and comparison experiments were designed to evaluate and compare Swin-cryoEM algorithms in detail and comprehensively on multiple datasets. The Average Precision is an important evaluation index of the evaluation model, and the optimal Average Precision reached 95.5% in the training stage Swin-cryoEM, and the single particle picking performance was also superior in the prediction stage. This model inherits the advantages of the Swin Transformer detection model and is superior to mainstream models such as Faster R-CNN and YOLOv5 in terms of the single particle detection capability of cryo-electron micrographs. [ABSTRACT FROM AUTHOR]

Lithium-ion batteries are widely used in power grids as a common form of energy storage in power stations. The state of charge (SOC) and state of health (SOH) reflect the capacity and lifetime variation in the Li-ion batteries, and they are important state parameters of Li-ion batteries. Therefore, the establishment of accurate SOC and SOH prediction models is an essential prerequisite for the correct assessment of the status of lithium batteries, the improvement of the operational accuracy of energy-storage stations, and the development of maintenance plans for energy-storage stations. This paper first analyzes the correlation between SOC and SOH, and then proposes a joint SOC and SOH prediction model using the particle swarm optimization (PSO) algorithm to optimize the extreme gradient boosting algorithm (XGBoost), which takes into account the dynamic correlation between SOC and SOH dynamics, thus enabling more accurate SOC and SOH prediction. Finally, the prediction model is validated using the Oxford battery aging dataset. The correlation between SOC and SOH is verified by comparing the joint prediction results with the SOC individual prediction results. Then, the prediction results of the PSO-XGBoost model, the traditional XGBoost model, and the long short-term memory neural network are compared to verify the effectiveness and accuracy of the PSO-XGBoost model. [ABSTRACT FROM AUTHOR]

Most models of quantum neural networks are optimized based on gradient descent, and like classical neural networks, gradient descent suffers from the barren plateau phenomenon, which reduces the effectiveness of optimization. Therefore, this paper establishes a new QNN model, the optimization process adopts efficient quantum particle swarm optimization, and tentatively adds a quantum activation circuit to our QNN model. Our model will inherit the superposition property of quantum and the random search property of quantum particle swarm. Simulation experiments on some classification data show that the model proposed in this paper has higher classification performance than the gradient descent-based QNN. [ABSTRACT FROM AUTHOR]

The optimization and allocation of transport cost savings among stakeholders are two important issues that influence the satisfaction of information providers, drivers and passengers in ridesharing recommendation systems. For optimization issues, finding optimal solutions for nonconvex constrained discrete ridesharing optimization problems poses a challenge due to computational complexity. For the allocation of transport cost savings issues, the development of an effective method to allocate cost savings in ridesharing recommendation systems is an urgent need to improve the acceptability of ridesharing. The hybridization of different metaheuristic approaches has demonstrated its advantages in tackling the complexity of optimization problems. The principle of the hybridization of metaheuristic approaches is similar to a marriage of two people with the goal of having a happy ending. However, the effectiveness of hybrid metaheuristic algorithms is unknown a priori and depends on the problem to be solved. This is similar to a situation where no one knows whether a marriage will have a happy ending a priori. Whether the hybridization of the Firefly Algorithm (FA) with Particle Swarm Optimization (PSO) or Differential Evolution (DE) can work effectively in solving ridesharing optimization problems needs further study. Motivated by deficiencies in existing studies, this paper focuses on the effectiveness of hybrid metaheuristic algorithms for solving ridesharing problems based on the hybridization of FA with PSO or the hybridization of FA with DE. Another focus of this paper is to propose and study the effectiveness of a new method to allocate ridesharing cost savings to the stakeholders in ridesharing systems. The developed hybrid metaheuristic algorithms and the allocation method have been compared with examples of several application scenarios to illustrate their effectiveness. The results indicate that hybridizing FA with PSO creates a more efficient algorithm, whereas hybridizing FA with DE does not lead to a more efficient algorithm for the ridesharing recommendation problem. An interesting finding of this study is very similar to what happens in the real world: "Not all marriages have happy endings". [ABSTRACT FROM AUTHOR]

In the era of network communication, digital image encryption (DIE) technology is critical to ensure the security of image data. However, there has been limited research on combining deep learning neural networks with chaotic mapping for the encryption of digital images. So, this paper addresses this gap by studying the generation of pseudo-random sequences (PRS) chaotic signals using dual logistic chaotic maps. These signals are then predicted using long and short-term memory (LSTM) networks, resulting in the reconstruction of a new chaotic signal. During the research process, it was discovered that there are numerous training parameters associated with the LSTM network, which can hinder training efficiency. To overcome this challenge and improve training efficiency, the paper proposes an improved particle swarm optimization (IPSO) algorithm to optimize the LSTM network. Subsequently, the obtained chaotic signal from the optimized model training is further scrambled, obfuscated, and diffused to achieve the final encrypted image. This research presents a digital image encryption (DIE) algorithm based on a double chaotic map (DCM) and LSTM. The algorithm demonstrates a high average NPCR (Number of Pixel Change Rate) of 99.56% and a UACI (Unified Average Changing Intensity) value of 33.46%, indicating a strong ability to resist differential attacks. Overall, the proposed algorithm realizes secure and sensitive digital image encryption, ensuring the protection of personal information in the Internet environment. [ABSTRACT FROM AUTHOR]

Conventionally, researchers have favored the model-based control scheme for controlling gantry crane systems. However, this method necessitates a substantial investment of time and resources in order to develop an accurate mathematical model of the complex crane system. Recognizing this challenge, the current paper introduces a novel data-driven control scheme that relies exclusively on input and output data. Undertaking a couple of modifications to the conventional marine predators algorithm (MPA), random average marine predators algorithm (RAMPA) with tunable adaptive coefficient to control the step size (CF) has been proposed in this paper as an enhanced alternative towards fine-tuning data-driven multiple-node hormone regulation neuroendocrine-PID (MnHR-NEPID) controller parameters for the multi-input–multi-output (MIMO) gantry crane system. First modification involved a random average location calculation within the algorithm's updating mechanism to solve the local optima issue. The second modification then introduced tunable CF that enhanced search capacity by enabling users' resilience towards attaining an offsetting level of exploration and exploitation phases. Effectiveness of the proposed method is evaluated based on the convergence curve and statistical analysis of the fitness function, the total norms of error and input, Wilcoxon's rank test, time response analysis, and robustness analysis under the influence of external disturbance. Comparative findings alongside other existing metaheuristic-based algorithms confirmed excellence of the proposed method through its superior performance against the conventional MPA, particle swarm optimization (PSO), grey wolf optimizer (GWO), moth-flame optimization (MFO), multi-verse optimizer (MVO), sine-cosine algorithm (SCA), salp-swarm algorithm (SSA), slime mould algorithm (SMA), flow direction algorithm (FDA), and the formally published adaptive safe experimentation dynamics (ASED)-based methods. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms (MHA) play a significant role in obtaining the best (optimal) values of the system's parameters to improve its performance. This role is significantly apparent when dealing with systems where the classical analytical methods fail. Fractional-order (FO) systems have not yet shown an easy procedure to deal with the determination of their optimal parameters through traditional methods. In this paper, a recent, systematic. And comprehensive review is presented to highlight the role of MHA in obtaining the best set of gains and orders for FO controllers. The systematic review starts by exploring the most relevant publications related to the MHA and the FO controllers. The study is focused on the most popular controllers such as the FO-PI, FO-PID, FO Type-1 fuzzy-PID, and FO Type-2 fuzzy-PID. The time domain is restricted in the articles published through the last decade (2014:2023) in the most reputed databases such as Scopus, Web of Science, Science Direct, and Google Scholar. The identified number of papers, from the entire databases, has reached 850 articles. A Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology was applied to the initial set of articles to be screened and filtered to end up with a final list that contains 82 articles. Then, a thorough and comprehensive study was applied to the final list. The results showed that Particle Swarm Optimization (PSO) is the most attractive optimizer to the researchers to be used in the optimal parameters identification of the FO controllers as it attains about 25% of the published papers. In addition, the papers that used PSO as an optimizer have gained a high citation number despite the fact that the Chaotic Atom Search Optimization (ChASO) is the highest one, but it is used only once. Furthermore, the Integral of the Time-Weighted Absolute Error (ITAE) is the best nominated cost function. Based on our comprehensive literature review, this appears to be the first review paper that systematically and comprehensively addresses the optimization of the parameters of the fractional-order PI, PID, Type-1, and Type-2 fuzzy controllers with the use of MHAs. Therefore, the work in this paper can be used as a guide for researchers who are interested in working in this field. [ABSTRACT FROM AUTHOR]

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

Among the indoor localization algorithms, the algorithm based on traditional Back Propagation Neural Network (BPNN) has the problems of slow convergence and easy to fall into local optimum. It is difficult to apply the algorithm in noisy environments. Therefore, in this paper, we propose a novel indoor localization algorithm where the whole localization process is divided into two parts: data preprocessing and localization output. Data preprocessing means using filtering algorithm to process the Received Signal Strength Indication (RSSI) sequence. It is considered that the initial value of the received sequence has a significant impact on the performance of Kalman Filter (KF). An improved Kalman Filtering algorithm (DBSCAN-KF) is proposed based on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. First, the RSSI values that are seriously disturbed by noise in the sequence are removed using the DBSCAN algorithm, and then the RSSI sequences are processed using KF so that the RSSI values can be closer to the theoretical values. The localization output part is to reduce the localization error caused by the BPNN. In this paper, the Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm are combined, and the Differential Evolution Particle Swarm Optimization (DE-PSO) algorithm is proposed. The BPNN weights and thresholds are optimized in parallel, which improves the speed and ability of global optimization search and further avoids the shortcomings of traditional BPNNs that are prone to fall into local optimization in the training process. Experimental results show that the BPNN localization algorithm based on DBSCAN-KF improves the average localization accuracy by 0.26m compared with the BPNN localization algorithm without filtering. After filtering, the localization algorithm based on DE-PSO improved BPNN (DE-PSO-BP) improves the average localization accuracy by about 24% compared with the localization algorithm based on DE-PSO-BP. The localization algorithm based on DE-PSO-BP improves the average localization accuracy by about 61% compared with the traditional BPNN. [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]

In the current complex cyber environment, malicious attacks take various forms and constantly change. To overcome the problems of low detection efficiency and high false alarm rate in traditional intrusion detection techniques, a new method of network intrusion detection combining the variable scale chaos bat (MSCB) algorithm and BP neural network (BPNN) called MSCB-BPNN is proposed in this paper. In the proposed approach, a new MSCB algorithm is proposed to improve the BPNN by optimizing its thresholds and weights so as to prevent it from falling into local optimum. To verify the practical classification performance of the proposed method for intrusion detection, some experiments are carried out. In these experiments, the proposed approach is compared with BPNN, SA-BPNN, and GA-BPNN on the benchmark intrusion detection datasets KDD cup 99 and UNSW-NB15. The experimental results show that the accuracy of the proposed method can reach 99.4% and 99.8% accuracy on the KDD cup 99 training and test sets, respectively, while 89.0% and 93.9% accuracy on the UNSW-NB15 training and test sets, respectively, which are higher than BPNN, SA-BPNN, and GA-BPNN. Furthermore, the precision and recall ratio of MSCB-BPNN are also superior to other approaches. Thus, the proposed model has significant advantages over BPNN, SA-BPNN, and GA-BPNN methods. [ABSTRACT FROM AUTHOR]

In recent days, the major concern for diabetic patients is foot ulcers. According to the survey, among 15 people among 100 are suffering from this foot ulcer. The wound or ulcer found which is found in diabetic patients consumes more time to heal, also required more conscious treatment. Foot ulcers may lead to deleterious danger condition and also may be the cause for loss of limb. By understanding this grim condition, this paper proposes Fractional-Order Darwinian Particle Swarm Optimization (FO-DPSO) technique for analyzing foot ulcer 2D color images. This paper deals with standard image processing, i.e. efficient segmentation using FO-DPSO algorithm and extracting textural features using Gray Level Co-occurrence Matrix (GLCM) technique. The whole effort projected results as accuracy of 91.2%, sensitivity of 100% and specificity as 96.7% for Naïve Bayes classifier and accuracy of 91.2%, sensitivity of 100% and sensitivity of 79.6% for Hoeffding tree classifier. [ABSTRACT FROM AUTHOR]

In recent years, the cuckoo search (CS) algorithm has been successfully applied to single-objective optimization problems. But in real life, most optimization problems are multi-objective optimization problems (MOPs). In order to enable CS to better solve MOPs, this paper proposes an elite-guided multi-objective cuckoo search algorithm based on cross-operation and information enhancement (CIE-MOCS). This algorithm first enhances its population diversity through crossover operation, then adds elite individuals to guide its update process to speed up the algorithm convergence speed. Finally, the method of information enhancement is adopted in the abandonment process, so that the algorithm is not easy to fall into the local optimum. In order to verify the performance of the algorithm, this paper uses a variety of benchmark functions and performance evaluation indicators to evaluate it, and provides a case to verify the effectiveness of the algorithm in practical applications. The experimental results show that CIE-MOCS has good performance compared with the contrasting algorithms. [ABSTRACT FROM AUTHOR]

For underwater target exploration, multiple Autonomous Underwater Vehicles (AUVs) have shown significant advantages over single AUVs. Aiming at Multi-AUV task allocation, which is an important issue for collaborative work in underwater environments, this paper proposes a Multi-AUV task allocation method based on the Differential Evolutionary Gray Wolf Optimization (DE-GWO) algorithm. Firstly, the working process of the Multi-AUV system was analyzed, and the allocation model and objective function were established. Then, we combined the advantages of the strong global search capability of the Differential Evolutionary (DE) algorithm and the excellent convergence performance of Gray Wolf Optimization (GWO) to solve the task assignment of the Multi-AUV system. Finally, a reassignment mechanism was used to solve the problem of AUV failures during the task's execution. In the simulation comparison experiments, the DE-GWO, GWO, DE, and Particle Swarm Optimization (PSO) algorithms were carried out for different AUV execution capabilities, respectively. [ABSTRACT FROM AUTHOR]

Recently, there had been a massive group of people, who were being rapidly affected by melanoma. Melanoma is a form of skin cancer that develops on the skin's surface layer. This is primarily caused due to excessive skin exposure to UV radiation and severe sunburns. Thus, the early detection of melanoma can aid us to cure it completely. This paper intends to introduce a new melanoma detection framework with four main phases viz. segmentation, feature extraction, optimal feature selection, as well as detection. Initially, the segmentation process takes place to the input skin image via Fuzzy C-Means Clustering (FCM) approach. From the segmented image ( Im seg ) , some of the features such as Gray Level Run Length Matrix (GLRM), Local Vector Pattern (LVP), Local Binary Pattern (LBP), Local Directional Pattern (LDP) and Local Tetra Pattern (LTrP) are extracted. As the extracted features (F) suffered from the issue of "curse of dimensionality", this paper utilizes optimization to select optimal features, which makes the detection more precise. As a novelty, a new hybrid algorithm Particle-Assisted Moth Search Algorithm (PA-MSA) is introduced that hybridizes the concept of Moth Search Algorithm (MSA) and Particle Swarm Optimization (PSO), respectively. For the classification process, the optimally chosen features (F opt ) are fed as input, where Deep Convolution Neural Network (DCNN) is used. Finally, a performance-based comparative analysis is conducted among the proposed PA-MSA as well as the existing models with respect to various measures. [ABSTRACT FROM AUTHOR]

In complex two-dimensional monitoring environments, how to enhance network efficiency and network lifespan while utilizing limited energy resources, and ensuring that wireless sensor networks achieve the required partial coverage of the monitoring area, are the challenges of optimizing coverage in wireless sensor networks.With the premise of ensuring connectivity in the target network area, an enhanced multi-objective salp swarm algorithm based on non-dominated sorting (EMSSA) is proposed in this paper, by jointly optimizing network coverage, node utilization, and network energy balance objectives. Firstly, the logistic chaotic mapping is used to maintain the diversity of the initial salp swarm population. Secondly, to balance global and local search capabilities, a new dynamic convergence factor is introduced. Finally, to escape local optima more effectively, a follower updating strategy is implemented to reduce the blind following of followers while retaining superior individual information. The effectiveness of the strategy is validated through comparative experiments on ZDT and DTLZ test functions, and the proposed algorithm is applied to coverage optimization in WSNs in complex environments. The results demonstrate that the algorithm can adjust coverage thresholds according to different application requirements, providing various effective coverage optimization configurations. With the same preset requirements for partial coverage achieved, both network efficiency and lifespan have been significantly improved. [ABSTRACT FROM AUTHOR]

In this paper, solving the problem of the noise covariance matrix parameters tuning of the extended Kalman filter (EKF) and unscented Kalman filter algorithms (UKF) is difficult. A speed estimation strategy for a permanent magnet synchronous motor (PMSM) based on particle swarm optimization (PSO) optimized Kalman filter (KF) series algorithms is proposed. By using MATLAB/Simulink, in this paper, 20 effective simulation experiments on the noise covariance matrix parameter optimization process are conducted to obtain the optimal covariance matrix parameters of the extended Kalman filter and unscented Kalman filter. Moreover, EKF, PSO-EKF, UKF, and PSO-UKF are also compared to verify the effectiveness of the particle swarm optimization algorithm in optimizing the systems using the extended Kalman filter and unscented Kalman filter. For the error of speed estimation, taking 4000 rpm as a reference, the system using PSO-EKF has improved by 2.125% compared to that using EKF, and the system applying PSO-UKF has improved by 0.55% compared to the system applying UKF. For the error of electrical angle estimation, taking the system errors of original algorithms as references, the system adopting PSO-EKF has decreased by 60% compared to that adopting EKF, and the system using PSO-UKF has decreased by 47% compared to the system using UKF. [ABSTRACT FROM AUTHOR]

Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]

Spam emails have become a pervasive issue in recent years, as internet users receive increasing amounts of unwanted or fake emails. To combat this issue, automatic spam detection methods have been proposed, which aim to classify emails into spam and non-spam categories. Machine learning techniques have been utilized for this task with considerable success. In this paper, we introduce a novel approach to spam email detection by presenting significant advancements to the Dandelion Optimizer (DO) algorithm. The DO is a relatively new nature-inspired optimization algorithm inspired by the flight of dandelion seeds. While the DO shows promise, it faces challenges, especially in high-dimensional problems such as feature selection for spam detection. Our primary contributions focus on enhancing the DO algorithm. Firstly, we introduce a new local search algorithm based on flipping (LSAF), designed to improve the DO's ability to find the best solutions. Secondly, we propose a reduction equation that streamlines the population size during algorithm execution, reducing computational complexity. To showcase the effectiveness of our modified DO algorithm, which we refer to as the Improved DO (IDO), we conduct a comprehensive evaluation using the Spam base dataset from the UCI repository. However, we emphasize that our primary objective is to advance the DO algorithm, with spam email detection serving as a case study application. Comparative analysis against several popular algorithms, including Particle Swarm Optimization (PSO), the Genetic Algorithm (GA), Generalized Normal Distribution Optimization (GNDO), the Chimp Optimization Algorithm (ChOA), the Grasshopper Optimization Algorithm (GOA), Ant Lion Optimizer (ALO), and the Dragonfly Algorithm (DA), demonstrates the superior performance of our proposed IDO algorithm. It excels in accuracy, fitness, and the number of selected features, among other metrics. Our results clearly indicate that the IDO overcomes the local optima problem commonly associated with the standard DO algorithm, owing to the incorporation of LSAF and the reduction in equation methods. In summary, our paper underscores the significant advancement made in the form of the IDO algorithm, which represents a promising approach for solving high-dimensional optimization problems, with a keen focus on practical applications in real-world systems. While we employ spam email detection as a case study, our primary contribution lies in the improved DO algorithm, which is efficient, accurate, and outperforms several state-of-the-art algorithms in various metrics. This work opens avenues for enhancing optimization techniques and their applications in machine learning. [ABSTRACT FROM AUTHOR]

The metaheuristic algorithms are widely used in solving the parameters of the optimization problem. The marine predators algorithm (MPA) is a novel population-based intelligent algorithm. Although MPA has shown a talented foraging strategy, it still needs a balance of exploration and exploitation. Therefore, a multi-stage improvement of marine predators algorithm (MSMPA) is proposed in this paper. The algorithm retains the advantage of multistage search and introduces a linear flight strategy in the middle stage to enhance the interaction between predators. Predators further away from the historical optimum are required to move, increasing the exploration capability of the algorithm. In the middle and late stages, the search mechanism of particle swarm optimization (PSO) is inserted, which enhances the exploitation capability of the algorithm. This means that the stochasticity is decreased, that is the optimal region where predators jumping out is effectively stifled. At the same time, self-adjusting weight is used to regulate the convergence speed of the algorithm, which can balance the exploration and exploitation capability of the algorithm. The algorithm is applied to different types of CEC2017 benchmark test functions and three multidimensional nonlinear structure design optimization problems, compared with other recent algorithms. The results show that the convergence speed and accuracy of MSMPA are significantly better than that of the comparison algorithms. [ABSTRACT FROM AUTHOR]

The Honey Badger Algorithm (HBA) is a novel meta-heuristic algorithm proposed recently inspired by the foraging behavior of honey badgers. The dynamic search behavior of honey badgers with sniffing and wandering is divided into exploration and exploitation in HBA, which has been applied in photovoltaic systems and optimization problems effectively. However, HBA tends to suffer from the local optimum and low convergence. To alleviate these challenges, an improved HBA (IHBA) through fusing multi-strategies is presented in the paper. It introduces Tent chaotic mapping and composite mutation factors to HBA, meanwhile, the random control parameter is improved, moreover, a diversified updating strategy of position is put forward to enhance the advantage between exploration and exploitation. IHBA is compared with 7 meta-heuristic algorithms in 10 benchmark functions and 5 engineering problems. The Wilcoxon Rank-sum Test, Friedman Test and Mann-Whitney U Test are conducted after emulation. The results indicate the competitiveness and merits of the IHBA, which has better solution quality and convergence traits. [ABSTRACT FROM AUTHOR]

As is well known that the global optimization ability of the Fruit fly Optimization Algorithm (FOA)is weak because it is easy to fall into local optimum. In this paper, a Fruit Fly Optimization Algorithm based on Locality Sensitive Hashing-aware (LSHFOA)was proposed. The locality sensitive hashing mechanism to optimize the generation mechanism for swarm population individuals was used, which can improve the individual diversity of the population. Meanwhile, when the fruit fly population falls into the local optimum, the locality sensitive hashing mechanism was adopted to change the population location, which is used for jumping out of local optimal limits. To verify the performance of LSHFOA, it was compared with FOA and its improvement algorithms CFOA, and IFFO with 8 representative benchmark functions. A large number of experimental results showed that LSHFOA has a faster convergence speed and higher precision of optimization for function optimization, especially in high-dimensional multi-peak functions. In addition to the theoretical evaluation, we also evaluate its performance in a real-world scenario. Generally, an edge computing environment, as an extension of cloud computing, can allow the users to access the network in a low-latency manner. In this way, to capture the high-speed convergence advantage, this paper makes the first attempt to tackle a classic research problem in the edge computing environment, i.e., the edge server placement problem. The experimental results show that the new algorithm has an excellent application effect. [ABSTRACT FROM AUTHOR]

In CNC toolpath generation process, the operation of linking toolpaths from different sub-machining regions is common and inevitable. Apparently, the jumping toolpath between machining regions is invalid. They do not contribute to the machining process but only waste valuable manufacturing time; therefore, these toolpaths should be as short as possible. Many methods have been used to link toolpaths, such as the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO) or even the greedy algorithm. However, GA and PSO require multiple iterations to find the global optimum, while greedy algorithm selects the current shortest connection each time without considering the global optimum. To reduce the total length of non-productive toolpaths and save computing time, in this paper, a new method is proposed by modeling the toolpath linking problem purely as a traveling salesman problem (TSP). The initial toolpaths in different subregions are generated in ordinary ways. Each toolpath of a subregion has two endpoints, which can be simplified as a line segment. In this way, the toolpath linking problem can be considered as a segment TSP: finding the shortest tour through all the segments. In this paper, the efficient TSP solver using Lin-Kernighan–Helsgaun (LKH) algorithm is employed and modified for the segment TSP application. The distance function between 'cities' is redefined to adapt the segments TSP. Finally, the feasibility of the proposed method is verified with several examples. The comparison with the result of traditional greedy algorithm proves the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

The various applications of bearing-only sensor networks for detection and localization are becoming increasingly widespread and important. The array layout of the bearing-only sensor network seriously impacts the detection performance. This paper proposes a multi-strategy fusion improved adaptive mayfly algorithm (MIAMA) in a bearing-only sensor network to perform layout planning on the geometric configuration of the optimal detection. Firstly, the system model of a bearing-only sensor network was constructed, and the observability of the system was analyzed based on the Cramer–Rao Lower Bound and Fisher Information Matrix. Then, in view of the limitations of the traditional mayfly algorithm, which has a single initial population and no adaptability and poor global search capabilities, multi-strategy fusion improvements were carried out by introducing Tent chaos mapping, the adaptive inertia weight factor, and Random Opposition-based Learning. Finally, three simulation experiments were conducted. Through comparison with the Particle Swarm Optimization (PSO) algorithm, Mayfly Algorithm (MA), and Genetic Algorithm (GA), the effectiveness and superiority of the proposed MIAMA were validated. [ABSTRACT FROM AUTHOR]

Deepfakes are digital audio, video, or images manipulated using machine learning algorithms. These manipulated media files can convincingly depict individuals doing or saying things they never actually did. Deepfakes pose significant risks to our lives, including national security, financial markets, and personal privacy. The ability to create convincing deep fakes can also harm individuals' reputations and can be used to spread disinformation and fake news. As such, there is a growing need for reliable and accurate methods to detect deep fakes and prevent their harmful effects. In this paper, a hybrid convolutional neural network (CNN) and recurrent neural network (RNN) with a particle swarm optimization (PSO) algorithm is utilized to demonstrate a deep learning strategy for detecting deepfake videos. High accuracy, sensitivity, specificity, and F1 score were attained by the proposed approach when tested on two publicly available datasets: Celeb-DF and the Deepfake Detection Challenge Dataset (DFDC). Specifically, the proposed method achieved an average accuracy of 97.26% on Celeb-DF and an average accuracy of 94.2% on DFDC. The results were compared to other state-of-the-art methods and showed that the proposed method outperformed many. The proposed method can effectively detect deepfake videos, which is essential for identifying and preventing the spread of manipulated content online. [ABSTRACT FROM AUTHOR]

The objective of task allocation in unmanned systems is to complete tasks at minimal costs. However, the current algorithms employed for coordinating multiple unmanned systems in task allocation tasks frequently converge to local optima, thus impeding the identification of the best solutions. To address these challenges, this study builds upon the sheep flock optimization algorithm (SFOA) by preserving individuals eliminated during the iterative process within a prior knowledge set, which is continuously updated. During the reproduction phase of the algorithm, this prior knowledge is utilized to guide the generation of new individuals, preventing their rapid reconvergence to local optima. This approach aids in reducing the frequency at which the algorithm converges to local optima, continually steering the algorithm towards the global optimum and thereby enhancing the efficiency of task allocation. Finally, various task scenarios are presented to evaluate the performances of various algorithms. The results show that the algorithm proposed in this paper is more likely than other algorithms to escape from local optima and find the global optimum. [ABSTRACT FROM AUTHOR]

With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time. [ABSTRACT FROM AUTHOR]

Background: Cancer diagnosis based on machine learning has become a popular application direction. Support vector machine (SVM), as a classical machine learning algorithm, has been widely used in cancer diagnosis because of its advantages in high-dimensional and small sample data. However, due to the high-dimensional feature space and high feature redundancy of gene expression data, SVM faces the problem of poor classification effect when dealing with such data. Methods: Based on this, this paper proposes a hybrid feature selection algorithm combining information gain and grouping particle swarm optimization (IG-GPSO). The algorithm firstly calculates the information gain values of the features and ranks them in descending order according to the value. Then, ranked features are grouped according to the information index, so that the features in the group are close, and the features outside the group are sparse. Finally, grouped features are searched using grouping PSO and evaluated according to in-group and out-group. Results: Experimental results show that the average accuracy (ACC) of the SVM on the feature subset selected by the IG-GPSO is 98.50%, which is significantly better than the traditional feature selection algorithm. Compared with KNN, the classification effect of the feature subset selected by the IG-GPSO is still optimal. In addition, the results of multiple comparison tests show that the feature selection effect of the IG-GPSO is significantly better than that of traditional feature selection algorithms. Conclusion: The feature subset selected by IG-GPSO not only has the best classification effect, but also has the least feature scale (FS). More importantly, the IG-GPSO significantly improves the ACC of SVM in cancer diagnostic. [ABSTRACT FROM AUTHOR]

[Objective] Trajectory planning is critical for the motion control of a manipulator. The motion time and joint vibration of the manipulator can be reduced by providing a fast and stable reference trajectory to the controller. The single objective trajectory optimization algorithm remains insufficient in meeting the increasing production needs; therefore, it is often necessary to use a multiobjective heuristic algorithm to optimize the motion trajectory of the manipulator while satisfying its kinematic constraints to optimize the motion time and reduce the joint impact or energy loss, improving the production efficiency of the manipulator and ensuring its stability during motion. An improved adaptive multiobjective particle swarm optimization (IAMOPSO) method is studied for the time- and impact-based optimal trajectory planning of a multidegree-of-freedom manipulator. [Methods] First, to obtain physically continuous motion trajectories, including position, velocity, and acceleration, we use a quintic B-spline curve to interpolate the joint path points based on the local controllability of the curve. The trajectory optimization process is a step-by-step approach so that the interpolated solution optimally satisfies the kinematic constraints of the manipulator, and the B-spline curve passes through all interpolation points, rendering the motion trajectory of the manipulator more adaptable. Second, a specific objective function improves the motion efficiency of the manipulator. Under certain kinematic constraints, an expression for the joint impact of the manipulator is designed to improve the trajectory tracking accuracy and ensure the stability of the manipulator during operation tasks. Finally, to increase the diversity of the nondominated solution set while avoiding the local extremum, the multi-objective particle swarm optimization (MOPSO) algorithm is improved through a hybrid strategy of mutation operators, adaptive weights, and dynamic learning factors; consequently, the objective function is optimally solved, and the average optimal solution is selected using a normalization function. A nonlinear mutation operator is adopted to encourage particles to comprehensively explore the decision space, ensuring population diversity in the initial iteration of the algorithm, and an adaptive weight strategy and dynamic learning factor are adopted to balance the exploration and development of the MOPSO algorithm, making it easy for the algorithm to determine the global optimal solution. [Results] 1 The quintic B-spline curve accurately interpolates the path points and ensures the continuity of the acceleration and jerk curves, thus meeting the requirements of smoothness and continuity of the joint trajectory of the manipulator; 2 the optimal trajectory planning method based on the IAMOPSO algorithm can yield a Pareto front with good convergence, select the time- and impact-based optimal trajectory according to the average optimal criterion, and achieve continuity of joint angles and their derivatives. [Conclusions] The optimal trajectory planning method for the manipulator based on IAMOPSO proposed in this paper can improve the motion efficiency and tracking accuracy of the manipulator, obtain Pareto front surfaces with good convergence, ensure smooth and continuous joint curves of the manipulator, and improve the operational efficiency and stability of the manipulator. [ABSTRACT FROM AUTHOR]

In this paper, we derive a random-enhanced quantum particle swarm optimization (QPSO) algorithm and develop a new finite difference (FD) scheme based on this algorithm. The random-enhanced QPSO algorithm has advantages of convergence speed and can converge within the 200th iteration. Under the same conditions, the convergence speed of the conventional QPSO algorithm is much lower than that of the random-enhanced QPSO algorithm. Numerical dispersion analysis reveals that the optimized FD scheme based on the random-enhanced QPSO algorithm has a broader spectral coverage, and the accuracy error is maintained within a valid range, signifying that the random-enhanced QPSO algorithm can better search for accurate global solutions. Finally, numerical modeling of elastic wave equations is performed using the optimized FD scheme based on the random-enhanced QPSO algorithm. The numerical modeling results indicate that the optimized FD scheme based on the random-enhanced QPSO algorithm can effectively suppress numerical dispersion. [ABSTRACT FROM AUTHOR]

In the lung computer-aided detection (Lung CAD) system, the region of interest (ROI) of lung nodules has more false positives, making the imbalance between positive and negative (true positive and false positive) samples more likely to lead to misclassification of true positive nodules, a cost-sensitive multikernel learning support vector machine (CS-MKL-SVM) algorithm is proposed. Different penalty coefficients are assigned to positive and negative samples, so that the model can better learn the features of true positive nodules and improve the classification effect. To further improve the detection rate of pulmonary nodules and overall recognition accuracy, a score function named F-new based on the harmonic mean of accuracy (ACC) and sensitivity (SEN) is proposed as a fitness function for subsequent particle swarm optimization (PSO) parameter optimization, and a feasibility analysis of this function is performed. Compared with the fitness function that considers only accuracy or sensitivity, both the detection rate and the recognition accuracy of pulmonary nodules can be improved by this new algorithm. Compared with the grid search algorithm, using PSO for parameter search can reduce the model training time by nearly 20 times and achieve rapid parameter optimization. The maximum F-new obtained on the test set is 0.9357 for the proposed algorithm. When the maximum value of F-new is achieved, the corresponding recognition ACC is 91%, and SEN is 96.3%. Compared with the radial basis function in the single kernel, the F-new of the algorithm in this paper is 2.16% higher, ACC is 1.00% higher and SEN is equal. Compared with the polynomial kernel function in the single kernel, the F-new of the algorithm is 3.64% higher, ACC is 1.00% higher and SEN is 7.41% higher. The experimental results show that the F-new, ACC and SEN of the proposed algorithm is the best among them, and the results obtained by using multikernel function combined with F-new index are better than the single kernel function. Compared with the MKL-SVM algorithm of grid search, the ACC of the algorithm in this paper is reduced by 1%, and the results are equal to those of the MKL-SVM algorithm based on PSO only. Compared with the above two algorithms, SEN is increased by 3.71% and 7.41%, respectively. Therefore, it can be seen that the cost sensitive method can effectively reduce the missed detection of nodules, and the availability of the new algorithm can be further verified. [ABSTRACT FROM AUTHOR]

Cloud computing has seen a major boom during the past few years. Many people have switched to cloud computing because traditional systems require complex resource distribution and cloud solutions are less expensive. Load balancing (LB) is one of the essential challenges in cloud computing used to balance the workload of cloud services. This research paper presents a performance evaluation of the existing load-balancing algorithms which are particle swarm optimization (PSO), round robin (RR), equally spread current execution (ESCE), and throttled load balancing. This study offers a detailed performance evaluation of various load-balancing algorithms by employing a cloud analyst platform. Efficiency concerning various service broker policy configurations for load-balancing algorithms' virtual machine load balance was also calculated using metrics such as optimized response time (ORT), data center processing time (DCPT), virtual machine costs, data transfer costs, and total cost for different workloads and user bases. Many of the past papers that were mentioned in the literature worked on round robin and equally spread current execution, and throttled load-balancing algorithms were based on efficiency and response time in virtual machines without recognizing the relation between the task and the virtual machines, and the practical significance of the application. A comparison of specific load-balancing algorithms has been investigated. Different service broker policy (SBP) tests have been conducted to illustrate the load-balancing algorithm capabilities. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks are booming with the development of computer technology, network communication technology, and sensor technology. However, the question of how to use fewer nodes to achieve maximum coverage still exists. In this paper, a two-layer Surrogate-Assisted Phasmatodea Population Evolution (SAPPE) is proposed for 3D coverage of wireless sensors by combining the characteristics of meta-heuristic algorithms and surrogate models. In this algorithm, Radial Basis Function Networks are used to construct the surrogate model, and the two surrogate models are global surrogate-assisted and local surrogate-assisted, respectively. The global-surrogate model is used to smooth the fitness function, and the local surrogate-assisted model is used to find the optimal value accurately. They use the same archive DataBase (DB) to store particle positions and true fitness values. However, the number of particles involved in the creation of the surrogate-assisted model is different. Seven benchmark functions are used to test and analyze the algorithm, and the results show that the algorithm has good performance. Also, the algorithm verified the significance of the algorithm using Wilcoxon rank test. The result shows that the proposed algorithm is effective compared with PPE, PSO, PPSO, FMO, and BA. This paper compares the number of nodes and coverage radius using different algorithms to ensure maximum coverage. The result shows that the SAPPE algorithm has better performance in terms of 3D coverage. [ABSTRACT FROM AUTHOR]

Data Mining is a process of exploring the huge data in search of reliable patterns and methodical relationship among variables. As a result, the findings may be validated through applying the detected patterns to a novel subset of the data. In simple words, Data Mining is referred as extracting the useful information as large dataset and transforming into reliable structure for future use. Data Mining has shown its incredible performance in various fields to a greater extent, out of which, Educational Data Mining (EDM) is one among them. Many researchers have addressed huge number of problems in EDM and applied various techniques to reveal the useful and hidden information that helped in the process of decision making. Students getting employed during and after graduation are one of the important parts of their life. Students, based on their academic performances, are getting employed in companies they deserve. But still, the probability of getting employed is very less in this competitive world. In this paper, a real-time scenario has been chosen for analyzing various factors for getting employed/unemployed. Various clustering and classification techniques have been implemented and their performances are studied. A hybrid approach is presented in this paper that integrates the benefits of particle swarm optimization (PSO) and fuzzy clustering means (FCMs). The results obtained show that the proposed technique helps in obtaining higher accuracy to other clustering techniques. The proposed clustering algorithm PSO-FCM, accuracy is 34.4%, 36.45% and 28.45% higher than the existing method, time complexity shows 45%, 33% and 49% lower than the existing K -means clustering, Naïve Bayes clustering and SVM clustering algorithms, respectively. [ABSTRACT FROM AUTHOR]

With the rapid development of the geometric modeling industry and computer technology, the design and shape optimization of complex curve shapes have now become a very important research topic in CAGD. In this paper, the Hybrid Artificial Hummingbird Algorithm (HAHA) is used to optimize complex composite shape-adjustable generalized cubic Ball (CSGC–Ball, for short) curves. Firstly, the Artificial Hummingbird algorithm (AHA), as a newly proposed meta-heuristic algorithm, has the advantages of simple structure and easy implementation and can quickly find the global optimal solution. However, there are still limitations, such as low convergence accuracy and the tendency to fall into local optimization. Therefore, this paper proposes the HAHA based on the original AHA, combined with the elite opposition-based learning strategy, PSO, and Cauchy mutation, to increase the population diversity of the original algorithm, avoid falling into local optimization, and thus improve the accuracy and rate of convergence of the original AHA. Twenty-five benchmark test functions and the CEC 2022 test suite are used to evaluate the overall performance of HAHA, and the experimental results are statistically analyzed using Friedman and Wilkerson rank sum tests. The experimental results show that, compared with other advanced algorithms, HAHA has good competitiveness and practicality. Secondly, in order to better realize the modeling of complex curves in engineering, the CSGC–Ball curves with global and local shape parameters are constructed based on SGC–Ball basis functions. By changing the shape parameters, the whole or local shape of the curves can be adjusted more flexibly. Finally, in order to make the constructed curve have a more ideal shape, the CSGC–Ball curve-shape optimization model is established based on the minimum curve energy value, and the proposed HAHA is used to solve the established shape optimization model. Two representative numerical examples comprehensively verify the effectiveness and superiority of HAHA in solving CSGC–Ball curve-shape optimization problems. [ABSTRACT FROM AUTHOR]

With the continued development of artificial intelligence technology, unmanned surface vehicles (USVs) have attracted the attention of countless domestic and international specialists and academics. In particular, path planning is a core technique for the autonomy and intelligence process of USVs. The current literature reviews on USV path planning focus on the latest global and local path optimization algorithms. Almost all algorithms are optimized by concerning metrics such as path length, smoothness, and convergence speed. However, they also simulate environmental conditions at sea and do not consider the effects of sea factors, such as wind, waves, and currents. Therefore, this paper reviews the current algorithms and latest research results of USV path planning in terms of global path planning, local path planning, hazard avoidance with an approximate response, and path planning under clustering. Then, by classifying USV path planning, the advantages and disadvantages of different research methods and the entry points for improving various algorithms are summarized. Among them, the papers which use kinematic and dynamical equations to consider the ship's trajectory motion planning for actual sea environments are reviewed. Faced with multiple moving obstacles, the literature related to multi-objective task assignment methods for path planning of USV swarms is reviewed. Therefore, the main contribution of this work is that it broadens the horizon of USV path planning and proposes future directions and research priorities for USV path planning based on existing technologies and trends. [ABSTRACT FROM AUTHOR]

The Honey Badger Algorithm (HBA) is a novel meta-heuristic algorithm proposed recently inspired by the foraging behavior of honey badgers. The dynamic search behavior of honey badgers with sniffing and wandering is divided into exploration and exploitation in HBA, which has been applied in photovoltaic systems and optimization problems effectively. However, HBA tends to suffer from the local optimum and low convergence. To alleviate these challenges, an improved HBA (IHBA) through fusing multi-strategies is presented in the paper. It introduces Tent chaotic mapping and composite mutation factors to HBA, meanwhile, the random control parameter is improved, moreover, a diversified updating strategy of position is put forward to enhance the advantage between exploration and exploitation. IHBA is compared with 7 meta-heuristic algorithms in 10 benchmark functions and 5 engineering problems. The Wilcoxon Rank-sum Test, Friedman Test and Mann-Whitney U Test are conducted after emulation. The results indicate the competitiveness and merits of the IHBA, which has better solution quality and convergence traits. [ABSTRACT FROM AUTHOR]

The quality of rolling bearings is vital for the working state and rotation accuracy of the shaft. Timely and accurately acquiring bearing status and early fault diagnosis can effectively prevent losses, making it highly practical. To improve the accuracy of bearing fault diagnosis, this paper proposes a CNN-LSTM bearing fault diagnosis model optimized by hybrid particle swarm optimization (HPSO). The HPSO algorithm has a strong global optimization ability and can effectively solve nonlinear and multivariate optimization problems. It is used to optimize and match the parameters of the CNN-LSTM model and dynamically find the optimal value of the parameters. This model overcomes the problem that the parameters of the CNN-LSTM model depend on empirical settings and cannot be adjusted dynamically. This model is used for bearing fault diagnosis, and the accuracy rate of fault diagnosis classification reaches 99.2%. Compared with the traditional CNN, LSTM, and CNN-LSTM models, the accuracy rates are increased by 6.6%, 9.2%, and 5%, respectively. At the same time, comparing the models with different optimization parameters shows that the model proposed in this paper has the highest accuracy. The experimental results verified the superiority of the HPSO algorithm to optimize model parameters and the feasibility and accuracy of the HPSO-CNN-LSTM model for bearing fault diagnosis. [ABSTRACT FROM AUTHOR]

When the satellite signal is lost or interfered with, the traditional GNSS (Global Navigation Satellite System)/INS (Inertial Navigation System) integrated navigation will degenerate into INS, which results in the decrease in navigation accuracy. To solve these problems, this paper mainly established the PSO (particle swarm optimization) -LSTM (Long Short-Term Memory) neural network model to predict the increment of GNSS position under the condition of satellite rejection and accumulation to obtain the pseudo-GNSS signal. The signal is used to compensate for the observed value in the integrated system. The model takes the advantages of LSTM, which is good at processing time series, and uses PSO to obtain the optimal value of important hyperparameters efficiently. Meanwhile, the improved threshold function is used to denoise the IMU (inertial measurement unit) data, which improves the SNR (signal-to-noise ratio) of IMU outputs effectively. Finally, the performance of the algorithm is proved by actual road test. Compared with INS, the method can reduce the maximum errors of latitude and longitude by at least 98.78% and 99.10% while the satellite is lost for 60 s, effectively improving the accuracy of the GNSS/INS system in satellite rejection. [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]

The crowding in bus is an important factor affecting passenger satisfaction and bus dispatching level. However, how to use video images to detect crowding accurately is a difficult problem. In this paper, firstly, an image sample library is established based on the evaluation standard of crowding in bus, which contains 16346 sample images. Then, Local Binary Pattern (LBP) and Gray Level Co-occurrence Matrix (GLCM) are used to extract the texture features of the image in bus. Then, a rough classification method of crowding based on Support Vector Machine (SVM) is proposed. At the same time, in order to improve the accuracy of rough classification of crowding, the optimization effects of grid search algorithm, particle swarm optimization algorithm and genetic algorithm on SVM parameters are compared. The results show that the optimization effect of genetic algorithm is the best, and the accuracy rate is 93.20%. Finally, for the problem that the SVM method is not ideal in the fine classification of crowding, this paper proposes a new method based on ResNet. SGD, Adadelta and Adam are selected to optimize the parameters of ResNet model. The accuracy of the optimal Adam algorithm reaches 96.22%, which effectively solves the problem of the fine classification of crowding in bus. [ABSTRACT FROM AUTHOR]

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

The complex environments and weak infrastructure constructions of hilly mountainous areas complicate the effective path planning for plant protection operations. Therefore, with the aim of improving the current status of complicated tea plant protections in hills and slopes, an unmanned aerial vehicle (UAV) multi-tea field plant protection route planning algorithm is developed in this paper and integrated with a full-coverage spraying route method for a single region. By optimizing the crossover and mutation operators of the genetic algorithm (GA), the crossover and mutation probabilities are automatically adjusted with the individual fitness and a dynamic genetic algorithm (DGA) is proposed. The iteration period and reinforcement concepts are then introduced in the pheromone update rule of the ant colony optimization (ACO) to improve the convergence accuracy and global optimization capability, and an ant colony binary iteration optimization (ACBIO) is proposed. Serial fusion is subsequently employed on the two algorithms to optimize the route planning for multi-regional operations. Simulation tests reveal that the dynamic genetic algorithm with ant colony binary iterative optimization (DGA-ACBIO) proposed in this study shortens the optimal flight range by 715.8 m, 428.3 m, 589 m, and 287.6mcompared to the dynamic genetic algorithm, ant colony binary iterative algorithm, artificial fish swarm algorithm (AFSA) and particle swarm optimization (PSO), respectively, for multiple tea field scheduling route planning. Moreover, the search time is reduced by more than half compared to other bionic algorithms. The proposed algorithm maintains advantages in performance and stability when solving standard traveling salesman problems with more complex objectives, as well as the planning accuracy and search speed. In this paper, the research on the planning algorithm of plant protection route for multi-tea field scheduling helps to shorten the inter-regional scheduling range and thus reduces the cost of plant protection. [ABSTRACT FROM AUTHOR]

The basic fuzzy neural network algorithm has slow convergence and large amount of calculation, so this paper designed a particle swarm optimization trained fuzzy neural network algorithm to solve this problem. Traditional particle swarm optimization is easy to fall into local extremes and has low efficiency, this paper designed new update rules for inertia weight and learning factors to overcome these problems. We also designed training rules for the improved particle swarm optimization to train fuzzy neural network, and the hybrid algorithm is applied to solve the path planning problem of intelligent driving vehicles. The efficiency and practicability of the algorithm are proved by experiments. [ABSTRACT FROM AUTHOR]

Today, the IoT has become a vital part of our lives because it has entered into the precise details of human life, like smart homes, healthcare, eldercare, vehicles, augmented reality, and industrial robotics. Cloud computing and fog computing give us services to process IoT tasks, and we are seeing a growth in the number of IoT devices every day. This massive increase needs huge amounts of resources to process it, and these vast resources need a lot of power to work because the fog and cloud are based on the term pay-per-use. We make to improve the performance and cost (PC) algorithm to give priority to the high-profit cost and to reduce energy consumption and Makespan; in this paper, we propose the performance and cost–gray wolf optimization (PC-GWO) algorithm, which is the combination of the PCA and GWO algorithms. The results of the trial reveal that the PC-GWO algorithm reduces the average overall energy usage by 12.17%, 11.57%, and 7.19%, and reduces the Makespan by 16.72%, 16.38%, and 14.107%, with the best average resource utilization enhanced by 13.2%, 12.05%, and 10.9% compared with the gray wolf optimization (GWO) algorithm, performance and cost algorithm (PCA), and Particle Swarm Optimization (PSO) algorithm. [ABSTRACT FROM AUTHOR]