Classical Particle Swarm Optimization Algorithm Research Articles

A Multiobjective Array Beamforming Method for Arrays of Flexible Shape

High-performance beamforming incorporating multiple objectives for large-scale antenna arrays becomes increasingly important to improve the capacity and efficiency of wireless communication systems. The speed of synthesizing a desired beam pattern is critical in wireless communications systems to adapt to highly dynamic wireless channels. A modified particle swarm optimization (PSO) algorithm for synthesizing array beam patterns is proposed in this study. The initial positions of particles in PSO are designated following a Taylor distribution instead of being given uniformly distributed random values as in the classical PSO algorithm. The fitness functions are defined to include multiple objectives represented by producing multiple main lobes with customized deep and broadened nulls. Several scenarios have been established to examine the feasibility of the proposed algorithm. Moreover, the performance of the proposed algorithm is compared with those of the ones based on the classical PSO. A significant performance improvement for obtaining beamforming coefficients has been achieved. The robustness of the proposed algorithm is demonstrated further by applying it to a finite array on a curved surface for beamforming.

Exploring New Directions in Higher Education Aided by Artificial Intelligence Technology

Abstract This paper’s objective optimization problem belongs to the encoding problem of real numbers, and the classical particle swarm optimization algorithm is chosen. The establishment of intelligent learning model was finally completed through the assumption of model components, initial model establishment, model cycle evaluation and validation. First, after the implementation of the E-GPPE-C education model, the test was conducted on the educated people, and the AI literacy questionnaire was also distributed to the students before and after the implementation of the model education. Second, a statistical analysis explores which technologies will most likely be applied to higher education. Finally, the variability of higher education subject relations under the influence of AI and related ethical issues were explored. The results show that the highest score on the students’ final test was 96. 20 students scored more than 80 points, indicating that half of the students had a solid grasp of the knowledge and applications related to the E-GPPE-C model, and that there was a vast difference between the degree of AI knowledge and skill mastery before and after the implementation of education. Natural language understanding, computer vision, and biometrics are the three technologies most suitable for application in higher education.

Optimal Design of Fractional-Order PID Controllers for a Nonlinear AWS Wave Energy Converter Using Hybrid Jellyfish Search and Particle Swarm Optimization

In this study, a nonlinear Archimedes wave swing (AWS) energy conversion system was employed to enable the use of irregular sea waves to provide useful electricity. Instead of the conventional PI controllers used in prior research, this study employed fractional-order PID (FOPID) controllers to control the back-to-back configuration of AWS. The aim was to maximize the energy yield from waves and maintain the grid voltage and the capacitor DC link voltage at predetermined values. In this study, six FOPID controllers were used to accomplish the control goals, leading to an array of thirty parameters required to be fine-tuned. In this regard, a hybrid jellyfish search optimizer and particle swarm optimization (HJSPSO) algorithm was adopted to select the optimal control gains. Verification of the performance of the proposed FOPID control system was achieved by comparing the system results to two conventional PID controllers and one FOPID controller. The conventional PID controllers were tuned using a recently presented metaheuristic algorithm called the Coot optimization algorithm (COOT) and the classical particle swarm optimization algorithm (PSO). Moreover, the FOPID was also tuned using the well-known genetic algorithm (GA). The system investigated in this study was subjected to various unsymmetrical and symmetrical fault disturbances. When compared with the standard COOT-PID, PSO-PID, and GA-FOPID controllers, the HJSPSO-FOPID results show a significant improvement in terms of performance and preserving control goals during system instability

Optimal Energy Consumption Path Planning for Unmanned Aerial Vehicles Based on Improved Particle Swarm Optimization

