期刊文献+
共找到320,682篇文章
< 1 2 250 >
每页显示 20 50 100
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 认领 引用 被引量:2
1
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 EI CAS CSCD 北大核心 2026年第1期358-367,共10页
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. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
暂未订购 下载PDF
An Eulerian-Lagrangian parallel algorithm for simulation of particle-laden turbulent flows 认领 引用 被引量:1
2
作者 Harshal P.Mahamure Deekshith I.Poojary +1 位作者 Vagesh D.Narasimhamurthy Lihao Zhao 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2026年第1期15-34,共20页
This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in ... This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in turbulent carrier flow.The Eulerian framework numerically resolves turbulent carrier flow using a parallelized,finite-volume DNS solver on a staggered Cartesian grid.Particles are tracked using a point-particle method utilizing a Lagrangian particle tracking(LPT)algorithm.The proposed Eulerian-Lagrangian algorithm is validated using an inertial particle-laden turbulent channel flow for different Stokes number cases.The particle concentration profiles and higher-order statistics of the carrier and dispersed phases agree well with the benchmark results.We investigated the effect of fluid velocity interpolation and numerical integration schemes of particle tracking algorithms on particle dispersion statistics.The suitability of fluid velocity interpolation schemes for predicting the particle dispersion statistics is discussed in the framework of the particle tracking algorithm coupled to the finite-volume solver.In addition,we present parallelization strategies implemented in the algorithm and evaluate their parallel performance. 展开更多
关键词 DNS Eulerian-Lagrangian Particle tracking algorithm Point-particle Parallel software
暂未订购 下载PDF
Equivalent Modeling with Passive Filter Parameter Clustering for Photovoltaic Power Stations Based on a Particle Swarm Optimization K-Means Algorithm 认领 引用
3
作者 Binjiang Hu Yihua Zhu +3 位作者 Liang Tu Zun Ma Xian Meng Kewei Xu 《Energy Engineering》 EI 2026年第1期431-459,共29页
This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the compl... This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the complexities,simulation time cost and convergence problems of detailed PV power station models.First,the amplitude–frequency curves of different filter parameters are analyzed.Based on the results,a grouping parameter set for characterizing the external filter characteristics is established.These parameters are further defined as clustering parameters.A single PV inverter model is then established as a prerequisite foundation.The proposed equivalent method combines the global search capability of PSO with the rapid convergence of KMC,effectively overcoming the tendency of KMC to become trapped in local optima.This approach enhances both clustering accuracy and numerical stability when determining equivalence for PV inverter units.Using the proposed clustering method,both a detailed PV power station model and an equivalent model are developed and compared.Simulation and hardwarein-loop(HIL)results based on the equivalent model verify that the equivalent method accurately represents the dynamic characteristics of PVpower stations and adapts well to different operating conditions.The proposed equivalent modeling method provides an effective analysis tool for future renewable energy integration research. 展开更多
关键词 Photovoltaic power station multi-machine equivalentmodeling particle swarmoptimization K-means clustering algorithm
暂未订购 下载PDF
The Optimization Design of Particle-Reinforced Composite Materials Based on the Artificial Fish Swarm Algorithm and Voronoi Cell Finite Element Method 认领 引用
4
作者 Peng Zhang Ran Guo 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2026年第3期316-328,共13页
In this study,a collaborative optimization framework combining artificial fish swarm algorithm(AFSA)and Voronoi cell finite element method(VCFEM)is proposed to solve the problem of the influence of microstructure dist... In this study,a collaborative optimization framework combining artificial fish swarm algorithm(AFSA)and Voronoi cell finite element method(VCFEM)is proposed to solve the problem of the influence of microstructure distribution on the macroscopic mechanical properties of particle-reinforced composites.Compared with the traditional displacement-based finite element method,VCFEM significantly improves the computational efficiency of multi-inclusion problems by means of generalized stress function and element local adaptation technology,and accurately captures the stress field discontinuity and interface stress concentration phenomenon.At the same time,AFSA abandons the dependence of traditional optimization methods on simplified models,and directly searches for the global optimal solution through discrete topological variables(particle positions).Its natural selection mechanism and swarm intelligence characteristics effectively overcome the local optimal trap.The numerical simulation results show that the proposed method exhibits high accuracy in both single-and multi-inclusion models(the error with the commercial software MARC is less than 5%),and in the complex model with 100 inclusions,the maximum Mises stress is reduced by 32.6%after optimization.The synergistic effect of the two breaks through the trade-off between efficiency and accuracy in traditional optimization,and provides the ability of both computational efficiency and global optimization for multi-scale composite material design. 展开更多
关键词 Particle-reinforced composites Artificial fish swarm algorithm Voronoi cell finite element method Optimization algorithms
暂未订购 下载PDF
Path planning of unmanned surface vehicles based on improved particle swarm optimization algorithm with consideration of particle sight distance 认领 引用
5
作者 WANG Cheng YANG Junnan +3 位作者 ZHANG Xinyang QIAN Zhong ZHU Ye LIU Hong 《上海海事大学学报》 北大核心 2026年第1期9-19,共11页
To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the conc... To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs. 展开更多
关键词 particle swarm optimization algorithm(PSO) sight distance unmanned surface vehicle(USV)
暂未订购 下载PDF
Improved Artificial Rabbit Optimization Algorithm Fused with Particle Swarm Optimization for Wireless Sensor Network Coverage Optimization 认领 引用 被引量:1
6
作者 WU Jin SU Zhengdong 《Journal of Shanghai Jiaotong university(Science)》 EI 2026年第2期375-389,共15页
Aiming at the problem of low node coverage during node deployment in wireless sensor network(WSN),an improved artificial rabbit optimization algorithm incorporating particle swarm optimization(ARO-PSO)is proposed for ... Aiming at the problem of low node coverage during node deployment in wireless sensor network(WSN),an improved artificial rabbit optimization algorithm incorporating particle swarm optimization(ARO-PSO)is proposed for network coverage optimization.ARO-PSO successfully combines the stochastic characteristics of ARO and the global characteristics of PSO.Firstly,to optimize the quality of the initial population,Sine chaos mapping is introduced to initialize the population;secondly,to better balance the exploration and exploitation,adaptive settings are made;finally,combined with the characteristics of the ARO energy factor,a population decreasing strategy is introduced to further accelerate the convergence speed of the algorithm.Experimental and analytical comparisons are made with ARO and PSO and 6 other excellent optimizers on 13 benchmark functions.The results show that ARO-PSO largely outperforms the original algorithm.Finally,ARO-PSO is applied to WSN coverage optimization experiments in 2D and 3D environments,and the proposed algorithm exhibits higher network coverage and improves the monitoring quality of the network compared to standard ARO and PSO and other state-of-the-art algorithms.The experimental results fully demonstrate the superiority of the ARO-PSO-based WSN node deployment optimization method. 展开更多
关键词 wireless sensor network(WSN) swarm intelligence optimization artificial rabbits optimization(ARO) particle swarm optimization(PSO) coverage optimization
暂未订购 下载PDF
Structural optimization of magnetic flux concentrator based on particle swarm optimization algorithm 认领 引用
7
作者 Yu-Xiao Wang Shi-Yu Guan +3 位作者 Yi Zhang Qi-Yuan Jiang Bing-Feng Sun Zhong-Qi Tan 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第4期373-383,共11页
This study introduces a structural optimization method for magnetic flux concentrators(MFCs)utilizing the particle swarm optimization(PSO)algorithm,addressing inefficiencies and challenges in achieving optimal structu... This study introduces a structural optimization method for magnetic flux concentrators(MFCs)utilizing the particle swarm optimization(PSO)algorithm,addressing inefficiencies and challenges in achieving optimal structures with traditional methods.By integrating the PSO algorithm with COMSOL Multiphysics simulation software,a co-simulation framework is developed to optimize the parameters of a conical MFC.Compared with traditional methods,this approach enhances optimization results by twofold,achieving a magnetic field amplification factor of up to 200 within the defined parameter range.Additionally,an evaluation criterion for concentrator optimization is proposed,offering novel insights for designing concentrators across various scenarios. 展开更多
关键词 magnetic flux concentrator magnetic sensing enhancement particle swarm optimization
暂未订购 下载PDF
A hybrid method based on particle swarm optimization and machine learning algorithm for predicting droplet diameter in a microfluidic T-junction 认领 引用
8
作者 F.ESLAMI R.KAMALI 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2026年第1期203-214,共12页
Droplet-based microfluidics is a transformative technology with applications across diverse scientific and industrial domains.However,predicting the droplet size generated by individual microchannels before experiment... Droplet-based microfluidics is a transformative technology with applications across diverse scientific and industrial domains.However,predicting the droplet size generated by individual microchannels before experiments or simulations remains a significant challenge.In this study,we focus on a double T-junction microfluidic geometry and employ a hybrid modeling approach that combines machine learning with metaheuristic optimization to address this issue.Specifically,particle swarm optimization(PSO)is used to optimize the hyperparameters of a decision tree(DT)model,and its performance is compared with that of a DT optimized through grid search(GS).The hybrid models are developed to estimate the droplet diameter based on four parameters:the main width,side width,thickness,and flow rate ratio.The dataset of more than 300 cases,generated by a three-dimensional numerical model of the double T-junction,is used for training and testing.Multiple evaluation metrics confirm the predictive accuracy of the models.The results demonstrate that the proposed DT-PSO model achieves higher accuracy,with a coefficient of determination of 0.902 on the test data,while simultaneously reducing prediction time.This methodology holds the potential to minimize design iterations and accelerate the integration of microfluidic technology into the biological sciences. 展开更多
关键词 droplet-based microfluidics decision tree(DT) particle swarm optimization(PSO) double T-junction grid search(GS)
暂未订购 下载PDF
Physics-informed neural network optimized by particle swarm algorithm for accurate prediction of blast-induced peak particle velocity 认领 引用
9
作者 Lang Qiu Yujie Zhu +3 位作者 Chen Xu Gaofeng Ren Yingguo Hu Xiaoli Liu 《Intelligent Geoengineering》 2025年第3期126-140,共15页
Accurately forecasting peak particle velocity(PPV)during blasting operations plays a crucial role in mitigating vibration-related hazards and preventing economic losses.This research introduces an approach to PPV pred... Accurately forecasting peak particle velocity(PPV)during blasting operations plays a crucial role in mitigating vibration-related hazards and preventing economic losses.This research introduces an approach to PPV prediction by combining conventional empirical equations with physics-informed neural networks(PINN)and optimizing the model parameters via the Particle Swarm Optimization(PSO)algorithm.The proposed PSO-PINN framework was rigorously benchmarked against seven established machine learning approaches:Multilayer Perceptron(MLP),Extreme Gradient Boosting(XGBoost),Random Forest(RF),Support Vector Regression(SVR),Gradient Boosting Decision Tree(GBDT),Adaptive Boosting(Adaboost),and Gene Expression Programming(GEP).Comparative analysis showed that PSO-PINN outperformed these models,achieving RMSE reductions of 17.82-37.63%,MSE reductions of 32.47-61.10%,AR improvements of 2.97-21.19%,and R2enhancements of 7.43-29.21%,demonstrating superior accuracy and generalization.Furthermore,the study determines the impact of incorporating empirical formulas as physical constraints in neural networks and examines the effects of different empirical equations,particle swarm size,iteration count in PSO,regularization coefficient,and learning rate in PINN on model performance.Lastly,a predictive system for blast vibration PPV is designed and implemented.The research outcomes offer theoretical references and practical recommendations for blast vibration forecasting in similar engineering applications. 展开更多
关键词 Peak particle velocity Blast-induced vibration Particle Swarm Optimization algorithm Physics-informed neural network Prediction system
暂未订购 下载PDF
An Improved Animated Oat Optimization Algorithm with Particle Swarm Optimization for Dry Eye Disease Classification 认领 引用 被引量:1
10
作者 Essam H.Houssein Eman Saber Nagwan Abdel Samee 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第8期2445-2480,共36页
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. 展开更多
关键词 Feature selection(FS) machine learning(ML) animated oat optimization algorithm(AOO) dry eye disease(DED) oppositional-based learning(OBL) particle swarm optimization(PSO)
暂未订购 下载PDF
Particle Swarm Optimization Algorithm for Feature Selection Inspired by Peak Ecosystem Dynamics 认领 引用
11
作者 Shaobo Deng Meiru Xie +3 位作者 Bo Wang Shuaikun Zhang Sujie Guan Min Li 《Computers, Materials & Continua》 SCIE EI 2025年第2期2723-2751,共29页
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. 展开更多
关键词 Machine learning feature selection evolutionary algorithm particle swarm optimization
暂未订购 下载PDF
An improved particle swarm optimization algorithm based urban rail passenger flow prediction model:a case study in Beijing,China 认领 引用 被引量:1
12
作者 Song Hu Meichen Ji +2 位作者 Zheng Chang Haipeng Wang Xiangfei Kong 《Digital Transportation and Safety》 2025年第2期101-107,共7页
To accurately predict the passenger flow of urban rail transit under different external conditions,the distribution characteristics of urban rail passenger flow were analyzed using the AFC data of rail transit,and thr... To accurately predict the passenger flow of urban rail transit under different external conditions,the distribution characteristics of urban rail passenger flow were analyzed using the AFC data of rail transit,and three influencing factors of urban rail passenger flow were extracted.The typical support vector regression(SVR)algorithm was utilized to construct the passenger flow prediction model of the urban rail,then we proposed an improved particle swarm optimization(IPSO)algorithm for optimizing the prediction model.Finally,the prediction accuracy of the proposed model was verified by comparative analysis.The results show that the IPSO-SVR passenger flow prediction model has better prediction accuracy compared with the SVR and long short-term memory networks(LSTM)models,also the traditional grid optimization method,the mean square error(MSE),and relative accuracy(RA)are 1.54%and 92.37%.The validation of model performance is carried out compared with three other models in a previous study.There is a positive correlation between the model prediction errors and the scale of urban rail transit passenger flow.The three influencing variables of the time segments,working day type,and weather can also effectively characterize the coupling characteristics of urban rail passenger flow,and improve the model prediction accuracy.The results have important application value for evaluating passenger flow status,improving the operation quality,and operation organization of urban rail transit. 展开更多
关键词 Urban rail transit Passenger flow forecast Influencing factors Improved particle swarm optimization IPSO-SVR model
暂未订购 下载PDF
Enhanced Particle Swarm Optimization Algorithm Based on SVM Classifier for Feature Selection 认领 引用
13
作者 Xing Wang Huazhen Liu +2 位作者 Abdelazim G.Hussien Gang Hu Li Zhang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第3期2791-2839,共49页
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. 展开更多
关键词 Feature selection SVM particle swarm optimization sand cat swarm optimization engineering problems
暂未订购 下载PDF
Evolutionary Particle Swarm Optimization Algorithm Based on Collective Prediction for Deployment of Base Stations 认领 引用
14
作者 Jiaying Shen Donglin Zhu +5 位作者 Yujia Liu Leyi Wang Jialing Hu Zhaolong Ouyang Changjun Zhou Taiyong Li 《Computers, Materials & Continua》 SCIE EI 2025年第1期345-369,共25页
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. 展开更多
关键词 Particle swarm optimization effective coverage area global optimization base station deployment
暂未订购 下载PDF
Optimal Linear Phase Finite Impulse Response Band Pass Filter Design Using Craziness Based Particle Swarm Optimization Algorithm 认领 引用
15
作者 SANGEETA Mandal SAKTI Prasad Ghoshal +1 位作者 RAJIB Kar DURBADAL Mandal 《Journal of Shanghai Jiaotong university(Science)》 EI 2011年第6期696-703,共8页
An efficient method is proposed for the design of finite impulse response(FIR) filter with arbitrary pass band edge,stop band edge frequencies and transition width.The proposed FIR band stop filter is designed using c... An efficient method is proposed for the design of finite impulse response(FIR) filter with arbitrary pass band edge,stop band edge frequencies and transition width.The proposed FIR band stop filter is designed using craziness based particle swarm optimization(CRPSO) approach.Given the filter specifications to be realized,the CRPSO algorithm generates a set of optimal filter coefficients and tries to meet the ideal frequency response characteristics.In this paper,for the given problem,the realizations of the optimal FIR band pass filters of different orders have been performed.The simulation results have been compared with those obtained by the well accepted evolutionary algorithms,such as Parks and McClellan algorithm(PMA),genetic algorithm(GA) and classical particle swarm optimization(PSO).Several numerical design examples justify that the proposed optimal filter design approach using CRPSO outperforms PMA and PSO,not only in the accuracy of the designed filter but also in the convergence speed and solution quality. 展开更多
关键词 finite impulse response(FIR) filter particle swarm optimization(PSO) craziness based particle swarm optimization(CRPSO) Parks and McClellan algorithm(PMA) genetic algorithm(GA) optimization
暂未订购 下载PDF
A dual-constrained watershed algorithm for bean particle segmentation and sizing 认领 引用
16
作者 ZHUANG Licheng GE Boang +2 位作者 HU Jun SONG Yiheng LIU Sheng 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2025年第4期526-536,共11页
Accurate measurement of bean particle size is essential for automated grading and quality control in agricultural processing.However,existing image segmentation methods often suffer from low efficiency,over-segmentati... Accurate measurement of bean particle size is essential for automated grading and quality control in agricultural processing.However,existing image segmentation methods often suffer from low efficiency,over-segmentation,and high computational cost.We proposed a distancegradient dual constrained watershed algorithm for precise segmentation and measurement of bean particles.The method integrated distance transform-based seed extraction with gradient-constrained flooding,effectively suppressing noise-induced region fragmentation and improving the separation of adherent particles.An experimental platform was constructed using an industrial camera and an image-processing pipeline to evaluate performance.Compared with the conventional watershed algorithm,the proposed method improves segmentation accuracy by 7.2%and reduces the mean particle size error by 27.8%(0.13 mm,representing a relative error of 2.4%).Validation on three soybean varieties confirmed the robustness and generalizability of the approach.The results indicated that the proposed algorithm provided an efficient and accurate technique for agricultural particle size analysis,offering potential for integration into practical low-cost inspection systems. 展开更多
关键词 distance-gradient dual constraint watershed algorithm machine vision inspection system particle size sorting precision agriculture metrology
暂未订购 下载PDF
A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy 认领 引用 被引量:2
17
作者 Li Ma Cai Dai +1 位作者 Xingsi Xue Cheng Peng 《Computers, Materials & Continua》 SCIE EI 2025年第1期997-1026,共30页
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. 展开更多
关键词 Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy
暂未订购 下载PDF
An extended particle swarm optimization algorithm based on coarse-grained and fine-grained criteria and its application 认领 引用 被引量:2
18
作者 李星梅 张立辉 +1 位作者 乞建勋 张素芳 《Journal of Central South University of Technology》 2008年第1期141-146,共6页
In order to study the problem that particle swarm optimization (PSO) algorithm can easily trap into local mechanism when analyzing the high dimensional complex optimization problems, the optimization calculation using... In order to study the problem that particle swarm optimization (PSO) algorithm can easily trap into local mechanism when analyzing the high dimensional complex optimization problems, the optimization calculation using the information in the iterative process of more particles was analyzed and the optimal system of particle swarm algorithm was improved. The extended particle swarm optimization algorithm (EPSO) was proposed. The coarse-grained and fine-grained criteria that can control the selection were given to ensure the convergence of the algorithm. The two criteria considered the parameter selection mechanism under the situation of random probability. By adopting MATLAB7.1, the extended particle swarm optimization algorithm was demonstrated in the resource leveling of power project scheduling. EPSO was compared with genetic algorithm (GA) and common PSO, the result indicates that the variance of the objective function of resource leveling is decreased by 7.9%, 18.2%, respectively, certifying the effectiveness and stronger global convergence ability of the EPSO. 展开更多
关键词 particle swarm extended particle swarm optimization algorithm resource leveling
暂未订购 下载PDF
Reliability Topology Optimization Based on Kriging-Assisted Level Set Function and Novel Dynamic Hybrid Particle Swarm Optimization Algorithm 认领 引用 被引量:1
19
作者 Hang Zhou Xiaojun Ding +1 位作者 Song Chen Qijun Zhang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第8期1907-1933,共27页
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. 展开更多
关键词 Reliability topology optimization kriging model level set function dynamic hybrid particle swarm optimization engineering structure
暂未订购 下载PDF
Multi-Level Subpopulation-Based Particle Swarm Optimization Algorithm for Hybrid Flow Shop Scheduling Problem with Limited Buffers 认领 引用 被引量:1
20
作者 Yuan Zou Chao Lu +1 位作者 Lvjiang Yin Xiaoyu Wen 《Computers, Materials & Continua》 SCIE EI 2025年第8期2305-2330,共26页
The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on th... The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP. 展开更多
关键词 Hybrid flow shop scheduling problem limited buffers PSO algorithm collaborative search blocking phenomenon
暂未订购 下载PDF
上一页 1 2 250 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