Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a...Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.展开更多
The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition...The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.展开更多
The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(I...The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.展开更多
Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of t...Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of the data.It excludes irrelevant or surplus features,thus boosting the performance and efficiency of the model.Particle Swarm Optimization(PSO)boasts a streamlined algorithmic framework and exhibits rapid convergence traits.Compared with other algorithms,it incurs reduced computational expenses when tackling high-dimensional datasets.However,PSO faces challenges like inadequate convergence precision.Therefore,regarding FS problems,this paper presents a binary version enhanced PSO based on the Support Vector Machines(SVM)classifier.First,the Sand Cat Swarm Optimization(SCSO)is added to enhance the global search capability of PSO and improve the accuracy of the solution.Secondly,the Latin hypercube sampling strategy initializes populations more uniformly and helps to increase population diversity.The last is the roundup search strategy introducing the grey wolf hierarchy idea to help improve convergence speed.To verify the capability of Self-adaptive Cooperative Particle Swarm Optimization(SCPSO),the CEC2020 test suite and CEC2022 test suite are selected for experiments and applied to three engineering problems.Compared with the standard PSO algorithm,SCPSO converges faster,and the convergence accuracy is significantly improved.Moreover,SCPSO’s comprehensive performance far exceeds that of other algorithms.Six datasets from the University of California,Irvine(UCI)database were selected to evaluate SCPSO’s effectiveness in solving feature selection problems.The results indicate that SCPSO has significant potential for addressing these problems.展开更多
Restructuring of power market not only introduces competition but also brings complexity which increases overloading of Transmission Lines(TL).To obviate this complexity,this paper aims to mitigate the overloading and...Restructuring of power market not only introduces competition but also brings complexity which increases overloading of Transmission Lines(TL).To obviate this complexity,this paper aims to mitigate the overloading and estimate the optimal location of Static Synchronous Compensator(STATCOM) by reducing congestion for a deregulated power system.The proposed method is based on the use of Locational Marginal Price(LMP) difference technique and congestion cost.LMPs are obtained as a by-product of Optimal Power Flow(OPF),whereas Congestion Cost(CC) is a function of difference in LMP and power flows.The effiectiveness of this approach is demonstrated by reducing the CC and solution space which can identify the TLs more suitable for placement of STATCOM.Importantly,total real power loss,reactive power loss and total CC are the three main objective functions in this optimization process.The process is implemented by developing an IEEE-69 bus test system which verifies and validates the effectiveness of proposed optimization technique.Additionally,a comparative analysis is enumerated by implementing two optimization techniques:Flower Pollination Algorithm(FPA) and Particle Swarm Optimization(PSO).The comparative analysis is sufficient to demonstrate the superiority of FPA technique over PSO technique in estimating an optimal placement of a STATCOM.The results from the load-flow analysis illustrate the reduction in CC,total real and reactive power loss using FPA technique compared to PSO technique.Overall,satisfactory results are obtained without using complex calculations which verify the effectiveness of optimization techniques.展开更多
Recent advancements in computational and database technologies have led to the exponential growth of large-scale medical datasets,significantly increasing data complexity and dimensionality in medical diagnostics.Effi...Recent advancements in computational and database technologies have led to the exponential growth of large-scale medical datasets,significantly increasing data complexity and dimensionality in medical diagnostics.Efficient feature selection methods are critical for improving diagnostic accuracy,reducing computational costs,and enhancing the interpretability of predictive models.Particle Swarm Optimization(PSO),a widely used metaheuristic inspired by swarm intelligence,has shown considerable promise in feature selection tasks.However,conventional PSO often suffers from premature convergence and limited exploration capabilities,particularly in high-dimensional spaces.To overcome these limitations,this study proposes an enhanced PSO framework incorporating Orthogonal Initializa-tion and a Crossover Operator(OrPSOC).Orthogonal Initialization ensures a diverse and uniformly distributed initial particle population,substantially improving the algorithm’s exploration capability.The Crossover Operator,inspired by genetic algorithms,introduces additional diversity during the search process,effectively mitigating premature convergence and enhancing global search performance.The effectiveness of OrPSOC was rigorously evaluated on three benchmark medical datasets—Colon,Leukemia,and Prostate Tumor.Comparative analyses were conducted against traditional filter-based methods,including Fast Clustering-Based Feature Selection Technique(Fast-C),Minimum Redundancy Maximum Relevance(MinRedMaxRel),and Five-Way Joint Mutual Information(FJMI),as well as prominent metaheuristic algorithms such as standard PSO,Ant Colony Optimization(ACO),Comprehensive Learning Gravitational Search Algorithm(CLGSA),and Fuzzy-Based CLGSA(FCLGSA).Experimental results demonstrated that OrPSOC consistently outperformed these existing methods in terms of classification accuracy,computational efficiency,and result stability,achieving significant improvements even with fewer selected features.Additionally,a sensitivity analysis of the crossover parameter provided valuable insights into parameter tuning and its impact on model performance.These findings highlight the superiority and robustness of the proposed OrPSOC approach for feature selection in medical diagnostic applications and underscore its potential for broader adoption in various high-dimensional,data-driven fields.展开更多
Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service lif...Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.展开更多
In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update ...In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.展开更多
Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joint...Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joints the P-wave first arrival data. This method adaptively adjusts the preference for “superior” arrays and leverages “inferior” arrays to escape local optima, thereby improving the location accuracy. The effectiveness and stability of this method were validated through synthetic tests, pencil-lead break (PLB) experiments, and mining engineering applications. Specifically, for synthetic tests with 1 μs Gaussian noise and 100 μs large noise in rock samples, the location error of the multi-sensor arrays jointed location method is only 0.30 cm, which improves location accuracy by 97.51% compared to that using a single sensor array. The average location error of PLB events on three surfaces of a rock sample is reduced by 48.95%, 26.40%, and 55.84%, respectively. For mine blast event tests, the average location error of the dual sensor arrays jointed method is 62.74 m, 54.32% and 14.29% lower than that using only sensor arrays 1 and 2, respectively. In summary, the proposed multi-sensor arrays jointed location method demonstrates good noise resistance, stability, and accuracy, providing a compelling new solution for MS location in relevant mining scenarios.展开更多
Underwater charging stations allow Autonomous Underwater Vehicles(AUVs)to recharge batteries,extending missions and reducing surface support.However,efficient wireless power transfer requires overcoming alignment chal...Underwater charging stations allow Autonomous Underwater Vehicles(AUVs)to recharge batteries,extending missions and reducing surface support.However,efficient wireless power transfer requires overcoming alignment challenges and environmental variations in conductive seawater.This paper employs Particle Swarm Optimization(PSO)to design coupling coils specifically applied for underwater wireless charging station systems.The establishment of underwater charging stations enables Autonomous Underwater Vehicles(AUVs)to recharge batteries underwater,extending mission duration and reducing reliance on surface-based resupply operations.The proposed charging system is designed to address the unique challenges of the underwater environment,such as alignment disruptions and performance degradation caused by seawater conductivity and environmental fluctuations.Given these distinctive underwater conditions,this study explores coupling coil design comprehensively.COMSOL Multiphysics and MATLAB software were integrated to develop an automated coil evaluation platform,effectively assessing coil coupling under varying misalignment conditions.PSO was employed to optimize coil inner diameters,simulating coupling performance across different misalignment scenarios to achieve high misalignment tolerance.The optimized coils were subsequently implemented in a full-bridge series-series resonant converter and compared with control group coils.Results confirmed the PSO-optimized coils enhanced misalignment resistance,exhibiting a variation of coupling coefficient as low as 4.26%,while the control group coils have a variation of 10.34%.In addition,compared to control group coils,PSO-optimized coils achieved an average efficiency of 71%in air and 67%in seawater,outperforming the control group coils at 66%and 60%,respectively.These findings demonstrate the effectiveness of the proposed PSO-based coil design in improving underwater wireless power transfer reliability and efficiency.展开更多
Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectu...Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.展开更多
Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design...Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.展开更多
Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm opt...Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.展开更多
In order to improve the accuracy and reliability of the driving fatigue detection based on a single feature, a new detection algorithm based on multiple features is proposed. Two direct driver＇s facial features refle...In order to improve the accuracy and reliability of the driving fatigue detection based on a single feature, a new detection algorithm based on multiple features is proposed. Two direct driver＇s facial features reflecting fatigue and one indirect vehicle behavior feature indicating fatigue are considered. Meanwhile, T-S fuzzy neural network（TSFNN）is adopted to recognize the driving fatigue of drivers. For the structure identification of the TSFNN, subtractive clustering（SC） is used to confirm the fuzzy rules and their correlative parameters. Moreover, the particle swarm optimization （PSO）algorithm is improved to train the TSFNN. Simulation results and experiments on vehicles show that the proposed algorithm can effectively improve the convergence speed and the recognition accuracy of the TSFNN, as well as enhance the correct rate of driving fatigue detection.展开更多
Various migration methods have been proposed to image high-angle geological structures and media with strong lateral velocity variations; however, the problems of low precision and high computational cost remain unres...Various migration methods have been proposed to image high-angle geological structures and media with strong lateral velocity variations; however, the problems of low precision and high computational cost remain unresolved. To describe the seismic wave propagation in media with lateral velocity variations and to image high-angle structures, we propose the generalized screen propagator based on particle swarm optimization （PSO-GSP）, for the precise fitting of the single-square-root operator. We use the 2D SEG/EAGE salt model to test the proposed PSO-GSP migration method to image the faults beneath the salt dome and compare the results to those of the conventional high-order generalized screen propagator （GSP） migration and split-step Fourier （SSF） migration. Moreover, we use 2D marine data from the South China Sea to show that the PSO-GSP migration can better image strong reflectors than conventional imaging methods.展开更多
In shock wave＇s pressure testing,a dynamic compensation digital filter is designed based on particle swarm optimization （PSO） algorithm.Dynamic calibration experiment and simulation are conducted for the pressure s...In shock wave＇s pressure testing,a dynamic compensation digital filter is designed based on particle swarm optimization （PSO） algorithm.Dynamic calibration experiment and simulation are conducted for the pressure sensor.PSO algorithm is applied on Matlab platform to achieve optimization according to input and output data of the sensor as well as the reference model,and the global optimal values got by optimization become the parameters of the compensator.Finally,the dynamic compensation filter is established on LabVIEW platform.The experimental results show that the data after processing with the compensation filter truly reflects the input signal.展开更多
An improved particle swarm optimization （PSO） algorithm is investigated in the optimization of the attitude controller parameters of unmanned aerial vehicle （UAV）. Considering the stagnation phenomenon in the late...An improved particle swarm optimization （PSO） algorithm is investigated in the optimization of the attitude controller parameters of unmanned aerial vehicle （UAV）. Considering the stagnation phenomenon in the later phase of the basic PSO algorithm caused by the diversity scarcity of particles, a modified PSO algorithm is presented. For the basic PSO algorithm, the velocity of each particle is adjusted according to the inertia motion, the swarm previous best position and its own previous best position. However, in the improved PSO algorithm, each particle only learns from another randomly selected particle with higher performance, besides keeping the inertia motion. The inertia weight of the improved PSO algorithm is a random number. The modification decreases the uncertain parameters of the algorithm, simplifies the learning mechanism of the particle, and enhances the diversity of the swarm. Furthermore, a UAV attitude control system is built, and the improved PSO algorithm is applied in the optimized tuning of four controller parameters. Simulation results show that the improved PSO algorithm has stronger global searching ability than the common PSO algorithms, and obtains better UAV attitude control parameters.展开更多
In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is pro...In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is proposed based on the modified particle swarm optimization（ MPSO） algorithm.The number of mobile stations（ MSs） served by e NBs, which is obtained based on the reference signal received power（RSRP） measured from the MS, is used as the metric for coverage optimization, and the coverage problem is optimized by maximizing the number of served MSs. In the MPSO algorithm, a swarm of particles known as the set of ATAs is available; the fitness function is defined as the total number of the served MSs; and the evolution velocity corresponds to the ATAs adjustment scale for each iteration cycle. Simulation results showthat compared with the fixed ATA, the number of served MSs by e NBs is significantly increased by 7. 2%, the quality of the received signal is considerably improved by 20 d Bm, and, particularly, the system throughput is also effectively increased by 55 Mbit / s.展开更多
Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank a...Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank angle profile is developed to reduce the search space of unknown parameters based on the constrained PSO algorithm. The path constraints are enforced by setting the fitness function to be infinite on condition that the particles violate the maximum allowable values. The PSO algo- rithm also provides a much easier means to satisfy the terminal conditions by adding penalty terms to the fitness function. Furthermore, the approximate reentry landing footprint is fast constructed by incorporating an interpolation model into the standardized bank angle profiles. Numerical sim ulations demonstrate that the PSO method is a feasible and flexible tool to generate the end-to-end trajectory and landing footprint for hypersonic reentry vehicles.展开更多
As for the drop of particle diversity and the slow convergent speed of particle in the late evolution period when particle swarm optimization（PSO） is applied to solve high-dimensional multi-modal functions,a hybrid ...As for the drop of particle diversity and the slow convergent speed of particle in the late evolution period when particle swarm optimization（PSO） is applied to solve high-dimensional multi-modal functions,a hybrid optimization algorithm based on the cat mapping,the cloud model and PSO is proposed.While the PSO algorithm evolves a certain of generations,this algorithm applies the cat mapping to implement global disturbance of the poorer individuals,and employs the cloud model to execute local search of the better individuals;accordingly,the obtained best individuals form a new swarm.For this new swarm,the evolution operation is maintained with the PSO algorithm,using the parameter of pop distr to balance the global and local search capacity of the algorithm,as well as,adopting the parameter of mix gen to control mixing times of the algorithm.The comparative analysis is carried out on the basis of 4 functions and other algorithms.It indicates that this algorithm shows faster convergent speed and better solving precision for solving functions particularly those high-dimensional multi-modal functions.Finally,the suggested values are proposed for parameters pop distr and mix gen applied to different dimension functions via the comparative analysis of parameters.展开更多
文摘Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
基金supported by the National Natural Science Foundation of China(Nos.62272418,62102058)Basic Public Welfare Research Program of Zhejiang Province(No.LGG18E050011)the Major Open Project of Key Laboratory for Advanced Design and Intelligent Computing of the Ministry of Education under Grant ADIC2023ZD001,National Undergraduate Training Program on Innovation and Entrepreneurship(No.202410345054).
文摘The wireless signals emitted by base stations serve as a vital link connecting people in today’s society and have been occupying an increasingly important role in real life.The development of the Internet of Things(IoT)relies on the support of base stations,which provide a solid foundation for achieving a more intelligent way of living.In a specific area,achieving higher signal coverage with fewer base stations has become an urgent problem.Therefore,this article focuses on the effective coverage area of base station signals and proposes a novel Evolutionary Particle Swarm Optimization(EPSO)algorithm based on collective prediction,referred to herein as ECPPSO.Introducing a new strategy called neighbor-based evolution prediction(NEP)addresses the issue of premature convergence often encountered by PSO.ECPPSO also employs a strengthening evolution(SE)strategy to enhance the algorithm’s global search capability and efficiency,ensuring enhanced robustness and a faster convergence speed when solving complex optimization problems.To better adapt to the actual communication needs of base stations,this article conducts simulation experiments by changing the number of base stations.The experimental results demonstrate thatunder the conditionof 50 ormore base stations,ECPPSOconsistently achieves the best coverage rate exceeding 95%,peaking at 99.4400%when the number of base stations reaches 80.These results validate the optimization capability of the ECPPSO algorithm,proving its feasibility and effectiveness.Further ablative experiments and comparisons with other algorithms highlight the advantages of ECPPSO.
基金supported by the Fundamental Research Funds for the Central Universities of China(No.300102122105)the Natural Science Basic Research Plan in Shaanxi Province of China(2023-JC-YB-023).
文摘Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of the data.It excludes irrelevant or surplus features,thus boosting the performance and efficiency of the model.Particle Swarm Optimization(PSO)boasts a streamlined algorithmic framework and exhibits rapid convergence traits.Compared with other algorithms,it incurs reduced computational expenses when tackling high-dimensional datasets.However,PSO faces challenges like inadequate convergence precision.Therefore,regarding FS problems,this paper presents a binary version enhanced PSO based on the Support Vector Machines(SVM)classifier.First,the Sand Cat Swarm Optimization(SCSO)is added to enhance the global search capability of PSO and improve the accuracy of the solution.Secondly,the Latin hypercube sampling strategy initializes populations more uniformly and helps to increase population diversity.The last is the roundup search strategy introducing the grey wolf hierarchy idea to help improve convergence speed.To verify the capability of Self-adaptive Cooperative Particle Swarm Optimization(SCPSO),the CEC2020 test suite and CEC2022 test suite are selected for experiments and applied to three engineering problems.Compared with the standard PSO algorithm,SCPSO converges faster,and the convergence accuracy is significantly improved.Moreover,SCPSO’s comprehensive performance far exceeds that of other algorithms.Six datasets from the University of California,Irvine(UCI)database were selected to evaluate SCPSO’s effectiveness in solving feature selection problems.The results indicate that SCPSO has significant potential for addressing these problems.
文摘Restructuring of power market not only introduces competition but also brings complexity which increases overloading of Transmission Lines(TL).To obviate this complexity,this paper aims to mitigate the overloading and estimate the optimal location of Static Synchronous Compensator(STATCOM) by reducing congestion for a deregulated power system.The proposed method is based on the use of Locational Marginal Price(LMP) difference technique and congestion cost.LMPs are obtained as a by-product of Optimal Power Flow(OPF),whereas Congestion Cost(CC) is a function of difference in LMP and power flows.The effiectiveness of this approach is demonstrated by reducing the CC and solution space which can identify the TLs more suitable for placement of STATCOM.Importantly,total real power loss,reactive power loss and total CC are the three main objective functions in this optimization process.The process is implemented by developing an IEEE-69 bus test system which verifies and validates the effectiveness of proposed optimization technique.Additionally,a comparative analysis is enumerated by implementing two optimization techniques:Flower Pollination Algorithm(FPA) and Particle Swarm Optimization(PSO).The comparative analysis is sufficient to demonstrate the superiority of FPA technique over PSO technique in estimating an optimal placement of a STATCOM.The results from the load-flow analysis illustrate the reduction in CC,total real and reactive power loss using FPA technique compared to PSO technique.Overall,satisfactory results are obtained without using complex calculations which verify the effectiveness of optimization techniques.
文摘Recent advancements in computational and database technologies have led to the exponential growth of large-scale medical datasets,significantly increasing data complexity and dimensionality in medical diagnostics.Efficient feature selection methods are critical for improving diagnostic accuracy,reducing computational costs,and enhancing the interpretability of predictive models.Particle Swarm Optimization(PSO),a widely used metaheuristic inspired by swarm intelligence,has shown considerable promise in feature selection tasks.However,conventional PSO often suffers from premature convergence and limited exploration capabilities,particularly in high-dimensional spaces.To overcome these limitations,this study proposes an enhanced PSO framework incorporating Orthogonal Initializa-tion and a Crossover Operator(OrPSOC).Orthogonal Initialization ensures a diverse and uniformly distributed initial particle population,substantially improving the algorithm’s exploration capability.The Crossover Operator,inspired by genetic algorithms,introduces additional diversity during the search process,effectively mitigating premature convergence and enhancing global search performance.The effectiveness of OrPSOC was rigorously evaluated on three benchmark medical datasets—Colon,Leukemia,and Prostate Tumor.Comparative analyses were conducted against traditional filter-based methods,including Fast Clustering-Based Feature Selection Technique(Fast-C),Minimum Redundancy Maximum Relevance(MinRedMaxRel),and Five-Way Joint Mutual Information(FJMI),as well as prominent metaheuristic algorithms such as standard PSO,Ant Colony Optimization(ACO),Comprehensive Learning Gravitational Search Algorithm(CLGSA),and Fuzzy-Based CLGSA(FCLGSA).Experimental results demonstrated that OrPSOC consistently outperformed these existing methods in terms of classification accuracy,computational efficiency,and result stability,achieving significant improvements even with fewer selected features.Additionally,a sensitivity analysis of the crossover parameter provided valuable insights into parameter tuning and its impact on model performance.These findings highlight the superiority and robustness of the proposed OrPSOC approach for feature selection in medical diagnostic applications and underscore its potential for broader adoption in various high-dimensional,data-driven fields.
基金fundings supported by Sichuan Science and Technology Program(2025YFHZ0065).
文摘Structural Reliability-Based Topology Optimization(RBTO),as an efficient design methodology,serves as a crucial means to ensure the development ofmodern engineering structures towards high performance,long service life,and high reliability.However,in practical design processes,topology optimization must not only account for the static performance of structures but also consider the impacts of various responses and uncertainties under complex dynamic conditions,which traditional methods often struggle accommodate.Therefore,this study proposes an RBTO framework based on a Kriging-assisted level set function and a novel Dynamic Hybrid Particle Swarm Optimization(DHPSO)algorithm.By leveraging the Kriging model as a surrogate,the high cost associated with repeatedly running finite element analysis processes is reduced,addressing the issue of minimizing structural compliance.Meanwhile,the DHPSO algorithm enables a better balance between the population’s developmental and exploratory capabilities,significantly accelerating convergence speed and enhancing global convergence performance.Finally,the proposed method is validated through three different structural examples,demonstrating its superior performance.Observed that the computational that,compared to the traditional Solid Isotropic Material with Penalization(SIMP)method,the proposed approach reduces the upper bound of structural compliance by approximately 30%.Additionally,the optimized results exhibit clear material interfaces without grayscale elements,and the stress concentration factor is reduced by approximately 42%.Consequently,the computational results fromdifferent examples verify the effectiveness and superiority of this study across various fields,achieving the goal of providing more precise optimization results within a shorter timeframe.
文摘In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.
基金Project(SICGM2023301) supported by the State Key Laboratory of Strata Intelligent Control and Green Mining Co-founded by Shandong Province and the Ministry of Science and Technology,ChinaProject(SMDPC202202) supported by the Key Laboratory of Mining Disaster Prevention and Control,ChinaProject(U21A2030) supported by the National Natural Science Foundation of China。
文摘Microseismic (MS) source location plays an important role in MS monitoring. This paper proposes a MS source location method based on particle swarm optimization (PSO) and multi-sensor arrays, where a free weight joints the P-wave first arrival data. This method adaptively adjusts the preference for “superior” arrays and leverages “inferior” arrays to escape local optima, thereby improving the location accuracy. The effectiveness and stability of this method were validated through synthetic tests, pencil-lead break (PLB) experiments, and mining engineering applications. Specifically, for synthetic tests with 1 μs Gaussian noise and 100 μs large noise in rock samples, the location error of the multi-sensor arrays jointed location method is only 0.30 cm, which improves location accuracy by 97.51% compared to that using a single sensor array. The average location error of PLB events on three surfaces of a rock sample is reduced by 48.95%, 26.40%, and 55.84%, respectively. For mine blast event tests, the average location error of the dual sensor arrays jointed method is 62.74 m, 54.32% and 14.29% lower than that using only sensor arrays 1 and 2, respectively. In summary, the proposed multi-sensor arrays jointed location method demonstrates good noise resistance, stability, and accuracy, providing a compelling new solution for MS location in relevant mining scenarios.
基金supported by the National Science and Technology Council(NSTC),Taiwan[Project code MOST 110-2222-E-019-005-MY3].
文摘Underwater charging stations allow Autonomous Underwater Vehicles(AUVs)to recharge batteries,extending missions and reducing surface support.However,efficient wireless power transfer requires overcoming alignment challenges and environmental variations in conductive seawater.This paper employs Particle Swarm Optimization(PSO)to design coupling coils specifically applied for underwater wireless charging station systems.The establishment of underwater charging stations enables Autonomous Underwater Vehicles(AUVs)to recharge batteries underwater,extending mission duration and reducing reliance on surface-based resupply operations.The proposed charging system is designed to address the unique challenges of the underwater environment,such as alignment disruptions and performance degradation caused by seawater conductivity and environmental fluctuations.Given these distinctive underwater conditions,this study explores coupling coil design comprehensively.COMSOL Multiphysics and MATLAB software were integrated to develop an automated coil evaluation platform,effectively assessing coil coupling under varying misalignment conditions.PSO was employed to optimize coil inner diameters,simulating coupling performance across different misalignment scenarios to achieve high misalignment tolerance.The optimized coils were subsequently implemented in a full-bridge series-series resonant converter and compared with control group coils.Results confirmed the PSO-optimized coils enhanced misalignment resistance,exhibiting a variation of coupling coefficient as low as 4.26%,while the control group coils have a variation of 10.34%.In addition,compared to control group coils,PSO-optimized coils achieved an average efficiency of 71%in air and 67%in seawater,outperforming the control group coils at 66%and 60%,respectively.These findings demonstrate the effectiveness of the proposed PSO-based coil design in improving underwater wireless power transfer reliability and efficiency.
基金funded by Deanship of Graduate studies and Scientific Research at Jouf University under grant No.(DGSSR-2023-2-02038).
文摘Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.
文摘Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.
文摘Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.
基金The National Key Technologies R & D Program during the 11th Five-Year Plan Period(No.2009BAG13A04)the Ph.D.Programs Foundation of Ministry of Education of China(No.200802861061)the Transportation Science Research Project of Jiangsu Province(No.08X09)
文摘In order to improve the accuracy and reliability of the driving fatigue detection based on a single feature, a new detection algorithm based on multiple features is proposed. Two direct driver＇s facial features reflecting fatigue and one indirect vehicle behavior feature indicating fatigue are considered. Meanwhile, T-S fuzzy neural network（TSFNN）is adopted to recognize the driving fatigue of drivers. For the structure identification of the TSFNN, subtractive clustering（SC） is used to confirm the fuzzy rules and their correlative parameters. Moreover, the particle swarm optimization （PSO）algorithm is improved to train the TSFNN. Simulation results and experiments on vehicles show that the proposed algorithm can effectively improve the convergence speed and the recognition accuracy of the TSFNN, as well as enhance the correct rate of driving fatigue detection.
基金supported by the 863 Program of China(No.2013AA064201)National Science and Technology Major Project(No.2016ZX05003-003)
文摘Various migration methods have been proposed to image high-angle geological structures and media with strong lateral velocity variations; however, the problems of low precision and high computational cost remain unresolved. To describe the seismic wave propagation in media with lateral velocity variations and to image high-angle structures, we propose the generalized screen propagator based on particle swarm optimization （PSO-GSP）, for the precise fitting of the single-square-root operator. We use the 2D SEG/EAGE salt model to test the proposed PSO-GSP migration method to image the faults beneath the salt dome and compare the results to those of the conventional high-order generalized screen propagator （GSP） migration and split-step Fourier （SSF） migration. Moreover, we use 2D marine data from the South China Sea to show that the PSO-GSP migration can better image strong reflectors than conventional imaging methods.
文摘In shock wave＇s pressure testing,a dynamic compensation digital filter is designed based on particle swarm optimization （PSO） algorithm.Dynamic calibration experiment and simulation are conducted for the pressure sensor.PSO algorithm is applied on Matlab platform to achieve optimization according to input and output data of the sensor as well as the reference model,and the global optimal values got by optimization become the parameters of the compensator.Finally,the dynamic compensation filter is established on LabVIEW platform.The experimental results show that the data after processing with the compensation filter truly reflects the input signal.
基金Supported by the Graduate Student Research Innovation Program of Jiangsu Province(CX08B-091Z)the Innovation and Excellence Foundation of Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ08-06)~~
文摘An improved particle swarm optimization （PSO） algorithm is investigated in the optimization of the attitude controller parameters of unmanned aerial vehicle （UAV）. Considering the stagnation phenomenon in the later phase of the basic PSO algorithm caused by the diversity scarcity of particles, a modified PSO algorithm is presented. For the basic PSO algorithm, the velocity of each particle is adjusted according to the inertia motion, the swarm previous best position and its own previous best position. However, in the improved PSO algorithm, each particle only learns from another randomly selected particle with higher performance, besides keeping the inertia motion. The inertia weight of the improved PSO algorithm is a random number. The modification decreases the uncertain parameters of the algorithm, simplifies the learning mechanism of the particle, and enhances the diversity of the swarm. Furthermore, a UAV attitude control system is built, and the improved PSO algorithm is applied in the optimized tuning of four controller parameters. Simulation results show that the improved PSO algorithm has stronger global searching ability than the common PSO algorithms, and obtains better UAV attitude control parameters.
基金The National High Technology Research and Development Program of China(863 Program)(No.2014AA01A702)the National Science and Technology Major Project(No.2013ZX03001032-004)+1 种基金the National Natural Science Foundation of China(No.6122100261201170)
文摘In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is proposed based on the modified particle swarm optimization（ MPSO） algorithm.The number of mobile stations（ MSs） served by e NBs, which is obtained based on the reference signal received power（RSRP） measured from the MS, is used as the metric for coverage optimization, and the coverage problem is optimized by maximizing the number of served MSs. In the MPSO algorithm, a swarm of particles known as the set of ATAs is available; the fitness function is defined as the total number of the served MSs; and the evolution velocity corresponds to the ATAs adjustment scale for each iteration cycle. Simulation results showthat compared with the fixed ATA, the number of served MSs by e NBs is significantly increased by 7. 2%, the quality of the received signal is considerably improved by 20 d Bm, and, particularly, the system throughput is also effectively increased by 55 Mbit / s.
基金co-supported by the National Natural Science Foundation of China(Nos.61273349,61203223)the Innovation Foundation of BUAA for Ph D Graduates(No.YWF-14-YJSY-013)
文摘Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank angle profile is developed to reduce the search space of unknown parameters based on the constrained PSO algorithm. The path constraints are enforced by setting the fitness function to be infinite on condition that the particles violate the maximum allowable values. The PSO algo- rithm also provides a much easier means to satisfy the terminal conditions by adding penalty terms to the fitness function. Furthermore, the approximate reentry landing footprint is fast constructed by incorporating an interpolation model into the standardized bank angle profiles. Numerical sim ulations demonstrate that the PSO method is a feasible and flexible tool to generate the end-to-end trajectory and landing footprint for hypersonic reentry vehicles.
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education(20114307120032)the National Natural Science Foundation of China(71201167)
文摘As for the drop of particle diversity and the slow convergent speed of particle in the late evolution period when particle swarm optimization（PSO） is applied to solve high-dimensional multi-modal functions,a hybrid optimization algorithm based on the cat mapping,the cloud model and PSO is proposed.While the PSO algorithm evolves a certain of generations,this algorithm applies the cat mapping to implement global disturbance of the poorer individuals,and employs the cloud model to execute local search of the better individuals;accordingly,the obtained best individuals form a new swarm.For this new swarm,the evolution operation is maintained with the PSO algorithm,using the parameter of pop distr to balance the global and local search capacity of the algorithm,as well as,adopting the parameter of mix gen to control mixing times of the algorithm.The comparative analysis is carried out on the basis of 4 functions and other algorithms.It indicates that this algorithm shows faster convergent speed and better solving precision for solving functions particularly those high-dimensional multi-modal functions.Finally,the suggested values are proposed for parameters pop distr and mix gen applied to different dimension functions via the comparative analysis of parameters.