In order to enhance the energy efficiency of unmanned aerial vehicles (UAVs) during flight operations in mountainous terrain, this research paper proposes an improved particle swarm optimization (PSO) algorithm-based optimal energy path planning method, which effectively reduces the non-essential energy consumption of UAV during the flight operations through a reasonable path planning method. First, this research designs a 3D path planning method based on the PSO optimization algorithm with the goal of achieving optimal energy consumption during UAV flight operations. Then, to overcome the limitations of the classical PSO algorithm, such as poor global search capability and susceptibility to local optimality, a parameter adaptive method based on deep deterministic policy gradient (DDPG) is introduced. This parameter adaptive method dynamically adjusts the main parameters of the PSO algorithm by monitoring the state of the particle swarm solution set. Finally, the improved PSO algorithm based on parameter adaptive improvement is applied to path planning in mountainous terrain environments, and an optimal energy-consuming path-planning algorithm for UAVs based on the improved PSO algorithm is proposed. Simulation results show that the path-planning algorithm proposed in this research effectively reduces non-essential energy consumption during UAV flight operations, especially in more complex terrain scenarios.

A novel particle swarm optimization algorithm with Lévy flight and orthogonal learning

• In LOPSO, the there major highlights are described below. • First, a novel PSO based on Lévy flight and orthogonal learning with enhanced exploitation ability and faster search efficiency is proposed. The jumping ability of Lévy flights is utilized to enhance the exploration, while the orthogonal learning process aims to strengthen the exploitation;. • Second, an orthogonal learning process for particle swarms is developed. In the orthogonal learning process, the inclusion of the Lévy flights term in the levels of the Taguchi method is determined based on the flight probability value. Besides, parallel computation is easier to perform during orthogonal learning, which greatly improves efficiency. • Third, each particle in the proposed LOPSO learns from the only best experience generated by a new search strategy instead of the history best experience of each particle and the global best experience that used in the classical PSO variants, thus avoiding the conflict between above two guides. Taguchi method This paper presents a novel particle swarm optimization algorithm (PSO) variant to tackle single-objective numerical optimization, named “Lévy flight orthogonal learning particle swarm optimization” (LOPSO). There are three contributions mentioned in the paper: First, a novel PSO based on Lévy flight and orthogonal learning with enhanced exploitation ability and faster search efficiency is proposed. The jumping ability of Lévy flight is utilized to enhance the exploration, while the orthogonal learning process aims to strengthen the exploitation; Second, an orthogonal learning process for particle swarms is developed. In the orthogonal learning process, the Lévy flight term's inclusion in the Taguchi method levels is determined based on the flight probability value. Besides, parallel computation is easier to perform during orthogonal learning, which greatly improves efficiency. Third, each particle in the proposed LOPSO learns from the only best experience generated by a new search strategy instead of the historical best experience of each particle and the global best experience that is used in the classical PSO variants, thus avoiding the conflict between the above two guides. A large test suite containing benchmarks from the CEC2013 and the CEC2015 test suites on real-parameter single-objective optimization is employed in the algorithm validation, and extensive experiments demonstrate that the comprehensive performance of LOPSO ranks first in terms of accuracy and Wilcoxon signed-rank test in most cases with the same population size and iteration steps and similar time consumption, when compared with the canonical PSO and 13 state-of-the-art PSO variants.

Parallel assembly lines worker assignment and balancing problem: A mathematical model and an artificial bee colony algorithm

In today’s competitive world, assembly lines are one of the most important industrial manufacturing systems, which can accommodate the massive increase in customer demands and product range, for the production industry. One possible way to increase the capacity and efficiency of assembly lines is to design a parallel assembly line system, consisting of two or more assembly lines placed next to each other. In the literature, the assembly lines are usually balanced according to tasks with fixed processing times without considering worker–task compatibility. In real-life applications, however, since the processing time of each task may vary according to the capability of each worker, the assignment of tasks to stations in the assembly line depends on the skills of the worker assigned to the related station. Considering the worker and task assignments together for each assembly line will provide a more realistic perspective. This paper, to the best of our knowledge, is the first study that considers the minimization of joint cycle time for the worker assignment and assembly line balancing problem in parallel assembly lines (PALWABP-II). Accordingly, a binary linear mathematical programming (BLP) model is developed and an artificial bee colony (ABC)-based solution approach is proposed for medium and large-sized problems. A new set of test problems is presented to the literature for a computational experiment. In addition, a summary of the literature is presented. An example problem is solved using the BLP model. In order to evaluate the effectiveness of the proposed model and approach, they are compared with the classical particle swarm optimization (PSO) algorithm and ten different priority rules. The computational results on test problems prove the effectiveness of the proposed ABC algorithm for the PALWABP-II.

