2010
DOI: 10.3724/sp.j.1087.2010.01550
|View full text |Cite
|
Sign up to set email alerts
|

Optimal operation of reservoir based on dynamic programming and particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The global optimal solution can be found quickly through inter-particle cooperation and information interaction, and the global search capability is strong, which is suitable for optimizing continuous variables. Li et al (2022) introduced inertia weights of the adaptive mechanism to dynamically adjust its convergence speed to avoid PSO getting into a local optimal solution, which can lead to premature convergence. Song (2020) and Ning et al (2022) considered the complexity of a nonconvex planning reactive-voltage optimization model solution, using a highly robust PSO algorithm to solve the model without analyzing the nature of the model itself.…”
Section: Solving Methodology For the Stackelberg Gamementioning
confidence: 99%
“…The global optimal solution can be found quickly through inter-particle cooperation and information interaction, and the global search capability is strong, which is suitable for optimizing continuous variables. Li et al (2022) introduced inertia weights of the adaptive mechanism to dynamically adjust its convergence speed to avoid PSO getting into a local optimal solution, which can lead to premature convergence. Song (2020) and Ning et al (2022) considered the complexity of a nonconvex planning reactive-voltage optimization model solution, using a highly robust PSO algorithm to solve the model without analyzing the nature of the model itself.…”
Section: Solving Methodology For the Stackelberg Gamementioning
confidence: 99%