1996
DOI: 10.1109/59.485990
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced techniques on sequential unit commitment with interchange transactions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1997
1997
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…Furthermore, the limiting conditions, system limiting conditions, and power generator limiting conditions generated from the relationship with previous time periods must be satisfied for every state of every hour, the curse of dimensionality frequently occurs, in which the dimensions are too large to calculate the solution to the optimal unit commitment problem. In other words, the problem of unit commitment planning is an optimization problem in the form of large-scale combined non-convex, which includes numerous equation/inequation limiting conditions and integer/real number variables [52,55].…”
Section: Model Descriptionmentioning
confidence: 99%
“…Furthermore, the limiting conditions, system limiting conditions, and power generator limiting conditions generated from the relationship with previous time periods must be satisfied for every state of every hour, the curse of dimensionality frequently occurs, in which the dimensions are too large to calculate the solution to the optimal unit commitment problem. In other words, the problem of unit commitment planning is an optimization problem in the form of large-scale combined non-convex, which includes numerous equation/inequation limiting conditions and integer/real number variables [52,55].…”
Section: Model Descriptionmentioning
confidence: 99%
“…Dynamic programming was adopted in literature (Lee, 1991), and the average full-load consumption combined with the unit operation factor was selected for its reliability and validity. To better improve the accuracy of the solution, reference (Fan et al, 1996) undertook the sequential input method. Later, the exit commitment algorithm appeared.…”
Section: Introductionmentioning
confidence: 99%
“…The UC problem will become very difficult and complicated when the scale of the problem increases. For many years, many researchers have developed a variety of solution methodologies from early approaches in the basis of Priority List (PL) [14][15][16], Dynamic Programming (DP) [5,7,[17][18][19] and Lagrangian Relaxation (LR) [20][21][22] to the advanced approaches in the basis of Mixed Integer Programming (MIP) [23][24][25] which is the most commonly adopted. Furthermore, artificial intelligence is being used to solve the UC problem, i.e., Tabu Search (TS) [26,27], Genetic Algorithm (GA) [28][29][30], Simulated Annealing (SA) [31][32][33], Particle Swarm Optimization (PSO) [34][35][36], and Ant Colony Optimization (ACO) [37,38].…”
Section: Chapter Introduction 11 Backgroundmentioning
confidence: 99%