3D UAV Deployment in Multi-UAV Networks With Statistical User Position Information

Unmanned aerial vehicle (UAV) carried base stations can provide on-demand deployment for ground users. Given a target area to be serviced, this letter proposes a three-dimensional (3D) deployment method for multiple UAVs based on the knowledge of statistical user position information to maximize the total network throughput. The 3D deployment problem is divided into horizontal deployment problem and vertical deployment problem. Specifically, a virtual force field is built based on the statistical user distributions to help model the communication demand of users. Based on that, the horizontal placement scheme for each UAV is obtained by calculating the force balance points in the virtual field. The classical particle swarm optimization algorithm is adopted to determine the vertical coordinates of UAVs. In order to demonstrate the validity of the proposed algorithm, we also evaluate it through comparison with benchmark algorithms on a real-world telecommunication dataset. Experimental results show that the throughput performance can be improved by the proposed method compared with those benchmark schemes.

An Optimization Method for Enterprise Resource Integration Based on Improved Particle Swarm Optimization.

An enterprise's development and growth are inextricably linked to rational and efficient resource integration and optimization. This study focuses on the reorganization and integration of industrial elements inside the firm from the standpoint of resource integration. The ideal resource integration strategy is investigated by integrating the industrial parts of a certain enterprise in order to increase the efficiency of project completion and lower enterprise expenses. The enterprise's internal material and human resources are limited, but it is frequently necessary to execute numerous activities at the same time, and each activity must meet multiple goals. This research investigates how to properly integrate and schedule resources while attaining different goals. This research proposes using an enhanced particle swarm optimization technique (IPSO) to combine firms' internal resources. In order to address the issue of uneven particle dispersion caused by random population initialization, IPSO incorporates chaos theory into particle population initialization. The logistic mapping sequence generates a huge number of particles, and the particles with the highest quality are chosen for initialization. This can increase particle quality, allowing particles to be spread equally during setup. In the late stage, the classic particle swarm optimization algorithm (PSO) has a slow convergence rate, causing the algorithm to readily slip into a local optimal solution. This research proposes a dynamic inertia weight update approach based on fitness value. In the later stages of the algorithm, this strategy can improve the convergence speed and quality of the global optimal solution, allowing the particles to do a global search and eventually identify the population's ideal solution. Furthermore, IPSO creates a fitness function depending on task completion time. IPSO is used to test the performance of an enterprise's resource integration case. Experiments show that the method utilized can swiftly locate the ideal solution, complete the integration, and optimization of enterprise resources in the shortest job completion time, and for the least amount of money.

Application of UAV path planning based on parameter optimization GA-PSO fusion algorithm

Abstract Aiming at the complexity of the unmanned aerial vehicle (UAV) path planning problem and the great influence of genetic algorithm parameters on the stability of the results, a fusion algorithm based on parameter optimization is proposed in this paper. In the iterative process, the GA-PSO fusion algorithm uses particle swarm optimization algorithm to search the optimal value of crossover rate and mutation rate in genetic algorithm, which makes the algorithm convergence speed is fast and search ability is strong. In addition, the core part of the algorithm fusion framework is realized by introducing the optimal adaptive value of the population after crossover and mutation as the adaptive value of the parameter particle. Finally, we design two groups of experiments and compare the proposed fusion algorithm with the classical particle swarm optimization algorithm (PSO), ant colony algorithm (ACA), genetic algorithm (GA), artificial fish swarm algorithm (AFSA), Wolf pack algorithm (WPA), artificial bee colony algorithm (ABC) and the improved algorithm through experimental simulation. The experimental results show that: In general, the path planned by the GA-PSO fusion algorithm in this paper is 10% shorter than that planned by other algorithms on average. Simulation results also show that the convergence speed of the fusion algorithm in this paper is faster, and the final search path is smoother.

Application of improved particle swarm optimization algorithm in TDOA

