How can the environmental impact be minimized to achieve the sustainable development of the power system? The multi-regional environmental and economic dispatching of power systems has become a focus of attention. In this study, a method based on particle swarm algorithm is used to solve the problem of multi-regional environmental and economic scheduling of power systems. The particle swarm algorithm continuously adjusts the position and speed of the particles by simulating the collaboration and information exchange between individuals in the bird swarm to optimize the scheduling scheme of the generator set. In the optimization process, many factors such as economy, environmental friendliness and energy efficiency are considered. After experiments and comparative analysis, the energy utilization rate of the algorithm in this paper is between 78 and 89% in the experiment, and the optimal scheduling scheme can be solved in a relatively short period of time.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Multi-Regional Environmental and Economic Scheduling of Power System Based on Particle Swarm Algorithm

  • Chuandi Ma

摘要

How can the environmental impact be minimized to achieve the sustainable development of the power system? The multi-regional environmental and economic dispatching of power systems has become a focus of attention. In this study, a method based on particle swarm algorithm is used to solve the problem of multi-regional environmental and economic scheduling of power systems. The particle swarm algorithm continuously adjusts the position and speed of the particles by simulating the collaboration and information exchange between individuals in the bird swarm to optimize the scheduling scheme of the generator set. In the optimization process, many factors such as economy, environmental friendliness and energy efficiency are considered. After experiments and comparative analysis, the energy utilization rate of the algorithm in this paper is between 78 and 89% in the experiment, and the optimal scheduling scheme can be solved in a relatively short period of time.