Analyzing big data, especially medical data, helps to provide good health care to patients and face the risks of death. The COVID-19 pandemic has had a significant impact on public health worldwide, emphasizing the ne...Analyzing big data, especially medical data, helps to provide good health care to patients and face the risks of death. The COVID-19 pandemic has had a significant impact on public health worldwide, emphasizing the need for effective risk prediction models. Machine learning (ML) techniques have shown promise in analyzing complex data patterns and predicting disease outcomes. The accuracy of these techniques is greatly affected by changing their parameters. Hyperparameter optimization plays a crucial role in improving model performance. In this work, the Particle Swarm Optimization (PSO) algorithm was used to effectively search the hyperparameter space and improve the predictive power of the machine learning models by identifying the optimal hyperparameters that can provide the highest accuracy. A dataset with a variety of clinical and epidemiological characteristics linked to COVID-19 cases was used in this study. Various machine learning models, including Random Forests, Decision Trees, Support Vector Machines, and Neural Networks, were utilized to capture the complex relationships present in the data. To evaluate the predictive performance of the models, the accuracy metric was employed. The experimental findings showed that the suggested method of estimating COVID-19 risk is effective. When compared to baseline models, the optimized machine learning models performed better and produced better results.展开更多
Retransmission avoidance is an essential need for any type of wireless communication.As retransmissions induce the unnecessary presence of redundant data in every accessible node.As storage capacity is symmetrical to ...Retransmission avoidance is an essential need for any type of wireless communication.As retransmissions induce the unnecessary presence of redundant data in every accessible node.As storage capacity is symmetrical to the size of the memory,less storage capacity is experienced due to the restricted size of the respective node.In this proposed work,we have discussed the integration of the Energy Proficient Reduced Coverage Set with Particle Swarm Optimization(PSO).PSO is a metaheuristic global search enhancement technique that promotes the searching of the best nodes in the search space.PSO is integrated with a Reduced Coverage Set,to obtain an optimal path with only high-power transmitting nodes.Energy Proficient Reduced Coverage Set with PSO constructs a set of only best nodes based on the fitness solution,to cover the whole network.The proposed algorithm has experimented with a different number of nodes.Comparison has been made between original and improved algorithm shows that improved algorithm performs better than the existing by reducing the redundant packet transmissions by 18%~40%,thereby increasing the network lifetime.展开更多
Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In th...Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.展开更多
The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the slid...The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.展开更多
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.展开更多
Image classification is a core field in the research area of image proces-sing and computer vision in which vehicle classification is a critical domain.The purpose of vehicle categorization is to formulate a compact s...Image classification is a core field in the research area of image proces-sing and computer vision in which vehicle classification is a critical domain.The purpose of vehicle categorization is to formulate a compact system to assist in real-world problems and applications such as security,traffic analysis,and self-driving and autonomous vehicles.The recent revolution in the field of machine learning and artificial intelligence has provided an immense amount of support for image processing related problems and has overtaken the conventional,and handcrafted means of solving image analysis problems.In this paper,a combina-tion of pre-trained CNN GoogleNet and a nature-inspired problem optimization scheme,particle swarm optimization(PSO),was employed for autonomous vehi-cle classification.The model was trained on a vehicle image dataset obtained from Kaggle that has been suitably augmented.The trained model was classified using several classifiers;however,the Cubic SVM(CSVM)classifier was found to out-perform the others in both time consumption and accuracy(94.8%).The results obtained from empirical evaluations and statistical tests reveal that the model itself has shown to outperform the other related models not only in terms of accu-racy(94.8%)but also in terms of training time(82.7 s)and speed prediction(380 obs/sec).展开更多
Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a ...Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a three-stage calibration method based on hybrid intelligent optimization is pro- posed for nonlinear camera models in this paper. The motivation is to improve the accuracy of the calibration process. In this approach, the stereo vision calibration is considered as an optimization problem that can be solved by the GA and PSO. The initial linear values can be obtained in the frost stage. Then in the second stage, two cameras' parameters are optimized separately. Finally, the in- tegrated optimized calibration of two models is obtained in the third stage. Direct linear transforma- tion (DLT), GA and PSO are individually used in three stages. It is shown that the results of every stage can correctly find near-optimal solution and it can be used to initialize the next stage. Simula- tion analysis and actual experimental results indicate that this calibration method works more accu- rate and robust in noisy environment compared with traditional calibration methods. The proposed method can fulfill the requirements of robot sophisticated visual operation.展开更多
To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordina...To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneously adjust two parameters of qubits, and can automatically achieve the best matching of two adjustments. The optimization process is employed in the n-dimensional space [-1, 1]n, so this approach fits to many optimization problems. The experimental results show that this algorithm is superior to the original quantum-behaved PSO.展开更多
A cooperative system of a fuzzy logic model and a fuzzy neural network(CSFLMFNN)is proposed,in which a fuzzy logic model is acquired from domain experts and a fuzzy neural network is generated and prewired according t...A cooperative system of a fuzzy logic model and a fuzzy neural network(CSFLMFNN)is proposed,in which a fuzzy logic model is acquired from domain experts and a fuzzy neural network is generated and prewired according to the model.Then PSO-CSFLMFNN is constructed by introducing particle swarm optimization(PSO)into the cooperative system instead of the commonly used evolutionary algorithms to evolve the prewired fuzzy neural network.The evolutionary fuzzy neural network implements accuracy fuzzy inference without rule matching.PSO-CSFLMFNN is applied to the intelligent fault diagnosis for a petrochemical engineering equipment,in which the cooperative system is proved to be effective.It is shown by the applied results that the performance of the evolutionary fuzzy neural network outperforms remarkably that of the one evolved by genetic algorithm in the convergence rate and the generalization precision.展开更多
The particle swarm optimization (PSO) algorithm is introduced to deal with some open anti-windup problems, i.e., determining the initial condition when applying the iterative algorithm to enlarge the estimate of the d...The particle swarm optimization (PSO) algorithm is introduced to deal with some open anti-windup problems, i.e., determining the initial condition when applying the iterative algorithm to enlarge the estimate of the domain of attraction, determining the design point in the delayed anti-windup scheme, and determining the design point and the weighting factors in the multi-stage anti-windup scheme. Therefore, the corresponding PSO-based algorithms are proposed. Unlike the traditional methods in which the free design parameters can only be selected by trial and error with the available computational results, the PSO-based algorithms provide a systematic way to determine these parameters. In addition, the algorithms are easy to be implemented and are very likely to find the desirable parameters that further improve the anti-windup closed-loop performances. Simulation results are presented to validate the effectiveness and advantages of the proposed method.展开更多
Accompanied by the advent of current big data ages,the scales of real world optimization problems with many decisive design variables are becoming much larger.Up to date,how to develop new optimization algorithms for ...Accompanied by the advent of current big data ages,the scales of real world optimization problems with many decisive design variables are becoming much larger.Up to date,how to develop new optimization algorithms for these large scale problems and how to expand the scalability of existing optimization algorithms have posed further challenges in the domain of bio-inspired computation.So addressing these complex large scale problems to produce truly useful results is one of the presently hottest topics.As a branch of the swarm intelligence based algorithms,particle swarm optimization (PSO) for coping with large scale problems and its expansively diverse applications have been in rapid development over the last decade years.This reviewpaper mainly presents its recent achievements and trends,and also highlights the existing unsolved challenging problems and key issues with a huge impact in order to encourage further more research in both large scale PSO theories and their applications in the forthcoming years.展开更多
Particle swarm optimization (PSO) is one of the most popular population-based stochastic algorithms for solving complex optimization problems. While PSO is simple and effective, it is originally defined in continuou...Particle swarm optimization (PSO) is one of the most popular population-based stochastic algorithms for solving complex optimization problems. While PSO is simple and effective, it is originally defined in continuous space. In order to take advantage of PSO to solve combinatorial optimization problems in discrete space, the set-based PSO (S-PSO) framework extends PSO for discrete optimization by redefining the operations in PSO utilizing the set operations. Since its proposal, S-PSO has attracted increasing research attention and has become a promising approach for discrete optimization problems. In this paper, we intend to provide a comprehensive survey on the concepts, development and applications of S-PSO. First, the classification of discrete PSO algorithms is presented. Then the S-PSO framework is given. In particular, we will give an insight into the solution construction strategies, constraint handling strategies, and alternative reinforcement strategies in S-PSO together with its different variants. Furthermore, the extensions and applications of S-PSO are also discussed systemically. Some potential directions for the research of S-PSO are also discussed in this paper.展开更多
Scour depth around bridge piers plays a vital role in the safety and stability of the bridges.The former approaches used in the prediction of scour depth are based on regression models or black box models in which the...Scour depth around bridge piers plays a vital role in the safety and stability of the bridges.The former approaches used in the prediction of scour depth are based on regression models or black box models in which the first one lacks enough accuracy while the later one does not provide a clear mathematical expression to easily employ it for other situations or cases.Therefore,this paper aims to develop new equations using particle swarm optimization as a metaheuristic approach to predict scour depth around bridge piers.To improve the efficiency of the proposed model,individual equations are derived for laboratory and field data.Moreover,sensitivity analysis is conducted to achieve the most effective parameters in the estimation of scour depth for both experimental and filed data sets.Comparing the results of the proposed model with those of existing regression-based equations reveal the superiority of the proposed method in terms of accuracy and uncertainty.Moreover,the ratio of pier width to flow depth and ratio of d50 (mean particle diameter)to flow depth for the laboratory and field data were recognized as the most effective parameters,respectively.The derived equations can be used as a suitable proxy to estimate scour depth in both experimental and prototype scales.展开更多
Travelers' route choice behavior, a dynamical learning process based on their own experience, traffic information, and influence of others, is a type of cooperation optimization and a constant day-to-day evolutionary...Travelers' route choice behavior, a dynamical learning process based on their own experience, traffic information, and influence of others, is a type of cooperation optimization and a constant day-to-day evolutionary process. Travelers adjust their route choices to choose the best route, minimizing travel time and distance, or maximizing expressway use. Because route choice behavior is based on human beings, the most intelligent animals in the world, this swarm behavior is expected to in- corporate more intelligence. Unlike existing research in route choice behavior, the influence of other travelers is considered for updating route choices on account of the reality, which makes the route choice behavior from individual to swarm. Anew swarm intelligence algorithm inspired by travelers' route choice behavior for solving mathematical optimization problems is introduced in this paper. A comparison of the results of experiments with those of the classical global Particle Swarm Optimization (PSO) algorithm demonstrates the efficacy of the Route Choice Behavior Algorithm (RCBA). The novel algorithm provides a new approach to solving complex problems and new avenues for the study of route choice behavior.展开更多
The issue of optimizing the dynamic parameters in Particle Swarm Optimizer (PSO) is addressed in this paper. An algorithm is designed which makes all particles originally endowed with a certain level energy, what here...The issue of optimizing the dynamic parameters in Particle Swarm Optimizer (PSO) is addressed in this paper. An algorithm is designed which makes all particles originally endowed with a certain level energy, what here we define as EPSO (Energy Strategy PSO). During the iterative process of PSO algorithm, the Inertia Weight is updated according to the calculation of the particle's energy. The portion ratio of the current residual energy to the initial endowed energy is used as the parameter Inertia Weight which aims to update the particles' velocity efficiently. By the simulation in a graph theoritical and a functional optimization problem respectively, it could be easily found that the rate of convergence in EPSO is obviously increased.展开更多
This paper proposes a new method to classify remote sensing data by using Particle Swarm Optimization (PSO). This method is to generate classification rules through simulating the behaviors of bird flocking. Optimized...This paper proposes a new method to classify remote sensing data by using Particle Swarm Optimization (PSO). This method is to generate classification rules through simulating the behaviors of bird flocking. Optimized intervals of each band are found by particles in multi-dimension space, linked with land use types for forming classification rules. Compared with other rule induction techniques (e.g. See5.0), PSO can efficiently find optimized cut points of each band, and have good convergence in the search process. This method has been applied to the classification of remote sensing data in Panyu district of Guangzhou with satisfactory results. It can produce higher accuracy in the classification than the See5.0 decision tree model.展开更多
The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was ...The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.展开更多
文摘Analyzing big data, especially medical data, helps to provide good health care to patients and face the risks of death. The COVID-19 pandemic has had a significant impact on public health worldwide, emphasizing the need for effective risk prediction models. Machine learning (ML) techniques have shown promise in analyzing complex data patterns and predicting disease outcomes. The accuracy of these techniques is greatly affected by changing their parameters. Hyperparameter optimization plays a crucial role in improving model performance. In this work, the Particle Swarm Optimization (PSO) algorithm was used to effectively search the hyperparameter space and improve the predictive power of the machine learning models by identifying the optimal hyperparameters that can provide the highest accuracy. A dataset with a variety of clinical and epidemiological characteristics linked to COVID-19 cases was used in this study. Various machine learning models, including Random Forests, Decision Trees, Support Vector Machines, and Neural Networks, were utilized to capture the complex relationships present in the data. To evaluate the predictive performance of the models, the accuracy metric was employed. The experimental findings showed that the suggested method of estimating COVID-19 risk is effective. When compared to baseline models, the optimized machine learning models performed better and produced better results.
文摘Retransmission avoidance is an essential need for any type of wireless communication.As retransmissions induce the unnecessary presence of redundant data in every accessible node.As storage capacity is symmetrical to the size of the memory,less storage capacity is experienced due to the restricted size of the respective node.In this proposed work,we have discussed the integration of the Energy Proficient Reduced Coverage Set with Particle Swarm Optimization(PSO).PSO is a metaheuristic global search enhancement technique that promotes the searching of the best nodes in the search space.PSO is integrated with a Reduced Coverage Set,to obtain an optimal path with only high-power transmitting nodes.Energy Proficient Reduced Coverage Set with PSO constructs a set of only best nodes based on the fitness solution,to cover the whole network.The proposed algorithm has experimented with a different number of nodes.Comparison has been made between original and improved algorithm shows that improved algorithm performs better than the existing by reducing the redundant packet transmissions by 18%~40%,thereby increasing the network lifetime.
基金supported in part by the National Natural Science Foundation of China(62073330)in part by the Natural Science Foundation of Hunan Province(2019JJ20021,2020JJ4339)in part by the Scientific Research Fund of Hunan Province Education Department(20B272)。
文摘Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.
文摘The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.
文摘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.
文摘Image classification is a core field in the research area of image proces-sing and computer vision in which vehicle classification is a critical domain.The purpose of vehicle categorization is to formulate a compact system to assist in real-world problems and applications such as security,traffic analysis,and self-driving and autonomous vehicles.The recent revolution in the field of machine learning and artificial intelligence has provided an immense amount of support for image processing related problems and has overtaken the conventional,and handcrafted means of solving image analysis problems.In this paper,a combina-tion of pre-trained CNN GoogleNet and a nature-inspired problem optimization scheme,particle swarm optimization(PSO),was employed for autonomous vehi-cle classification.The model was trained on a vehicle image dataset obtained from Kaggle that has been suitably augmented.The trained model was classified using several classifiers;however,the Cubic SVM(CSVM)classifier was found to out-perform the others in both time consumption and accuracy(94.8%).The results obtained from empirical evaluations and statistical tests reveal that the model itself has shown to outperform the other related models not only in terms of accu-racy(94.8%)but also in terms of training time(82.7 s)and speed prediction(380 obs/sec).
基金supported by the 973 Program(Grant No 2007CB209600)Open Fund(No.GDL0706) of the Key Laboratory of Geo-detection(China University of Geosciences,Beijing),Ministry of Education
文摘Accurate stereo vision calibration is a preliminary step towards high-precision visual posi- tioning of robot. Combining with the characteristics of genetic algorithm (GA) and particle swarm optimization (PSO), a three-stage calibration method based on hybrid intelligent optimization is pro- posed for nonlinear camera models in this paper. The motivation is to improve the accuracy of the calibration process. In this approach, the stereo vision calibration is considered as an optimization problem that can be solved by the GA and PSO. The initial linear values can be obtained in the frost stage. Then in the second stage, two cameras' parameters are optimized separately. Finally, the in- tegrated optimized calibration of two models is obtained in the third stage. Direct linear transforma- tion (DLT), GA and PSO are individually used in three stages. It is shown that the results of every stage can correctly find near-optimal solution and it can be used to initialize the next stage. Simula- tion analysis and actual experimental results indicate that this calibration method works more accu- rate and robust in noisy environment compared with traditional calibration methods. The proposed method can fulfill the requirements of robot sophisticated visual operation.
文摘To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneously adjust two parameters of qubits, and can automatically achieve the best matching of two adjustments. The optimization process is employed in the n-dimensional space [-1, 1]n, so this approach fits to many optimization problems. The experimental results show that this algorithm is superior to the original quantum-behaved PSO.
基金Sponsored by the Natural Science Foundation of Guangdong Province of China(Grant No.06029281 and 05011905).
文摘A cooperative system of a fuzzy logic model and a fuzzy neural network(CSFLMFNN)is proposed,in which a fuzzy logic model is acquired from domain experts and a fuzzy neural network is generated and prewired according to the model.Then PSO-CSFLMFNN is constructed by introducing particle swarm optimization(PSO)into the cooperative system instead of the commonly used evolutionary algorithms to evolve the prewired fuzzy neural network.The evolutionary fuzzy neural network implements accuracy fuzzy inference without rule matching.PSO-CSFLMFNN is applied to the intelligent fault diagnosis for a petrochemical engineering equipment,in which the cooperative system is proved to be effective.It is shown by the applied results that the performance of the evolutionary fuzzy neural network outperforms remarkably that of the one evolved by genetic algorithm in the convergence rate and the generalization precision.
文摘The particle swarm optimization (PSO) algorithm is introduced to deal with some open anti-windup problems, i.e., determining the initial condition when applying the iterative algorithm to enlarge the estimate of the domain of attraction, determining the design point in the delayed anti-windup scheme, and determining the design point and the weighting factors in the multi-stage anti-windup scheme. Therefore, the corresponding PSO-based algorithms are proposed. Unlike the traditional methods in which the free design parameters can only be selected by trial and error with the available computational results, the PSO-based algorithms provide a systematic way to determine these parameters. In addition, the algorithms are easy to be implemented and are very likely to find the desirable parameters that further improve the anti-windup closed-loop performances. Simulation results are presented to validate the effectiveness and advantages of the proposed method.
文摘Accompanied by the advent of current big data ages,the scales of real world optimization problems with many decisive design variables are becoming much larger.Up to date,how to develop new optimization algorithms for these large scale problems and how to expand the scalability of existing optimization algorithms have posed further challenges in the domain of bio-inspired computation.So addressing these complex large scale problems to produce truly useful results is one of the presently hottest topics.As a branch of the swarm intelligence based algorithms,particle swarm optimization (PSO) for coping with large scale problems and its expansively diverse applications have been in rapid development over the last decade years.This reviewpaper mainly presents its recent achievements and trends,and also highlights the existing unsolved challenging problems and key issues with a huge impact in order to encourage further more research in both large scale PSO theories and their applications in the forthcoming years.
基金Acknowledgements This work was supported in part by the National Natural Science Foundation of China (Grant Nos. 61622206 and 61379061), in part by the Natural Science Foundation of Guangdong (2015A030306024), in part by the Guangdong Special Support Program (2014TQ01X550), and in part by the Guangzhou Pearl River New Star of Science and Technology (201506010002).
文摘Particle swarm optimization (PSO) is one of the most popular population-based stochastic algorithms for solving complex optimization problems. While PSO is simple and effective, it is originally defined in continuous space. In order to take advantage of PSO to solve combinatorial optimization problems in discrete space, the set-based PSO (S-PSO) framework extends PSO for discrete optimization by redefining the operations in PSO utilizing the set operations. Since its proposal, S-PSO has attracted increasing research attention and has become a promising approach for discrete optimization problems. In this paper, we intend to provide a comprehensive survey on the concepts, development and applications of S-PSO. First, the classification of discrete PSO algorithms is presented. Then the S-PSO framework is given. In particular, we will give an insight into the solution construction strategies, constraint handling strategies, and alternative reinforcement strategies in S-PSO together with its different variants. Furthermore, the extensions and applications of S-PSO are also discussed systemically. Some potential directions for the research of S-PSO are also discussed in this paper.
基金This research was supported by the Hungarian State and the European Union under the EFOP-3.6.1-16-2016-00010 project and the 2017-1.3.1-VKE-2017-00025 project.
文摘Scour depth around bridge piers plays a vital role in the safety and stability of the bridges.The former approaches used in the prediction of scour depth are based on regression models or black box models in which the first one lacks enough accuracy while the later one does not provide a clear mathematical expression to easily employ it for other situations or cases.Therefore,this paper aims to develop new equations using particle swarm optimization as a metaheuristic approach to predict scour depth around bridge piers.To improve the efficiency of the proposed model,individual equations are derived for laboratory and field data.Moreover,sensitivity analysis is conducted to achieve the most effective parameters in the estimation of scour depth for both experimental and filed data sets.Comparing the results of the proposed model with those of existing regression-based equations reveal the superiority of the proposed method in terms of accuracy and uncertainty.Moreover,the ratio of pier width to flow depth and ratio of d50 (mean particle diameter)to flow depth for the laboratory and field data were recognized as the most effective parameters,respectively.The derived equations can be used as a suitable proxy to estimate scour depth in both experimental and prototype scales.
基金the National Natural Science Foundation of China (Grant Nos. U1564212, 61672082 and 61572229).
文摘Travelers' route choice behavior, a dynamical learning process based on their own experience, traffic information, and influence of others, is a type of cooperation optimization and a constant day-to-day evolutionary process. Travelers adjust their route choices to choose the best route, minimizing travel time and distance, or maximizing expressway use. Because route choice behavior is based on human beings, the most intelligent animals in the world, this swarm behavior is expected to in- corporate more intelligence. Unlike existing research in route choice behavior, the influence of other travelers is considered for updating route choices on account of the reality, which makes the route choice behavior from individual to swarm. Anew swarm intelligence algorithm inspired by travelers' route choice behavior for solving mathematical optimization problems is introduced in this paper. A comparison of the results of experiments with those of the classical global Particle Swarm Optimization (PSO) algorithm demonstrates the efficacy of the Route Choice Behavior Algorithm (RCBA). The novel algorithm provides a new approach to solving complex problems and new avenues for the study of route choice behavior.
基金National Natural Science Foundation of China (No.50408034)
文摘The issue of optimizing the dynamic parameters in Particle Swarm Optimizer (PSO) is addressed in this paper. An algorithm is designed which makes all particles originally endowed with a certain level energy, what here we define as EPSO (Energy Strategy PSO). During the iterative process of PSO algorithm, the Inertia Weight is updated according to the calculation of the particle's energy. The portion ratio of the current residual energy to the initial endowed energy is used as the parameter Inertia Weight which aims to update the particles' velocity efficiently. By the simulation in a graph theoritical and a functional optimization problem respectively, it could be easily found that the rate of convergence in EPSO is obviously increased.
基金the National Outstanding Youth Foundation of China (Grant No. 40525002)the National Natural Science Foundation of China (Grant No. 40471105)the Hi-tech Research and Development Program of China (863 Program) (Grant No. 2006AA12Z206).
文摘This paper proposes a new method to classify remote sensing data by using Particle Swarm Optimization (PSO). This method is to generate classification rules through simulating the behaviors of bird flocking. Optimized intervals of each band are found by particles in multi-dimension space, linked with land use types for forming classification rules. Compared with other rule induction techniques (e.g. See5.0), PSO can efficiently find optimized cut points of each band, and have good convergence in the search process. This method has been applied to the classification of remote sensing data in Panyu district of Guangzhou with satisfactory results. It can produce higher accuracy in the classification than the See5.0 decision tree model.
基金National Natural Science Foundation of China(No.70971020)the Subject of Ministry of Education of Hunan Province,China(No.13C818)+3 种基金the Project of Industrial Science and Technology Support of Hengyang City,Hunan Province,China(No.2013KG63)the Open Project Program of Artificial Intelligence Key Laboratory of Sichuan Province,Sichuan University of Science and Engineering,China(No.2012RYJ03)the Fund Project of Humanities and Social Sciences,Ministry of Education of China(No.13YJCZH147)the Special Fund for Shanghai Colleges' Outstanding Young Teachers' Scientific Research Projects,China(No.ZZGJD12033)
文摘The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.