In order to improve the location accuracy of passive sound source location technology in a complex environment, an improved particle swarm optimization algorithm is proposed. Aiming at the nonlinear optimization problem in the time difference of the arrival location algorithm, based on the classical particle swarm optimization algorithm, combined with the fitness function and the method of adaptive changing parameters, the improved particle swarm optimization algorithm can not only effectively solve the problem that particle swarm optimization is sour and easy to fall into local optimization but also accurately locate the position of the passive sound source. The feasibility and stability of the algorithm are verified by actual simulation.

Lévy flight-based inverse adaptive comprehensive learning particle swarm optimization.

In the traditional particle swarm optimization algorithm, the particles always choose to learn from the well-behaved particles in the population during the population iteration. Nevertheless, according to the principles of particle swarm optimization, we know that the motion of each particle has an impact on other individuals, and even poorly behaved particles can provide valuable information. Based on this consideration, we propose Lévy flight-based inverse adaptive comprehensive learning particle swarm optimization, called LFIACL-PSO. In the LFIACL-PSO algorithm, First, when the particle is trapped in the local optimum and cannot jump out, inverse learning is used, and the learning step size is obtained through the Lévy flight. Second, to increase the diversity of the algorithm and prevent it from prematurely converging, a comprehensive learning strategy and Ring-type topology are used as part of the learning paradigm. In addition, use the adaptive update to update the acceleration coefficients for each learning paradigm. Finally, the comprehensive performance of LFIACL-PSO is measured using 16 benchmark functions and a real engineering application problem and compared with seven other classical particle swarm optimization algorithms. Experimental comparison results show that the comprehensive performance of the LFIACL-PSO outperforms comparative PSO variants.

A Novel Multi-Objective Process Parameter Interval Optimization Method for Steel Production

Customized small batch orders and sustainable development requirements pose challenges for product quality control and manufacturing process optimization for steel production. Building a multi-quality objective process parameter optimization method that converts the original single target optimization into multi-objective interval capability optimization has become a new method to ensure product quality qualification rate and reduce production costs. Aiming at the multi-quality objective control problem of plate products, we proposed a novel multi-objective process parameter interval optimization model (MPPIO) with equipment process control capability and parameter sensitive analysis. The multi-output support vector regression method was used to establish a multi-quality objective prediction model, which was settled as a verification model for the process parameter optimization results based on the particle swarm optimization algorithm (PSO). The process control capability functions of key parameters were fitted based on the real data in production. With these functions, each optimized particle of the classical PSO was converted into the particle beam of the MIPPO. The iteration process was weight controlled by calculating the Morris sensitivity between each input parameter and output index in the multi-quality objective prediction model, and finally the processing control window of each key parameter was determined according to the process parameter optimization results. The experimental results show that the MPPIO model can obtain the optimal parameter optimization results with the maximum processing capacity and meet the customized processing range requirements. The MPPIO model can reduce the difficulty of control and save production costs while ensuring the product properties is qualified.

River water level prediction in coastal catchment using hybridized relevance vector machine model with improved grasshopper optimization

Modelling river water level (WL) of a coastal catchment is much complex due to the tidal influences on river WL. A hybrid machine learning model based on relevance vector machine (RVM) and improved grasshopper optimization (IGOA) is proposed in this study for modelling hourly WL in a catchment located in the east coast of tropical peninsular Malaysia. Considering the non-linear relationship between inputs and output, a recursive elimination filter based on support vector machine (SVM-RFE) was employed for the selection of the best combination of inputs from antecedent WL and rainfall data for the prediction of WL one hour ahead. The performance of IGOA was compared with classical GOA and particle swarm optimization (PSO) algorithms. Besides, the performance of the hybrid RVM model was compared with the artificial neural network (ANN) models hybridized with the same optimization algorithms. The SVM-RFE selected 1-, 12- and 24-lags WL data and 1-lag rainfall data as the most potential inputs. The relative performance of the models revealed the reliability of RVM-IGOA in WL prediction of a coastal catchment. Significant improvement of model performance was noticed after optimization using IGOA with Nash-Sutcliff Efficiency (NSE) of 0.986 and 0.981, and Kling-Gupta Efficient (KGE) of 0.981 and 0.974 for RVM-IGOA and ANN-IGOA respectively, compared to the models hybridized using other optimization algorithms with NSE between 0.969 and 0.971, and KGE between 0.890 and 0.908. The study indicates the selection of predictors based on their non-linear relations with WL and better optimization of model parameters can improve model performance in simulation of highly complex hydrological phenomena like tidal river WL in a tropical coastal catchment.

