1992
DOI: 10.1109/59.207310
|View full text |Cite
|
Sign up to set email alerts
|

A solution method of unit commitment by artificial neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
62
0
2

Year Published

1999
1999
2018
2018

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 188 publications
(64 citation statements)
references
References 11 publications
0
62
0
2
Order By: Relevance
“…In the FT method [11], [13], [24] using fuzzy set solves the forecasted load schedules error but it will also suffer from complexity. The H neural network technique [12] considers more constraints but it may suffer from numerical convergence due to its training process. SA [14][15][16][17], [23][24] is a powerful, general-purpose stochastic optimisation technique, which can theoretically converge asymptotically to a global optimum solution with probability one.…”
Section: Introductionmentioning
confidence: 99%
“…In the FT method [11], [13], [24] using fuzzy set solves the forecasted load schedules error but it will also suffer from complexity. The H neural network technique [12] considers more constraints but it may suffer from numerical convergence due to its training process. SA [14][15][16][17], [23][24] is a powerful, general-purpose stochastic optimisation technique, which can theoretically converge asymptotically to a global optimum solution with probability one.…”
Section: Introductionmentioning
confidence: 99%
“…In the LDWPSO approach, particle's fitness is best until the preceding iteration, its velocity is kept unchanged in the next iteration, otherwise, the particle's velocity and position are changed according to (12) and (13), which does not truly reflect the search process to find the optimum.…”
Section: Overview Of the Psomentioning
confidence: 99%
“…A number of methods have been proposed for solving the hydrothermal scheduling problem. Some examples of these methods are nonlinear programming (NLP) [1][2][3], Dynamic Programming (DP) [4][5][6], Lagrangian Relaxation (LR) [7][8][9], Tabu Search [10], Expert Systems [11], Artificial Neural Networks (ANN) [12], Genetic Algorithms (GA) [13][14][15]. Among these methods, DP would provide a good framework for optimizing the decisions.…”
Section: Introductionmentioning
confidence: 99%
“…Generate initial frog population by (23) where , is initialized with 0 (shutdown) or 1 (startup) at each period using the rand( ) function.…”
Section: The Coupled External and Internal Model For Sthgsmentioning
confidence: 99%