Bee-foraging learning particle swarm optimization

Energy Efficiency Optimisation of Joint Computational Task Offloading and Resource Allocation Using Particle Swarm Optimisation Approach in Vehicular Edge Networks

With the progression of smart vehicles, i.e., connected autonomous vehicles (CAVs), and wireless technologies, there has been an increased need for substantial computational operations for tasks such as path planning, scene recognition, and vision-based object detection. Managing these intensive computational applications is concerned with significant energy consumption. Hence, for this article, a low-cost and sustainable solution using computational offloading and efficient resource allocation at edge devices within the Internet of Vehicles (IoV) framework has been utilised. To address the quality of service (QoS) among vehicles, a trade-off between energy consumption and computational time has been taken into consideration while deciding on the offloading process and resource allocation. The offloading process has been assigned at a minimum wireless resource block level to adapt to the beyond 5G (B5G) network. The novel approach of joint optimisation of computational resources and task offloading decisions uses the meta-heuristic particle swarm optimisation (PSO) algorithm and decision analysis (DA) to find the near-optimal solution. Subsequently, a comparison is made with other proposed algorithms, namely CTORA, CODO, and Heuristics, in terms of computational efficiency and latency. The performance analysis reveals that the numerical results outperform existing algorithms, demonstrating an 8% and a 5% increase in energy efficiency.

Study on the space field reconstruction method of the radial basis function of electromagnetic radiation under optimal parameters

Electromagnetic radiation (EM) pollution has a certain impact on human life and health, and the reconstruction of the EM space field in this paper is of great practical significance for EM analysis and research. The radial basis function (RBF) sufficiently considers the influence of each sampling point and is more suitable for reconstructing the EM space field than other spatial interpolation methods. Currently, when RBF is used to reconstruct the EM space field, the optimal determination of the basis function and shape parameter (SP) is rarely considered. This ultimately leads to low reconstruction accuracy of the EM space field. Therefore, in this paper, the particle swarm optimization (PSO) is used to calculate the optimal SP of the RBF. On this basis, reliable EM space field reconstruction is performed, which helps people understand the EM distribution characteristics in actual situations from a visual perspective. The EM sampling data of a region on the Yunnan Normal University campus are used as the data source, and the RBF under the optimal parameters is used for EM reconstruction. The accuracy of its interpolation results is evaluated and compared and analyzed with inverse distance weighting (IDW) after distance index optimization. The results show that the RBF under optimal parameters reconstructs the EM space field with high accuracy and good effect, which can truly reflect the actual distribution of EM.

A Random Particle Swarm Optimization Based on Cosine Similarity for Global Optimization and Classification Problems

In today's fast-paced and ever-changing environment, the need for algorithms with enhanced global optimization capability has become increasingly crucial due to the emergence of a wide range of optimization problems. To tackle this issue, we present a new algorithm called Random Particle Swarm Optimization (RPSO) based on cosine similarity. RPSO is evaluated using both the IEEE Congress on Evolutionary Computation (CEC) 2022 test dataset and Convolutional Neural Network (CNN) classification experiments. The RPSO algorithm builds upon the traditional PSO algorithm by incorporating several key enhancements. Firstly, the parameter selection is adapted and a mechanism called Random Contrastive Interaction (RCI) is introduced. This mechanism fosters information exchange among particles, thereby improving the ability of the algorithm to explore the search space more effectively. Secondly, quadratic interpolation (QI) is incorporated to boost the local search efficiency of the algorithm. RPSO utilizes cosine similarity for the selection of both QI and RCI, dynamically updating population information to steer the algorithm towards optimal solutions. In the evaluation using the CEC 2022 test dataset, RPSO is compared with recent variations of Particle Swarm Optimization (PSO) and top algorithms in the CEC community. The results highlight the strong competitiveness and advantages of RPSO, validating its effectiveness in tackling global optimization tasks. Additionally, in the classification experiments with optimizing CNNs for medical images, RPSO demonstrated stability and accuracy comparable to other algorithms and variants. This further confirms the value and utility of RPSO in improving the performance of CNN classification tasks.

Velocity pausing particle swarm optimization: a novel variant for global optimization