Survey and Comparison of Optimization-Based Aggregation Methods for the Determination of the Flexibility Potentials at Vertical System Interconnections

The aggregation of operational active and reactive power flexibilities as the feasible operation region (FOR) is a main component of a hierarchical multi-voltage-level grid control as well as the cooperation of transmission and distribution system operators at vertical system interconnections. This article presents a new optimization-based aggregation approach, based on a modified particle swarm optimization (PSO) and compares it to non-linear and linear programming. The approach is to combine the advantages of stochastic and optimization-based methods to achieve an appropriate aggregation of flexibilities while obtaining additional meta information during the iterative solution process. The general principles for sampling an FOR are introduced in a survey of aggregation methods from the literature and the adaptation of the classic optimal power flow problem. The investigations are based on simulations of the Cigré medium voltage test system and are divided into three parts. The improvement of the classic PSO algorithm regarding the determination of the FOR are presented. The most suitable of four sampling strategies from the literature is identified and selected for the comparison of the optimization methods. The analysis of the results reveals a better performance of the modified PSO in sampling the FOR compared to the other optimization methods.

Multiobjective ant lion optimizer based network planning for Internet of Things on TV white space

SummaryIn this article, we consider the planning problem of Internet of Things networks working on TV White Space (TVWS), that is, optimizing the number of gateways and their locations to cover the M2M devices using the available TVWS spectrum. We first formulate it into a nondeterministic polynomial optimization problem, and then present the multiobjective ant lion optimizer (MOALO) algorithm with low complexity to solve it. Simulation results show that the proposed MOALO solution can achieve better performance than the classical multiobjective particle swarm optimization (MOPSO) algorithm. Considering the typical case with M2M devices distributed Gaussianly with the variance 80, to achieve 99% coverage, the number of gateways selected by the proposed MOALO algorithm can be 14% less than that obtained from the MOPSO algorithm.

System Identification of Micro Piezoelectric Actuators via Rate-Dependent Prandtl-Ishlinskii Hysteresis Model Based on a Modified PSO Algorithm

As one of the high-precision actuating mechanisms, the piezoelectric actuators show the advantage of micro/nano stage maneuverability in facilitating the actuating performance of the mechanical systems. To improve the actuating accuracy, it is important to predict the output behavior accurately under the wide operating range, particularly, the change of the driving frequency. The modeling method using the rate-dependent Prandtl-Ishlinskii (RDPI) model is subsequently adopted, which can show the strong nonlinearities relating to the coupling effects between the internal hysteresis and the actuating frequency. Considering the electromechanical characteristics of piezoelectric actuators, a modified particle swarm optimization (MPSO) algorithm is introduced for identifying the RDPI model using the experimental measurement data. The developed MPSO algorithm can overcome the local optimizing limitation of the classical particle swarm optimization (CPSO) algorithm and guarantee the accuracy of predicting the output. The utility and superiority of the MPSO are verified by fitting the identified model to the actual output of the piezoelectric actuators in the micro range at different actuating frequencies. The comparisons with available models using MPSO, CPSO and LS algorithms have examined the validity of the proposed identification method.

Parameters Identification of Equivalent Model of Permanent Magnet Synchronous Generator (PMSG) Wind Farm Based on Analysis of Trajectory Sensitivity

As wind farms have great influences on power system stability, it is essential to develop an adaptive as well as robust equivalent model of it. In this paper, a detailed equivalent model of PMSG wind farm and initialization method is developed. The trajectory sensitivity of parameters is analyzed. Then, the key parameters are estimated using improved Genetic Learning Particle Swarm Optimization (GLPSO) hybrid algorithm with phasor measurement unit (PMU). The description and generalization capability, stability for parameter identification of the equivalent model under wake effects, and when some wind turbines are off-line or wind speed is unknown after an event are analyzed. The maximum differences between the values of estimated parameters and their real ones are less than 10% for the proportional magnification constant of DC voltage controller Kp2 and grid side current controller Kp3. The convergence rate and global optimization performance of the improved GLPSO hybrid algorithm is 0.5 times higher than the classical particle swarm optimization algorithm (PSO) and genetic algorithm (GA).

