Access the full text.
Sign up today, get DeepDyve free for 14 days.
Léonard Bacaud, C. Lemaréchal, A. Renaud, C. Sagastizábal (2001)
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using PreconditionersComputational Optimization and Applications, 20
A. Mantawy, Y. Abdel-Magid, S. Selim (1998)
A simulated annealing algorithm for unit commitmentIEEE Transactions on Power Systems, 13
A. Frangioni, C. Gentile (2006)
Solving Nonlinear Single-Unit Commitment Problems with Ramping ConstraintsOper. Res., 54
Boran Lu, M. Shahidehpour (2005)
Unit commitment with flexible generating unitsIEEE Transactions on Power Systems, 20
J. Valenzuela, Alice Smith (2002)
A Seeded Memetic Algorithm for Large Unit Commitment ProblemsJournal of Heuristics, 8
F. Zhuang, F. Galiana (1990)
Unit commitment by simulated annealingIEEE Transactions on Power Systems, 5
T. Feo, M. Resende (1995)
Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 6
S. Wong (1998)
An enhanced simulated annealing approach to unit commitmentInternational Journal of Electrical Power & Energy Systems, 20
A. Cohen, M. Yoshimura (1983)
A Branch-and-Bound Algorithm for Unit CommitmentIEEE Transactions on Power Apparatus and Systems, PAS-102
M. Nowak, W. Römisch (2000)
Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under UncertaintyAnnals of Operations Research, 100
J. Shaw (1995)
A direct method for security-constrained unit commitmentIEEE Transactions on Power Systems, 10
A. Viana, J. Sousa, M. Matos (2003)
Using GRASP to Solve the Unit Commitment ProblemAnnals of Operations Research, 120
Yong Fu, M. Shahidehpour, Zuyi Li (2005)
Security-constrained unit commitment with AC constraintsIEEE Transactions on Power Systems, 20
S. Takriti, J. Birge (2000)
Using integer programming to refine Lagrangian-based unit commitment solutionsIEEE Transactions on Power Systems, 15
C. Tseng, S. Oren, Carol Cheng, Chao-an Li, A. Svoboda, Raymond Johnson (1999)
A transmission-constrained unit commitment method in power system schedulingDecis. Support Syst., 24
H. Yamin (2004)
Review on methods of generation scheduling in electric power systemsElectric Power Systems Research, 69
Ana Viana, J. Sousa, M. Matos (2005)
Constraint Oriented Neighbourhoods — A New Search Strategy in Metaheuristics
S. Al-Agtash, R. Su (1998)
Augmented Lagrangian approach to hydro-thermal schedulingIEEE Transactions on Power Systems, 13
A. Merlin, P. Sandrin (1983)
A New Method for Unit Commitment at Electricite De FranceIEEE Transactions on Power Apparatus and Systems, PAS-102
H. Ma, S. Shahidehpour (1999)
Unit commitment with transmission security and voltage constraintsIEEE Transactions on Power Systems, 14
A. Borghetti, A. Frangioni, Fabrizio Lacalandra, C. Nucci (2002)
Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit CommitmentIEEE Power Engineering Review, 22
A. Viana (2004)
Metaheuristics for the unit commitment problem : The Constraint Oriented Neighbourhoods search strategy
Probability Subcommittee (1979)
IEEE Reliability Test SystemIEEE Transactions on Power Apparatus and Systems, PAS-98
Louis Dubost, R. Gonzalez, C. Lemaréchal (2005)
A primal-proximal heuristic applied to the French Unit-commitment problemMathematical Programming, 104
S. Kazarlis, A. Bakirtzis, V. Petridis (1996)
A genetic algorithm solution to the unit commitment problemIEEE Transactions on Power Systems, 11
G. Purushothama, L. Jenkins (2002)
Simulated Annealing with Local Search: A Hybrid Algorithm for Unit CommitmentIEEE Power Engineering Review, 22
X. Guan, Sangang Guo, Q. Zhai (2005)
The conditions for obtaining feasible solutions to security-constrained unit commitment problemsIEEE Transactions on Power Systems, 20
A. Mantawy, Y. Abdel-Magid, S. Selim (1998)
Unit commitment by tabu search, 145
F. Lee (1988)
Short-term thermal unit commitment-a new methodIEEE Transactions on Power Systems, 3
Purpose – The purpose of this paper is to solve the problem of committing electric power generators (unit commitment, UC), considering network constraints. Design/methodology/approach – The UC is first solved with a local search based meta‐heuristic, following the assumption that all generators and loads are connected to a single network node. For evaluation purposes, the economical production levels of the units committed are computed by running a pre‐dispatch algorithm where network constraints are not included. If a good quality solution is reached, an economic dispatch (ED) with network constraints is performed, where the geographic location of generators and loads are considered. Therefore, the production level of each committed generator is performed that leads to the global lowest solution cost, regarding both the generators' costs and constraints and the power system network constraints. Findings – The algorithm proposed is computationally efficient, given the time available for decision making. In addition, the solution for this algorithm, in terms of minimization of total costs, is generally better than the solution of the two phases approach. Some contractual and legal aspects related with the injection in network connections can also be included in the model. Practical implications – UC with network constraints has a large potential of use, especially for small and medium size power systems. It reflects reality in a closer way and provides a more complete and realistic knowledge about the system in operation. Originality/value – The paper presents an approach where the ED with network constraints is integrated with the UC procedure. The model described is currently implemented in an EMS package offered in the market – making it a case of successful transfer from science to industry.
International Journal of Energy Sector Management – Emerald Publishing
Published: Sep 12, 2008
Keywords: Electric power generation; Linear programming; Algorithmic languages
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.