Particle swarm optimization (PSO) is one of the most well-regard metaheuristics with remarkable performance when solving diverse optimization problems. However, PSO faces two main problems that degrade its performance: slow convergence and local optima entrapment. In addition, the performance of this algorithm substantially degrades on high-dimensional problems. In the classical PSO, particles can move in each iteration with either slower or faster speed. This work proposes a novel idea called velocity pausing where particles in the proposed velocity pausing PSO (VPPSO) variant are supported by a third movement option that allows them to move with the same velocity as they did in the previous iteration. As a result, VPPSO has a higher potential to balance exploration and exploitation. To avoid the PSO premature convergence, VPPSO modifies the first term of the PSO velocity equation. In addition, the population of VPPSO is divided into two swarms to maintain diversity. The performance of VPPSO is validated on forty three benchmark functions and four real-world engineering problems. According to the Wilcoxon rank-sum and Friedman tests, VPPSO can significantly outperform seven prominent algorithms on most of the tested functions on both low- and high-dimensional cases. Due to its superior performance in solving complex high-dimensional problems, VPPSO can be applied to solve diverse real-world optimization problems. Moreover, the velocity pausing concept can be easily integrated with new or existing metaheuristic algorithms to enhance their performances. The Matlab code of VPPSO is available at: https://uk.mathworks.com/matlabcentral/fileexchange/119633-vppso.

Intelligent Scheduling Methodology for UAV Swarm Remote Sensing in Distributed Photovoltaic Array Maintenance

In recent years, the unmanned aerial vehicle (UAV) remote sensing technology has been widely used in the planning, design and maintenance of urban distributed photovoltaic arrays (UDPA). However, the existing studies rarely concern the UAV swarm scheduling problem when applied to remoting sensing in UDPA maintenance. In this study, a novel scheduling model and algorithm for UAV swarm remote sensing in UDPA maintenance are developed. Firstly, the UAV swarm scheduling tasks in UDPA maintenance are described as a large-scale global optimization (LSGO) problem, in which the constraints are defined as penalty functions. Secondly, an adaptive multiple variable-grouping optimization strategy including adaptive random grouping, UAV grouping and task grouping is developed. Finally, a novel evolutionary algorithm, namely cooperatively coevolving particle swarm optimization with adaptive multiple variable-grouping and context vector crossover/mutation strategies (CCPSO_-mg-cvcm), is developed in order to effectively optimize the aforementioned UAV swarm scheduling model. The results of the case study show that the developed CCPSO_-mg-cvcm significantly outperforms the existing algorithms, and the UAV swarm remote sensing in large-scale UDPA maintenance can be optimally scheduled by the developed methodology.

Stochastic Triad Topology Based Particle Swarm Optimization for Global Numerical Optimization

Particle swarm optimization (PSO) has exhibited well-known feasibility in problem optimization. However, its optimization performance still encounters challenges when confronted with complicated optimization problems with many local areas. In PSO, the interaction among particles and utilization of the communication information play crucial roles in improving the learning effectiveness and learning diversity of particles. To promote the communication effectiveness among particles, this paper proposes a stochastic triad topology to allow each particle to communicate with two random ones in the swarm via their personal best positions. Then, unlike existing studies that employ the personal best positions of the updated particle and the neighboring best position of the topology to direct its update, this paper adopts the best one and the mean position of the three personal best positions in the associated triad topology as the two guiding exemplars to direct the update of each particle. To further promote the interaction diversity among particles, an archive is maintained to store the obsolete personal best positions of particles and is then used to interact with particles in the triad topology. To enhance the chance of escaping from local regions, a random restart strategy is probabilistically triggered to introduce initialized solutions to the archive. To alleviate sensitivity to parameters, dynamic adjustment strategies are designed to dynamically adjust the associated parameter settings during the evolution. Integrating the above mechanism, a stochastic triad topology-based PSO (STTPSO) is developed to effectively search complex solution space. With the above techniques, the learning diversity and learning effectiveness of particles are largely promoted and thus the developed STTPSO is expected to explore and exploit the solution space appropriately to find high-quality solutions. Extensive experiments conducted on the commonly used CEC 2017 benchmark problem set with different dimension sizes substantiate that the proposed STTPSO achieves highly competitive or even much better performance than state-of-the-art and representative PSO variants.