Evaluation of Hunting-Based Optimizers for a Quadrotor Sliding Mode Flight Controller

The design of Multi-Input Multi-Output nonlinear control systems for a quadrotor can be a difficult task. Nature inspired optimization techniques can greatly improve the design of non-linear control systems. Two recently proposed hunting-based swarm intelligence inspired techniques are the Grey Wolf Optimizer (GWO) and the Ant Lion Optimizer (ALO). This paper proposes the use of both GWO and ALO techniques to design a Sliding Mode Control (SMC) flight system for tracking improvement of altitude and attitude in a quadrotor dynamic model. SMC is a nonlinear technique which requires that its strictly coupled parameters related to continuous and discontinuous components be correctly adjusted for proper operation. This requires minimizing the tracking error while keeping the chattering effect and control signal magnitude within suitable limits. The performance achieved with both GWO and ALO, considering realistic disturbed flight scenarios are presented and compared to the classical Particle Swarm Optimization (PSO) algorithm. Simulated results are presented showing that GWO and ALO outperformed PSO in terms of precise tracking, for ideal and disturbed conditions. It is shown that the higher stochastic nature of these hunting-based algorithms provided more confidence in local optima avoidance, suggesting feasibility of getting a more precise tracking for practical use.

Optimized PSO algorithm based on the simplicial algorithm of fixed point theory

Particle swarm optimization algorithm (PSO) has been optimized from various aspects since it was proposed. Optimization of PSO can be realized by optimizing its iterative process or the initial parameters and heuristic methods have been combined with the initial PSO algorithm to improve its performance. In this paper, we introduce the Simplicial Algorithm (SA) of fixed point theory into the optimization of PSO and proposed a FP-PSO (Fixed-point PSO) improved algorithm. In FP-PSO algorithm, the optimization of target function is converted into the problem of solving a fixed point equation set, and the solution set obtained by Simplicial Algorithm (SA) of fixed point theory is used as the initial population of PSO algorithm, then the remaining parameters can be obtained accordingly with classical PSO algorithm. Since the fixed point method has sound mathematical properties, the initial population obtained with FP-PSO include nearly all the approximate local extremes which maintain the diversity of population and can optimize the flight direction of particles, and shows their advantages on setting other initial parameters. We make an experimental study with five commonly used testing functions from UCI (University of California Irvine) which include two single-peak functions and three multi-peak functions. The results indicate that the convergence accuracy, stability, and robustness of FP-PSO algorithm are significantly superior to existing improve strategies which also optimize PSO algorithm by optimizing initial population, especially when dealing with complex situations. In addition, we nest the FP-PSO algorithm with four classical improved PSO algorithms that improve PSO by optimizing iterative processes, and carry out contrast experiments on three multi-peak functions under different conditions (rotating or non-rotating). The experimental results show that the performance of the improved algorithm using nested strategy are also significantly enhanced compared with these original algorithms.

Unit commitment based on modified firefly algorithm

Optimization technologies have drawn considerable interest in power system research. The success of an optimization process depends on the efficient selection of method and its parameters based on the problem to be solved. Firefly algorithm is a suitable method for power system operation scheduling. This paper presents a modified firefly algorithm to address unit commitment issues. Generally, two steps are involved in solving unit commitment problems. The first step determines the generating units to be operated, and the second step calculates the amount of demand-sharing among the units (obtained from the first step) to minimize the cost that corresponds to the load demand and constraints. In this work, the priority list method was used in the first step and the second step adopted the modified firefly algorithm. Ten generators were selected to test the proposed method, while the values of the cost function were regarded as criteria to gauge and compare the modified firefly algorithm with the classical firefly algorithm and particle swarm optimization algorithms. Results show that the proposed approach is more efficient than the other methods in terms of generator and error selections between load and generation.