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.展开更多
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.展开更多
Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific...Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.展开更多
Orthomorphism on F2^n is a kind of elementary pemmtation with good cryptographic properties. This paper proposes a hybrid strategy of Particle Swarm Optimization （PSO） and Sirrmlated Annealing （SA） for finding ort...Orthomorphism on F2^n is a kind of elementary pemmtation with good cryptographic properties. This paper proposes a hybrid strategy of Particle Swarm Optimization （PSO） and Sirrmlated Annealing （SA） for finding orthomorphisrm with good cryptographic properties. By experiment based on this strategy, we get some orthorrorphisrm on F2^n = 5, 6, 7, 9, 10） with good cryptographic properties in the open document for the first time, and the optirml orthorrrphism on F found in this paper also does better than the one proposed by Feng Dengguo et al. in stream cipher Loiss in difference uniformity, algebraic degree, algebraic irrarnity and corresponding pernmtation polynomial degree. The PSOSA hybrid strategy for optimizing orthomerphism in this paper makes design of orthorrorphisrm with good cryptographic properties automated, efficient and convenient, which proposes a new approach to design orthornorphisrm.展开更多
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.展开更多
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.展开更多
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.展开更多
In order to widen the high-efficiency operating range of a low-specific-speed centrifugal pump, an optimization process for considering efficiencies under 1.0Qd and 1.4Qd is proposed. Three parameters, namely, the bla...In order to widen the high-efficiency operating range of a low-specific-speed centrifugal pump, an optimization process for considering efficiencies under 1.0Qd and 1.4Qd is proposed. Three parameters, namely, the blade outlet width b2, blade outlet angle β2, and blade wrap angle φ, are selected as design variables. Impellers are generated using the optimal Latin hypercube sampling method. The pump efficiencies are calculated using the software CFX 14.5 at two operating points selected as objectives. Surrogate models are also constructed to analyze the relationship between the objectives and the design variables. Finally, the particle swarm optimization algorithm is applied to calculate the surrogate model to determine the best combination of the impeller parameters. The results show that the performance curve predicted by numerical simulation has a good agreement with the experimental results. Compared with the efficiencies of the original impeller, the hydraulic efficiencies of the optimized impeller are increased by 4.18% and 0.62% under 1.0Qd and 1.4Qd, respectively. The comparison of inner flow between the original pump and optimized one illustrates the improvement of performance. The optimization process can provide a useful reference on performance improvement of other pumps, even on reduction of pressure fluctuations.展开更多
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.展开更多
基金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.
基金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 Key R&D Plan of China (2021YFE0105000)the National Natural Science Foundation of China (52074213)+1 种基金Shaanxi Key R&D Plan Project (2021SF-472)Yulin Science and Technology Plan Project (CXY-2020-036)。
文摘Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.
基金supported by the National Natural Science Foundation of China under Grants No.60673071,No.60970115,No.60970116,No.61003267partially supported by the National Hi-Tech Research and Department Program of China under Grants No.2006AA01Z442,No.2007AA01Z411
文摘Orthomorphism on F2^n is a kind of elementary pemmtation with good cryptographic properties. This paper proposes a hybrid strategy of Particle Swarm Optimization （PSO） and Sirrmlated Annealing （SA） for finding orthomorphisrm with good cryptographic properties. By experiment based on this strategy, we get some orthorrorphisrm on F2^n = 5, 6, 7, 9, 10） with good cryptographic properties in the open document for the first time, and the optirml orthorrrphism on F found in this paper also does better than the one proposed by Feng Dengguo et al. in stream cipher Loiss in difference uniformity, algebraic degree, algebraic irrarnity and corresponding pernmtation polynomial degree. The PSOSA hybrid strategy for optimizing orthomerphism in this paper makes design of orthorrorphisrm with good cryptographic properties automated, efficient and convenient, which proposes a new approach to design orthornorphisrm.
基金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.
基金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.
基金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.
基金Supported by Jiangsu Provincical Natural Science Foundation of China(Grant No.BK20140554)National Natural Science Foundation of China(Grant No.51409123)+2 种基金China Postdoctoral Science Foundation(Grant No.2015T80507)Innovation Project for Postgraduates of Jiangsu Province,China(Grant No.KYLX15_1066)the Priority Academic Program Development of Jiangsu Higher Education Institutions,China(PAPD)
文摘In order to widen the high-efficiency operating range of a low-specific-speed centrifugal pump, an optimization process for considering efficiencies under 1.0Qd and 1.4Qd is proposed. Three parameters, namely, the blade outlet width b2, blade outlet angle β2, and blade wrap angle φ, are selected as design variables. Impellers are generated using the optimal Latin hypercube sampling method. The pump efficiencies are calculated using the software CFX 14.5 at two operating points selected as objectives. Surrogate models are also constructed to analyze the relationship between the objectives and the design variables. Finally, the particle swarm optimization algorithm is applied to calculate the surrogate model to determine the best combination of the impeller parameters. The results show that the performance curve predicted by numerical simulation has a good agreement with the experimental results. Compared with the efficiencies of the original impeller, the hydraulic efficiencies of the optimized impeller are increased by 4.18% and 0.62% under 1.0Qd and 1.4Qd, respectively. The comparison of inner flow between the original pump and optimized one illustrates the improvement of performance. The optimization process can provide a useful reference on performance improvement of other pumps, even on reduction of pressure fluctuations.
文摘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.
