1981
DOI: 10.1109/mper.1981.5511434
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Hydrothermal Scheduling With Cascaded Plants Using Progressive Optimality Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

1985
1985
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 1 publication
0
7
0
Order By: Relevance
“…Step1: Setting parameter in PSO: particle population size, the solution hyperspace dimensionality, the maximum iterations, other parameters of the PSO algorithm respectively 1 c , 2 c , 1 r , 2 r , et al Then initializing particles with random positions and velocities in the search space;…”
Section: B Particle Swarm Optimization Algorithmmentioning
confidence: 99%
“…Step1: Setting parameter in PSO: particle population size, the solution hyperspace dimensionality, the maximum iterations, other parameters of the PSO algorithm respectively 1 c , 2 c , 1 r , 2 r , et al Then initializing particles with random positions and velocities in the search space;…”
Section: B Particle Swarm Optimization Algorithmmentioning
confidence: 99%
“…based scheduling algorithm which resembles that outlined in sub-section 11.2 were discussed in [3,4,5]. In this section, the additional computational requirements associated with applying the proposed method to the P.O.P.…”
Section: Iii3 Computational Requirementsmentioning
confidence: 99%
“…based approach to short-term hydrothermal scheduling. The advantages of this application were discussed in [3 and [4]. Unfortunately, it sociated with this application.…”
Section: Introductionmentioning
confidence: 99%
“…MOCTU is a multi-stage decision problem that involves a highly nonlinear and computationally expensive objective function with a large number of constraints. The progressive optimality algorithm (POA) has been shown to be an effective method for solving multi-stage optimization problems by decomposing a multi-stage decision problem into a series of non-linear programming two-stage problems [24][25][26][27][28], and it is suitable for solving MOCTU. However, it is a difficult task to find feasible solutions for a large-scale MOCTU problem using POA due to its drawback, namely the easily encountered local optimum for complex problems.…”
Section: Introductionmentioning
confidence: 99%