In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on pa...In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.展开更多
Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature...Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature industry processes.The synthesis of a CRS with simultaneous consideration of heat integration between refrigerant and process streams is challenging but promising for significant cost saving and reduction of carbon emission.This study presented a stochastic optimization method for the synthesis of CRS.An MINLP model was formulated based on the superstructure developed for the CRS,and an optimization framework was proposed,where simulated annealing algorithm was used to evolve the numbers of pressure/temperature levels for all sub-refrigeration systems,and particle swarm optimization algorithm was employed to optimize the continuous variables.The effectiveness of the proposed methodology was verified by a case study of CRS optimization in an ethylene plant with 21.89%the total annual cost saving.展开更多
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.展开更多
As the number of electric vehicles(EVs)continues to grow and the demand for charging infrastructure is also increasing,how to improve the charging infrastructure has become a bottleneck restricting the development of ...As the number of electric vehicles(EVs)continues to grow and the demand for charging infrastructure is also increasing,how to improve the charging infrastructure has become a bottleneck restricting the development of EVs.In other words,reasonably planning the location and capacity of charging stations is important for development of the EV industry and the safe and stable operation of the power system.Considering the construction and maintenance of the charging station,the distribution network loss of the charging station,and the economic loss on the user side of the EV,this paper takes the node and capacity of charging station planning as control variables and the minimum cost of system comprehensive planning as objective function,and thus proposes a location and capacity planning model for the EV charging station.Based on the problems of low efficiency and insufficient global optimization ability of the current algorithm,the simulated annealing immune particle swarm optimization algorithm(SA-IPSO)is adopted in this paper.The simulated annealing algorithm is used in the global update of the particle swarm optimization(PSO),and the immune mechanism is introduced to participate in the iterative update of the particles,so as to improve the speed and efficiency of PSO.Voronoi diagram is used to divide service area of the charging station,and a joint solution process of Voronoi diagram and SA-IPSO is proposed.By example analysis,the results show that the optimal solution corresponding to the optimisation method proposed in this paper has a low overall cost,while the average charging waiting time is only 1.8 min and the charging pile utilisation rate is 75.5%.The simulation comparison verifies that the improved algorithm improves the operational efficiency by 18.1%and basically does not fall into local convergence.展开更多
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.展开更多
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.展开更多
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.展开更多
Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational comp...Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid ap- proximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimiza- tion (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.展开更多
An economic dispatch problem for power system with wind power is discussed.Using discrete scenario to describe uncertain wind powers,a threshold is given to identify bad scenario set.The bad-scenario-set robust econom...An economic dispatch problem for power system with wind power is discussed.Using discrete scenario to describe uncertain wind powers,a threshold is given to identify bad scenario set.The bad-scenario-set robust economic dispatch model is established to minimize the total penalties on bad scenarios.A specialized hybrid particle swarm optimization(PSO)algorithm is developed through hybridizing simulated annealing(SA)operators.The SA operators are performed according to a scenario-oriented adaptive search rule in a neighborhood which is constructed based on the unit commitment constraints.Finally,an experiment is conducted.The computational results show that the developed algorithm outperforms the existing algorithms.展开更多
To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbioti...To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.展开更多
A new heuristic algorithm is proposed for the problem of finding the minimummakespan in the job-shop scheduling problem. The new algorithm is based on the principles ofparticle swarm optimization (PSO). PSO employs a ...A new heuristic algorithm is proposed for the problem of finding the minimummakespan in the job-shop scheduling problem. The new algorithm is based on the principles ofparticle swarm optimization (PSO). PSO employs a collaborative population-based search, which isinspired by the social behavior of bird flocking. It combines local search (by self experience) andglobal search (by neighboring experience), possessing high search efficiency. Simulated annealing(SA) employs certain probability to avoid becoming trapped in a local optimum and the search processcan be controlled by the cooling schedule. By reasonably combining these two different searchalgorithms, a general, fast and easily implemented hybrid optimization algorithm, named HPSO, isdeveloped. The effectiveness and efficiency of the proposed PSO-based algorithm are demonstrated byapplying it to some benchmark job-shop scheduling problems and comparing results with otheralgorithms in literature. Comparing results indicate that PSO-based algorithm is a viable andeffective approach for the job-shop scheduling problem.展开更多
A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, ...A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, the global searching capacity of the particle swarm optimization（SAPSO） was enchanced, and the searching capacity of the particle swarm optimization was studied. Then, the improyed particle swarm optimization algorithm was used to optimize the parameters of SVM （c,σ and ε）. Based on the operational data provided by a regional power grid in north China, the method was used in the actual short term load forecasting. The results show that compared to the PSO-SVM and the traditional SVM, the average time of the proposed method in the experimental process reduces by 11.6 s and 31.1 s, and the precision of the proposed method increases by 1.24% and 3.18%, respectively. So, the improved method is better than the PSO-SVM and the traditional SVM.展开更多
Due to the dependence of the chemical and physical properties of the bimetallic nanoparticles（NPs） on their structures,a fundamental understanding of their structural characteristics is crucial for their syntheses a...Due to the dependence of the chemical and physical properties of the bimetallic nanoparticles（NPs） on their structures,a fundamental understanding of their structural characteristics is crucial for their syntheses and wide applications. In this article, a systematical atomic-level investigation of Au–Pd bimetallic NPs is conducted by using the improved particle swarm optimization（IPSO） with quantum correction Sutton–Chen potentials（Q-SC） at different Au/Pd ratios and different sizes. In the IPSO, the simulated annealing is introduced into the classical particle swarm optimization（PSO） to improve the effectiveness and reliability. In addition, the influences of initial structure, particle size and composition on structural stability and structural features are also studied. The simulation results reveal that the initial structures have little effects on the stable structures, but influence the converging rate greatly, and the convergence rate of the mixing initial structure is clearly faster than those of the core-shell and phase structures. We find that the Au–Pd NPs prefer the structures with Au-rich in the outer layers while Pd-rich in the inner ones. Especially, when the Au/Pd ratio is 6：4, the structure of the nanoparticle（NP） presents a standardized Pd（core） Au（shell） structure.展开更多
The advantage of fuzzy controllers in working with inaccurate and nonlinear inputs is that there is no need for an accurate mathematical model and fast convergence and minimal fluctuations in the maximum power point d...The advantage of fuzzy controllers in working with inaccurate and nonlinear inputs is that there is no need for an accurate mathematical model and fast convergence and minimal fluctuations in the maximum power point detector.The capability of online fuzzy tracking systems is maximum power,resistance to radiation and temperature changes,and no need for external sensors to measure radiation intensity and temperature.However,the most important issue is the constant changes in the amount of sunlight that cause the maximum power point to be constantly changing.The controller used in the maximum power point tracking(MPPT)circuit must be able to adapt to the new radiation conditions.Therefore,in this paper,to more accurately track the maximumpower point of the solar system and receive more electrical power at its output,an adaptive fuzzy control was proposed,the parameters of which are optimized by the whale algorithm.The studies have repeated under different irradiation conditions and the proposed controller performance has been compared with perturb and observe algorithm(P&O)method,which is a practical and high-performance method.To evaluate the performance of the proposed algorithm,the particle swarm algorithm optimized the adaptive fuzzy controller.The simulation results show that the adaptive fuzzy control system performs better than the P&O tracking system.Higher accuracy and consequently more production power at the output of the solar panel is one of the salient features of the proposed control method,which distinguishes it from other methods.On the other hand,the adaptive fuzzy controller optimized by the whale algorithm has been able to perform relatively better than the controller designed by the particle swarm algorithm,which confirms the higher accuracy of the proposed algorithm.展开更多
The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper prop...The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.展开更多
The design of an antenna requires a careful selection of its parameters to retain the desired performance.However,this task is time-consuming when the traditional approaches are employed,which represents a significant...The design of an antenna requires a careful selection of its parameters to retain the desired performance.However,this task is time-consuming when the traditional approaches are employed,which represents a significant challenge.On the other hand,machine learning presents an effective solution to this challenge through a set of regression models that can robustly assist antenna designers to find out the best set of design parameters to achieve the intended performance.In this paper,we propose a novel approach for accurately predicting the bandwidth of metamaterial antenna.The proposed approach is based on employing the recently emerged guided whale optimization algorithm using adaptive particle swarm optimization to optimize the parameters of the long-short-term memory(LSTM)deep network.This optimized network is used to retrieve the metamaterial bandwidth given a set of features.In addition,the superiority of the proposed approach is examined in terms of a comparison with the traditional multilayer perceptron(ML),Knearest neighbors(K-NN),and the basic LSTM in terms of several evaluation criteria such as root mean square error(RMSE),mean absolute error(MAE),and mean bias error(MBE).Experimental results show that the proposed approach could achieve RMSE of(0.003018),MAE of(0.001871),and MBE of(0.000205).These values are better than those of the other competing models.展开更多
With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization p...With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.展开更多
Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects o...Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects of metaheuristic algorithm-based groundwater model parameter inversion.Initially,the simulation-optimization parameter estimation framework is introduced,which involves the integration of simulation models with metaheuristic algorithms.The subsequent sections explore the fundamental principles of four widely employed metaheuristic algorithms-genetic algorithm(GA),particle swarm optimization(PSO),simulated annealing(SA),and differential evolution(DE)-highlighting their recent applications in water resources research and related areas.Then,a solute transport model is designed to illustrate how to apply and evaluate these four optimization algorithms in addressing challenges related to model parameter inversion.Finally,three noteworthy directions are presented to address the common challenges among current studies,including balancing the diverse exploration and centralized exploitation within metaheuristic algorithms,local approxi-mate error of the surrogate model,and the curse of dimensionality in spatial variational heterogeneous pa-rameters.In summary,this review paper provides theoretical insights and practical guidance for further advancements in groundwater inverse modeling studies.展开更多
基金The National Natural Science Foundation of China(No.61741102,61471164,61601122)the Fundamental Research Funds for the Central Universities(No.SJLX_160040)
文摘In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all devices.PSO-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.
基金supported by the National Natural Science Foundation of China(21978203)the Natural Science Foundation of Tianjin City(19JCYBJC20300)。
文摘Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature industry processes.The synthesis of a CRS with simultaneous consideration of heat integration between refrigerant and process streams is challenging but promising for significant cost saving and reduction of carbon emission.This study presented a stochastic optimization method for the synthesis of CRS.An MINLP model was formulated based on the superstructure developed for the CRS,and an optimization framework was proposed,where simulated annealing algorithm was used to evolve the numbers of pressure/temperature levels for all sub-refrigeration systems,and particle swarm optimization algorithm was employed to optimize the continuous variables.The effectiveness of the proposed methodology was verified by a case study of CRS optimization in an ethylene plant with 21.89%the total annual cost saving.
基金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.
基金Key R&D Program of Tianjin,China(No.20YFYSGX00060).
文摘As the number of electric vehicles(EVs)continues to grow and the demand for charging infrastructure is also increasing,how to improve the charging infrastructure has become a bottleneck restricting the development of EVs.In other words,reasonably planning the location and capacity of charging stations is important for development of the EV industry and the safe and stable operation of the power system.Considering the construction and maintenance of the charging station,the distribution network loss of the charging station,and the economic loss on the user side of the EV,this paper takes the node and capacity of charging station planning as control variables and the minimum cost of system comprehensive planning as objective function,and thus proposes a location and capacity planning model for the EV charging station.Based on the problems of low efficiency and insufficient global optimization ability of the current algorithm,the simulated annealing immune particle swarm optimization algorithm(SA-IPSO)is adopted in this paper.The simulated annealing algorithm is used in the global update of the particle swarm optimization(PSO),and the immune mechanism is introduced to participate in the iterative update of the particles,so as to improve the speed and efficiency of PSO.Voronoi diagram is used to divide service area of the charging station,and a joint solution process of Voronoi diagram and SA-IPSO is proposed.By example analysis,the results show that the optimal solution corresponding to the optimisation method proposed in this paper has a low overall cost,while the average charging waiting time is only 1.8 min and the charging pile utilisation rate is 75.5%.The simulation comparison verifies that the improved algorithm improves the operational efficiency by 18.1%and basically does not fall into local convergence.
文摘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.
文摘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.
文摘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.
基金Project (No. 60174009) supported by the National Natural ScienceFoundation of China
文摘Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid ap- proximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimiza- tion (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.
基金supported by the National Natural Science Foundation of China(62173219,62073210).
文摘An economic dispatch problem for power system with wind power is discussed.Using discrete scenario to describe uncertain wind powers,a threshold is given to identify bad scenario set.The bad-scenario-set robust economic dispatch model is established to minimize the total penalties on bad scenarios.A specialized hybrid particle swarm optimization(PSO)algorithm is developed through hybridizing simulated annealing(SA)operators.The SA operators are performed according to a scenario-oriented adaptive search rule in a neighborhood which is constructed based on the unit commitment constraints.Finally,an experiment is conducted.The computational results show that the developed algorithm outperforms the existing algorithms.
基金National Key Basic Research Project of China(973 program)(No.2013CB733600)National Natural Science Foundation of China(No.21176073)+1 种基金Program for New Century Excellent Talents in University,China(No.NCET-09-0346)the Fundamental Research Funds for the Central Universities,China
文摘To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.
基金This project is supported by National Natural Science Foundation of China (No.70071017).
文摘A new heuristic algorithm is proposed for the problem of finding the minimummakespan in the job-shop scheduling problem. The new algorithm is based on the principles ofparticle swarm optimization (PSO). PSO employs a collaborative population-based search, which isinspired by the social behavior of bird flocking. It combines local search (by self experience) andglobal search (by neighboring experience), possessing high search efficiency. Simulated annealing(SA) employs certain probability to avoid becoming trapped in a local optimum and the search processcan be controlled by the cooling schedule. By reasonably combining these two different searchalgorithms, a general, fast and easily implemented hybrid optimization algorithm, named HPSO, isdeveloped. The effectiveness and efficiency of the proposed PSO-based algorithm are demonstrated byapplying it to some benchmark job-shop scheduling problems and comparing results with otheralgorithms in literature. Comparing results indicate that PSO-based algorithm is a viable andeffective approach for the job-shop scheduling problem.
基金Project(50579101) supported by the National Natural Science Foundation of China
文摘A new support vector machine （SVM） optimized by an improved particle swarm optimization （PSO） combined with simulated annealing algorithm （SA） was proposed. By incorporating with the simulated annealing method, the global searching capacity of the particle swarm optimization（SAPSO） was enchanced, and the searching capacity of the particle swarm optimization was studied. Then, the improyed particle swarm optimization algorithm was used to optimize the parameters of SVM （c,σ and ε）. Based on the operational data provided by a regional power grid in north China, the method was used in the actual short term load forecasting. The results show that compared to the PSO-SVM and the traditional SVM, the average time of the proposed method in the experimental process reduces by 11.6 s and 31.1 s, and the precision of the proposed method increases by 1.24% and 3.18%, respectively. So, the improved method is better than the PSO-SVM and the traditional SVM.
基金supported by the National Natural Science Foundation of China(Grant Nos.11474234 and 61403318)the Fundamental Research Funds for the Central Universities of China(Grant No.20720160085)
文摘Due to the dependence of the chemical and physical properties of the bimetallic nanoparticles（NPs） on their structures,a fundamental understanding of their structural characteristics is crucial for their syntheses and wide applications. In this article, a systematical atomic-level investigation of Au–Pd bimetallic NPs is conducted by using the improved particle swarm optimization（IPSO） with quantum correction Sutton–Chen potentials（Q-SC） at different Au/Pd ratios and different sizes. In the IPSO, the simulated annealing is introduced into the classical particle swarm optimization（PSO） to improve the effectiveness and reliability. In addition, the influences of initial structure, particle size and composition on structural stability and structural features are also studied. The simulation results reveal that the initial structures have little effects on the stable structures, but influence the converging rate greatly, and the convergence rate of the mixing initial structure is clearly faster than those of the core-shell and phase structures. We find that the Au–Pd NPs prefer the structures with Au-rich in the outer layers while Pd-rich in the inner ones. Especially, when the Au/Pd ratio is 6：4, the structure of the nanoparticle（NP） presents a standardized Pd（core） Au（shell） structure.
文摘The advantage of fuzzy controllers in working with inaccurate and nonlinear inputs is that there is no need for an accurate mathematical model and fast convergence and minimal fluctuations in the maximum power point detector.The capability of online fuzzy tracking systems is maximum power,resistance to radiation and temperature changes,and no need for external sensors to measure radiation intensity and temperature.However,the most important issue is the constant changes in the amount of sunlight that cause the maximum power point to be constantly changing.The controller used in the maximum power point tracking(MPPT)circuit must be able to adapt to the new radiation conditions.Therefore,in this paper,to more accurately track the maximumpower point of the solar system and receive more electrical power at its output,an adaptive fuzzy control was proposed,the parameters of which are optimized by the whale algorithm.The studies have repeated under different irradiation conditions and the proposed controller performance has been compared with perturb and observe algorithm(P&O)method,which is a practical and high-performance method.To evaluate the performance of the proposed algorithm,the particle swarm algorithm optimized the adaptive fuzzy controller.The simulation results show that the adaptive fuzzy control system performs better than the P&O tracking system.Higher accuracy and consequently more production power at the output of the solar panel is one of the salient features of the proposed control method,which distinguishes it from other methods.On the other hand,the adaptive fuzzy controller optimized by the whale algorithm has been able to perform relatively better than the controller designed by the particle swarm algorithm,which confirms the higher accuracy of the proposed algorithm.
文摘The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.
文摘The design of an antenna requires a careful selection of its parameters to retain the desired performance.However,this task is time-consuming when the traditional approaches are employed,which represents a significant challenge.On the other hand,machine learning presents an effective solution to this challenge through a set of regression models that can robustly assist antenna designers to find out the best set of design parameters to achieve the intended performance.In this paper,we propose a novel approach for accurately predicting the bandwidth of metamaterial antenna.The proposed approach is based on employing the recently emerged guided whale optimization algorithm using adaptive particle swarm optimization to optimize the parameters of the long-short-term memory(LSTM)deep network.This optimized network is used to retrieve the metamaterial bandwidth given a set of features.In addition,the superiority of the proposed approach is examined in terms of a comparison with the traditional multilayer perceptron(ML),Knearest neighbors(K-NN),and the basic LSTM in terms of several evaluation criteria such as root mean square error(RMSE),mean absolute error(MAE),and mean bias error(MBE).Experimental results show that the proposed approach could achieve RMSE of(0.003018),MAE of(0.001871),and MBE of(0.000205).These values are better than those of the other competing models.
基金This research is supported by the Science and Technology Program of Gansu Province(No.23JRRA880).
文摘With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.
基金supported by the Fundamental Research Funds for the Central Universities(XJ2023005201)the National Natural Science Foundation of China(NSFC:U2267217,42141011,and 42002254).
文摘Groundwater inverse modeling is a vital technique for estimating unmeasurable model parameters and enhancing numerical simulation accuracy.This paper comprehensively reviews the current advances and future prospects of metaheuristic algorithm-based groundwater model parameter inversion.Initially,the simulation-optimization parameter estimation framework is introduced,which involves the integration of simulation models with metaheuristic algorithms.The subsequent sections explore the fundamental principles of four widely employed metaheuristic algorithms-genetic algorithm(GA),particle swarm optimization(PSO),simulated annealing(SA),and differential evolution(DE)-highlighting their recent applications in water resources research and related areas.Then,a solute transport model is designed to illustrate how to apply and evaluate these four optimization algorithms in addressing challenges related to model parameter inversion.Finally,three noteworthy directions are presented to address the common challenges among current studies,including balancing the diverse exploration and centralized exploitation within metaheuristic algorithms,local approxi-mate error of the surrogate model,and the curse of dimensionality in spatial variational heterogeneous pa-rameters.In summary,this review paper provides theoretical insights and practical guidance for further advancements in groundwater inverse modeling studies.
