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.展开更多
Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algori...Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.展开更多
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.展开更多
To get the movement mode and driving mechanism similar to human shoulder joint,a six degrees of freedom(DOF) serial-parallel bionic shoulder joint mechanism driven by pneumatic muscle actuators(PMAs)was designed.Howev...To get the movement mode and driving mechanism similar to human shoulder joint,a six degrees of freedom(DOF) serial-parallel bionic shoulder joint mechanism driven by pneumatic muscle actuators(PMAs)was designed.However,the structural parameters of the shoulder joint will affect various performances of the mechanism.To obtain the optimal structure parameters,the particle swarm optimization(PSO) was used.Besides,the mathematical expressions of indexes of rotation ranges,maximum bearing torque,discrete dexterity and muscle shrinkage of the bionic shoulder joint were established respectively to represent its many-sided characteristics.And the multi-objective optimization problem was transformed into a single-objective optimization problem by using the weighted-sum method.The normalization method and adaptive-weight method were used to determine each optimization index's weight coefficient;then the particle swarm optimization was used to optimize the integrated objective function of the bionic shoulder joint and the optimal solution was obtained.Compared with the average optimization generations and the optimal target values of many experiments,using adaptive-weight method to adjust weights of integrated objective function is better than using normalization method,which validates superiority of the adaptive-weight method.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectu...Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.展开更多
An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization(PSO) algorithm was constructed.As a new surrogate model technology,Kriging model has better fitting precision ...An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization(PSO) algorithm was constructed.As a new surrogate model technology,Kriging model has better fitting precision for nonlinear problem.The Kriging model was adopted to replace computer aided engineering(CAE) simulation as fitness function of multi-objective PSO algorithm,and the computation cost can be reduced greatly.By introducing multi-objective handling mechanism of crowding distance and mutation operator to multiobjective PSO algorithm,the entire Pareto front can be approximated better.It is shown that the multi-objective optimization strategy can get higher solving accuracy and computation efficiency under small sample.展开更多
Most image segmentation methods based on clustering algorithms use singleobjective function to implement image segmentation.To avoid the defect,this paper proposes a new image segmentation method based on a multi-obje...Most image segmentation methods based on clustering algorithms use singleobjective function to implement image segmentation.To avoid the defect,this paper proposes a new image segmentation method based on a multi-objective particle swarm optimization(PSO)clustering algorithm.This unsupervised algorithm not only offers a new similarity computing approach based on electromagnetic forces,but also obtains the proper number of clusters which is determined by scale-space theory.It is experimentally demonstrated that the applicability and effectiveness of the proposed multi-objective PSO clustering algorithm.展开更多
Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one...Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shor...Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shorten the navigation time.Ac-cordingly,planning a multi-objective route for ships is an effective way to achieve these goals.In this paper,we propose a multi-ob-jective optimal ship weather routing system framework.Based on this framework,a ship route model,ship fuel consumption model,and navigation risk model are established,and a non-dominated sorting and multi-objective ship weather routing algorithm based on particle swarm optimization is proposed.To fasten the convergence of the algorithm and improve the diversity of route solutions,a mutation operation and an elite selection operation are introduced in the algorithm.Based on the Pareto optimal front and Pareto optimal solution set obtained by the algorithm,a recommended route selection criterion is designed.Finally,two sets of simulated navigation simulation experiments on a container ship are conducted.The experimental results show that the proposed multi-objective optimal weather routing system can be used to plan a ship route with low navigation risk,short navigation time,and low fuel consumption,fulfilling the safety,efficiency,and economic goals.展开更多
An application of multi-objective particle swarm optimization （MOPSO） algorithm for optimization of the hydrological model （HYMOD） is presented in this paper. MOPSO algorithm is used to find non-dominated solution...An application of multi-objective particle swarm optimization （MOPSO） algorithm for optimization of the hydrological model （HYMOD） is presented in this paper. MOPSO algorithm is used to find non-dominated solutions with two objectives： high flow Nash-Sutcliffe efficiency and low flow Nash- Sutcliffe efficiency. The two sets＇ coverage rate and Pareto front spacing metric are two criterions to analyze the performance of the algorithms. MOPSO algorithm surpasses multi-objective shuffled complex evolution metcopolis （MOSCEM_UA） algorithr~, in terms of the two sets＇ coverage rate. But when we come to Pareto front spacing rate, the non-dominated solutions of MOSCEM_ UA algorithm are better-distributed than that of MOPSO algorithm when the iteration is set to 40 000. In addition, there are obvious conflicts between the two objectives. But a compromise solution can be acquired by adopting the MOPSO algorithm.展开更多
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.展开更多
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.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipula...The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.展开更多
Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation...Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation shows that this new method makes the optimization perfectly and convergence quickly.展开更多
Deep deterministic policy gradient(DDPG)has been proved to be effective in optimizing particle swarm optimization(PSO),but whether DDPG can optimize multi-objective discrete particle swarm optimization(MODPSO)remains ...Deep deterministic policy gradient(DDPG)has been proved to be effective in optimizing particle swarm optimization(PSO),but whether DDPG can optimize multi-objective discrete particle swarm optimization(MODPSO)remains to be determined.The present work aims to probe into this topic.Experiments showed that the DDPG can not only quickly improve the convergence speed of MODPSO,but also overcome the problem of local optimal solution that MODPSO may suffer.The research findings are of great significance for the theoretical research and application of MODPSO.展开更多
Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local s...Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.展开更多
基金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 Foundation of the Scientific and Technological Innovation Team of Colleges and Universities in Henan Province(Grant No.181RTSTHN009)the Foundation of the Key Laboratory of Water Environment Simulation and Treatment in Henan Province(Grant No.2017016).
文摘Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.
文摘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.
基金the National Natural Science Foundation of China(NO.51405229)the Natural Science Foundation of Jiangsu Province of China(Nos.BK20151470 and BK20130796)
文摘To get the movement mode and driving mechanism similar to human shoulder joint,a six degrees of freedom(DOF) serial-parallel bionic shoulder joint mechanism driven by pneumatic muscle actuators(PMAs)was designed.However,the structural parameters of the shoulder joint will affect various performances of the mechanism.To obtain the optimal structure parameters,the particle swarm optimization(PSO) was used.Besides,the mathematical expressions of indexes of rotation ranges,maximum bearing torque,discrete dexterity and muscle shrinkage of the bionic shoulder joint were established respectively to represent its many-sided characteristics.And the multi-objective optimization problem was transformed into a single-objective optimization problem by using the weighted-sum method.The normalization method and adaptive-weight method were used to determine each optimization index's weight coefficient;then the particle swarm optimization was used to optimize the integrated objective function of the bionic shoulder joint and the optimal solution was obtained.Compared with the average optimization generations and the optimal target values of many experiments,using adaptive-weight method to adjust weights of integrated objective function is better than using normalization method,which validates superiority of the adaptive-weight method.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
基金funded by Deanship of Graduate studies and Scientific Research at Jouf University under grant No.(DGSSR-2023-2-02038).
文摘Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.
基金the National Natural Science Foundation of China (No. 50873060)
文摘An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization(PSO) algorithm was constructed.As a new surrogate model technology,Kriging model has better fitting precision for nonlinear problem.The Kriging model was adopted to replace computer aided engineering(CAE) simulation as fitness function of multi-objective PSO algorithm,and the computation cost can be reduced greatly.By introducing multi-objective handling mechanism of crowding distance and mutation operator to multiobjective PSO algorithm,the entire Pareto front can be approximated better.It is shown that the multi-objective optimization strategy can get higher solving accuracy and computation efficiency under small sample.
基金This work was supported by the National Natural Science Foundation of China(Nos.61772242,61402204,61572239)Research Fund for Advanced Talents of Jiangsu University(No.14JDG141)+2 种基金Science and Technology Project of Zhenjiang City(No.SH20140110)Special Software Development Foundation of Zhenjiang City(No.201322)Science and Technology Support Foundation of Zhenjiang City(Industrial)(No.GY2014013).
文摘Most image segmentation methods based on clustering algorithms use singleobjective function to implement image segmentation.To avoid the defect,this paper proposes a new image segmentation method based on a multi-objective particle swarm optimization(PSO)clustering algorithm.This unsupervised algorithm not only offers a new similarity computing approach based on electromagnetic forces,but also obtains the proper number of clusters which is determined by scale-space theory.It is experimentally demonstrated that the applicability and effectiveness of the proposed multi-objective PSO clustering algorithm.
基金National Natural Science Foundations of China(No. 61103175,No. 11141005)Technology Innovation Platform Project of Fujian Province,China (No. 2009J1007)+1 种基金Key Project Development Foundation of Education Committee of Fujian Province,China (No.JA11011)Project Development Foundations of Fuzhou University,China (No. 2010-XQ-21,No. XRC-1037)
文摘Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
文摘An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
基金the Russian Foundation for Basic Research(RFBR)(No.20-07-00531).
文摘Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shorten the navigation time.Ac-cordingly,planning a multi-objective route for ships is an effective way to achieve these goals.In this paper,we propose a multi-ob-jective optimal ship weather routing system framework.Based on this framework,a ship route model,ship fuel consumption model,and navigation risk model are established,and a non-dominated sorting and multi-objective ship weather routing algorithm based on particle swarm optimization is proposed.To fasten the convergence of the algorithm and improve the diversity of route solutions,a mutation operation and an elite selection operation are introduced in the algorithm.Based on the Pareto optimal front and Pareto optimal solution set obtained by the algorithm,a recommended route selection criterion is designed.Finally,two sets of simulated navigation simulation experiments on a container ship are conducted.The experimental results show that the proposed multi-objective optimal weather routing system can be used to plan a ship route with low navigation risk,short navigation time,and low fuel consumption,fulfilling the safety,efficiency,and economic goals.
基金NSFC Innovation Team Project,China(NO.50721006)National Key Technologies R&D Program of China during the llth Five-Year Plan Period(NO.2008BAB29B08)
文摘An application of multi-objective particle swarm optimization （MOPSO） algorithm for optimization of the hydrological model （HYMOD） is presented in this paper. MOPSO algorithm is used to find non-dominated solutions with two objectives： high flow Nash-Sutcliffe efficiency and low flow Nash- Sutcliffe efficiency. The two sets＇ coverage rate and Pareto front spacing metric are two criterions to analyze the performance of the algorithms. MOPSO algorithm surpasses multi-objective shuffled complex evolution metcopolis （MOSCEM_UA） algorithr~, in terms of the two sets＇ coverage rate. But when we come to Pareto front spacing rate, the non-dominated solutions of MOSCEM_ UA algorithm are better-distributed than that of MOPSO algorithm when the iteration is set to 40 000. In addition, there are obvious conflicts between the two objectives. But a compromise solution can be acquired by adopting the MOPSO algorithm.
文摘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.
文摘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.
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
文摘The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.
文摘Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation shows that this new method makes the optimization perfectly and convergence quickly.
文摘Deep deterministic policy gradient(DDPG)has been proved to be effective in optimizing particle swarm optimization(PSO),but whether DDPG can optimize multi-objective discrete particle swarm optimization(MODPSO)remains to be determined.The present work aims to probe into this topic.Experiments showed that the DDPG can not only quickly improve the convergence speed of MODPSO,but also overcome the problem of local optimal solution that MODPSO may suffer.The research findings are of great significance for the theoretical research and application of MODPSO.
文摘Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.
