DocumentCode
3146597
Title
Parallel processing implementation of the unit commitment problem with full AC power flow constraints
Author
Murillo-Sanchez, Carlos E. ; Thomas, Robert J.
Author_Institution
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
fYear
2000
fDate
4-7 Jan. 2000
Abstract
The authors describe a parallel implementation of the Lagrangian Relaxation Algorithm with variable duplication for the thermal unit commitment problem. The formulation was previously reported by the authors and allows inclusion of the full nonlinear AC network power flow model, which permits addressing voltage limits, as well as more realistic branch flow limits than is possible with a linear DC flow model. Thus, potential VAr production can be used as another criterion for commitment of otherwise expensive generators in strategic locations. The algorithm is highly parallelizable, and the authors have taken advantage of this in a version currently being developed for the Cornell Theory Center´s Velocity AC3 NT cluster.
Keywords
load flow control; parallel algorithms; power engineering computing; power generation dispatch; power generation scheduling; Lagrangian Relaxation Algorithm; Velocity AC3 NT cluster; full AC power flow constraints; linear DC flow model; nonlinear AC network power flow model; parallel processing implementation; parallelizable algorithm; potential VAr production; realistic branch flow limits; strategic locations; thermal unit commitment problem; unit commitment problem; variable duplication; voltage limits; Clustering algorithms; Combinatorial mathematics; Costs; Lagrangian functions; Load flow; Parallel processing; Power generation; Power system planning; Production; Reactive power;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on
Print_ISBN
0-7695-0493-0
Type
conf
DOI
10.1109/HICSS.2000.926751
Filename
926751
Link To Document