This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspens...This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspension system. Based on the new nonlinear creep model derived from combining Hertz contact theory, Kalker's linear theory and a heuristic nonlinear creep model, the modeling and dynamic analysis of a 24 degree-of-freedom railway vehicle system were investigated. The Lyapunov indirect method was used to examine the effects of suspension parameters, wheel conicities and wheel rolling radii on critical hunting speeds. Generally, the critical hunting speeds of a vehicle system resulting from worn wheels with different wheel rolling radii are lower than those of a vehicle system having original wheels without different wheel rolling radii. Because of worn wheels, the critical hunting speed of a running railway vehicle substantially declines over the long term. For safety reasons, it is necessary to design the suspension system parameters to increase the robustness of the system and decrease the sensitive of wheel noises. By applying UD and QPSO, the nominal-the-best signal-to-noise ratio of the system was increased from -48.17 to -34.05 dB. The rate of improvement was 29.31%. This study has demonstrated that the integration of UD and QPSO can successfully reveal the optimal solution of suspension parameters for solving the robust design problem of a railway vehicle suspension system.展开更多
The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy ...The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.展开更多
The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms appli...The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling.This paper analyzed the motion pattern of particles in a square potential well,given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well(BC-QSPSO).In this novel algorithm,the intrinsic cognitive link between particles’experience information and group sharing information was created by using normal Copula function.After that,the control parameters chosen strategy gives through experiments.Finally,the simulation results of the test functions show that the improved algorithms outperform the original QPSO algorithm and due to the error gradient information will not be over utilized in square potential well,the particles are easy to jump out of the local optimum,the BC-QSPSO is more suitable to solve the functions with correlative variables.展开更多
This paper proposes a novel quantum-behaved particle swarm optimization （NQPSO） for the estimation of chaos＇ unknown parameters by transforming them into nonlinear functions＇ optimization. By means of the techniqu...This paper proposes a novel quantum-behaved particle swarm optimization （NQPSO） for the estimation of chaos＇ unknown parameters by transforming them into nonlinear functions＇ optimization. By means of the techniques in the following three aspects： contracting the searching space self-adaptively; boundaries restriction strategy; substituting the particles＇ convex combination for their centre of mass, this paper achieves a quite effective search mechanism with fine equilibrium between exploitation and exploration. Details of applying the proposed method and other methods into Lorenz systems are given, and experiments done show that NQPSO has better adaptability, dependability and robustness. It is a successful approach in unknown parameter estimation online especially in the cases with white noises.展开更多
To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordina...To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneously adjust two parameters of qubits, and can automatically achieve the best matching of two adjustments. The optimization process is employed in the n-dimensional space [-1, 1]n, so this approach fits to many optimization problems. The experimental results show that this algorithm is superior to the original quantum-behaved PSO.展开更多
This paper presents an online AUV(autonomous underwater vehicle)path planner that employs path replanning approach and the SDEQPSO(selective differential evolution-hybridized quantum-behaved particle swarm optimizatio...This paper presents an online AUV(autonomous underwater vehicle)path planner that employs path replanning approach and the SDEQPSO(selective differential evolution-hybridized quantum-behaved particle swarm optimization)algorithm to optimize an AUV mission conducted in an unknown,dynamic and cluttered ocean environment.The proposed path replanner considered the effect of ocean currents in path optimization to generate a Pareto-optimal path that guides the AUV to its target within minimum time.The optimization was based on the onboard sensor data measured from the environment,which consists of a priori unknown dynamic obstacles and spatiotemporal currents.Different sensor arrangements for the forward-looking sonar and horizontal acoustic Doppler current profiler(H-ADCP)were considered in 2D and 3D simulations.Based on the simulation results,the SDEQPSO path replanner was found to be capable of generating a time-optimal path that offered up to 13%reduction in travel time compared to the situation where the vehicle simply followed a path with the shortest distance.The proposed replanning technique also showed consistently better performance over a reactive path planner in terms of solution quality,stability,and computational efficiency.Robustness of the replanner was verified under stochastic process using the Monte Carlo method.The generated path fulfilled the vehicle’s safety and physical constraints,while intelligently exploiting ocean currents to improve the vehicle’s efficiency.展开更多
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP ...Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.展开更多
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.展开更多
Complex autonomous dynamical systems require sophisticated optimization methods that encompass environment awareness,path planning,and decision-making.swarm intelligence algorithms,inspired by natural phenomena such a...Complex autonomous dynamical systems require sophisticated optimization methods that encompass environment awareness,path planning,and decision-making.swarm intelligence algorithms,inspired by natural phenomena such as bird flocks and fish schools,have undergone significant advancements over recent decades.This paper provides a comprehensive review of particle swarm optimization(PSO)in the context of autonomous systems.We specifically examine the application of PSO to multi-agent dynamical systems,reviewing how PSO variants are employed to tackle diverse optimization challenges across various platforms,including ground vehicles,autonomous underwater vehicles,and unmanned aerial vehicles.Additionally,we delve into the use of PSO within swarm robotics and multi-agent systems.The paper concludes with an outline of potential future research directions,particularly focusing on the application of PSO to the multi-agent rendezvous problem in autonomous systems.展开更多
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.展开更多
A large number of features are involved in fault diagnosis,and it is challenging to identify important and relative features for fault classification.Feature selection selects suitable features from the fault dataset ...A large number of features are involved in fault diagnosis,and it is challenging to identify important and relative features for fault classification.Feature selection selects suitable features from the fault dataset to determine the root cause of the fault.Particle swarm optimization(PSO)has shown promising results in performing feature selection due to its promising search effectiveness and ease of implementation.However,most PSObased feature selection approaches for fault diagnosis do not adequately take domain-specific a priori knowledge into account.In this study,we propose a correlation-guided PSO feature selection approach for fault diagnosis that focuses on improving the initialisation effectiveness,individual exploration ability,and population diversity.To be more specific,an initialisation strategy based on feature correlation is designed to enhance the quality of the initial population,while a probability individual updating mechanism is proposed to improve the exploitation ability.In addition,a sample shrinkage strategy is developed to enhance the ability to jump out of local optimal.Results on four public fault diagnosis datasets show that the proposed approach can select smaller feature subsets to achieve higher classification accuracy than other state-of-the-art feature selection methods in most cases.Furthermore,the effectiveness of the proposed approach is also verified by examining real-world fault diagnosis problems.展开更多
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.展开更多
基金the Ministry of Science and Technology of Taiwan (Grants MOST 104-2221-E-327019, MOST 105-2221-E-327-014) for financial support of this study
文摘This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspension system. Based on the new nonlinear creep model derived from combining Hertz contact theory, Kalker's linear theory and a heuristic nonlinear creep model, the modeling and dynamic analysis of a 24 degree-of-freedom railway vehicle system were investigated. The Lyapunov indirect method was used to examine the effects of suspension parameters, wheel conicities and wheel rolling radii on critical hunting speeds. Generally, the critical hunting speeds of a vehicle system resulting from worn wheels with different wheel rolling radii are lower than those of a vehicle system having original wheels without different wheel rolling radii. Because of worn wheels, the critical hunting speed of a running railway vehicle substantially declines over the long term. For safety reasons, it is necessary to design the suspension system parameters to increase the robustness of the system and decrease the sensitive of wheel noises. By applying UD and QPSO, the nominal-the-best signal-to-noise ratio of the system was increased from -48.17 to -34.05 dB. The rate of improvement was 29.31%. This study has demonstrated that the integration of UD and QPSO can successfully reveal the optimal solution of suspension parameters for solving the robust design problem of a railway vehicle suspension system.
基金Project supported by the Zhejiang Provincial Natural Science Foundation (Grant No.LQ20F020011)the Gansu Provincial Foundation for Distinguished Young Scholars (Grant No.23JRRA766)+1 种基金the National Natural Science Foundation of China (Grant No.62162040)the National Key Research and Development Program of China (Grant No.2020YFB1713600)。
文摘The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.
基金This research was funded by National Key Research and Development Program of China(Grant No.2018YFC1507005)China Postdoctoral Science Foundation(Grant No.2018M643448)+1 种基金Sichuan Science and Technology Program(Grant No.2019YFG0110)Fundamental Research Funds for the Central Universities,Southwest Minzu University(Grant No.2019NQN22).
文摘The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling.This paper analyzed the motion pattern of particles in a square potential well,given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well(BC-QSPSO).In this novel algorithm,the intrinsic cognitive link between particles’experience information and group sharing information was created by using normal Copula function.After that,the control parameters chosen strategy gives through experiments.Finally,the simulation results of the test functions show that the improved algorithms outperform the original QPSO algorithm and due to the error gradient information will not be over utilized in square potential well,the particles are easy to jump out of the local optimum,the BC-QSPSO is more suitable to solve the functions with correlative variables.
基金Project supported by the National Natural Science Foundation of China (Grant No 10647141)
文摘This paper proposes a novel quantum-behaved particle swarm optimization （NQPSO） for the estimation of chaos＇ unknown parameters by transforming them into nonlinear functions＇ optimization. By means of the techniques in the following three aspects： contracting the searching space self-adaptively; boundaries restriction strategy; substituting the particles＇ convex combination for their centre of mass, this paper achieves a quite effective search mechanism with fine equilibrium between exploitation and exploration. Details of applying the proposed method and other methods into Lorenz systems are given, and experiments done show that NQPSO has better adaptability, dependability and robustness. It is a successful approach in unknown parameter estimation online especially in the cases with white noises.
文摘To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneously adjust two parameters of qubits, and can automatically achieve the best matching of two adjustments. The optimization process is employed in the n-dimensional space [-1, 1]n, so this approach fits to many optimization problems. The experimental results show that this algorithm is superior to the original quantum-behaved PSO.
基金The authors acknowledge Autonomous Maritime Systems Laboratory(AMSL)in the Australian Maritime College(AMC)for providing the data from the open water trial conducted in July 2017 at Beauty Point,Tasmania,Australia.
文摘This paper presents an online AUV(autonomous underwater vehicle)path planner that employs path replanning approach and the SDEQPSO(selective differential evolution-hybridized quantum-behaved particle swarm optimization)algorithm to optimize an AUV mission conducted in an unknown,dynamic and cluttered ocean environment.The proposed path replanner considered the effect of ocean currents in path optimization to generate a Pareto-optimal path that guides the AUV to its target within minimum time.The optimization was based on the onboard sensor data measured from the environment,which consists of a priori unknown dynamic obstacles and spatiotemporal currents.Different sensor arrangements for the forward-looking sonar and horizontal acoustic Doppler current profiler(H-ADCP)were considered in 2D and 3D simulations.Based on the simulation results,the SDEQPSO path replanner was found to be capable of generating a time-optimal path that offered up to 13%reduction in travel time compared to the situation where the vehicle simply followed a path with the shortest distance.The proposed replanning technique also showed consistently better performance over a reactive path planner in terms of solution quality,stability,and computational efficiency.Robustness of the replanner was verified under stochastic process using the Monte Carlo method.The generated path fulfilled the vehicle’s safety and physical constraints,while intelligently exploiting ocean currents to improve the vehicle’s efficiency.
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
文摘Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.
文摘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.
基金supported in part by the NASA South Carolina Space Grant Consortium(5121383-UG-SC-006).Recommended by Associate Editor Xin Luo.
文摘Complex autonomous dynamical systems require sophisticated optimization methods that encompass environment awareness,path planning,and decision-making.swarm intelligence algorithms,inspired by natural phenomena such as bird flocks and fish schools,have undergone significant advancements over recent decades.This paper provides a comprehensive review of particle swarm optimization(PSO)in the context of autonomous systems.We specifically examine the application of PSO to multi-agent dynamical systems,reviewing how PSO variants are employed to tackle diverse optimization challenges across various platforms,including ground vehicles,autonomous underwater vehicles,and unmanned aerial vehicles.Additionally,we delve into the use of PSO within swarm robotics and multi-agent systems.The paper concludes with an outline of potential future research directions,particularly focusing on the application of PSO to the multi-agent rendezvous problem in autonomous systems.
文摘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.
基金supported in part by the National Natural Science Foundation of China(62206255,62476254,62176238,U23A20340)Natural Science Foundation of Henan(252300421501)+3 种基金Young Talents Lifting Project of Henan Association for Scienceand Technology(2024HYTP023)Frontier Exploration Projects of Longmen Laboratory(LMQYTSKT031)Program for Science&Technology Innovation Talents in Universities of Henan Province(23HASTIT023)Key Research and Development Program of Henan(251111113900,241111210100).
文摘A large number of features are involved in fault diagnosis,and it is challenging to identify important and relative features for fault classification.Feature selection selects suitable features from the fault dataset to determine the root cause of the fault.Particle swarm optimization(PSO)has shown promising results in performing feature selection due to its promising search effectiveness and ease of implementation.However,most PSObased feature selection approaches for fault diagnosis do not adequately take domain-specific a priori knowledge into account.In this study,we propose a correlation-guided PSO feature selection approach for fault diagnosis that focuses on improving the initialisation effectiveness,individual exploration ability,and population diversity.To be more specific,an initialisation strategy based on feature correlation is designed to enhance the quality of the initial population,while a probability individual updating mechanism is proposed to improve the exploitation ability.In addition,a sample shrinkage strategy is developed to enhance the ability to jump out of local optimal.Results on four public fault diagnosis datasets show that the proposed approach can select smaller feature subsets to achieve higher classification accuracy than other state-of-the-art feature selection methods in most cases.Furthermore,the effectiveness of the proposed approach is also verified by examining real-world fault diagnosis problems.
基金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.
