CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Lagrangian Decomposition Model for Unit Commitment Problem

by S. Maheswari, C. Vijayalakshmi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 43 - Number 12
Year of Publication: 2012
Authors: S. Maheswari, C. Vijayalakshmi
10.5120/6156-8550

S. Maheswari, C. Vijayalakshmi . A Lagrangian Decomposition Model for Unit Commitment Problem. International Journal of Computer Applications. 43, 12 ( April 2012), 21-25. DOI=10.5120/6156-8550

@article{ 10.5120/6156-8550,
author = { S. Maheswari, C. Vijayalakshmi },
title = { A Lagrangian Decomposition Model for Unit Commitment Problem },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 43 },
number = { 12 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume43/number12/6156-8550/ },
doi = { 10.5120/6156-8550 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:33:13.568043+05:30
%A S. Maheswari
%A C. Vijayalakshmi
%T A Lagrangian Decomposition Model for Unit Commitment Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 43
%N 12
%P 21-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper designs an optimization model for Unit Commitment Problem (UCP) which is formulated as a Non Linear Programming Problem (NLPP) with respect to various constraints. The model can be solved by Lagrangian Decomposition (LD) problem and it is obtained by relaxing the constraints from NLPP using Lagrangian Relaxation Method. Generation scheduling is used to find the maximum demand utilized in the planning horizon by the minimum generation cost. It reveals the fact that Maximum profit can be achieved for power generating utility in order to supply the load in a reliable manner. Based on the numerical calculations and graphical representations, the optimum value is obtained by the proposed model for electrical power system cycles.

References
  1. Allen J. Wood, Bruce F. Wollenbrg, "Power generation operation and control", John Wiley & Sons, New York, 1984.
  2. Rudolf, R. Bayrleithner, "A genetic algorithm for solving the unit commitment problem of a hydro thermal power system", IEEE transactions on power systems, Vol. 14, No. 4, Nov. 1999, pp. 1460?1468.
  3. C. L. Wadhwa, "Electrical Power Systems", Third Edition, New Delhi, 2003.
  4. F. N. Lee, "A Fuel-Constrained Unit Commitment Method", IEEE Transaction on Power Systems, August 1989, pp. 691?698.
  5. F. Zhuang, F. D. Galiana, "Towards A More Rigorous and Practical Unit Commitment by Lagrangian Relaxation", IEEE Trans. On Power Systems, Vol. PWRS, pp. 763?770, May 1988.
  6. S. Virmani, Cadrin, K. Imhof, S. Mukherjee, "Implementation of a Lagrangian Relaxation Based Unit Commitment Problems, IEEE Transaction on Power Systems, Vol. 4, No. 4, October 1989, pp. 692?698.
  7. S. Maheswari and C. Vijayalakshmi, "An Optimal Design to Schedule the Hydro power Generation using Lagrangian Relaxation Method", Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) Computer Society of India, Visakhapatnam, ISBN : 978-3-642-27442-8, AISC 132, pp. 723?730, Springer–Verlag Berlin Heidelberg 2012.
  8. A. Cohen and V. Sherkat, "Optimization-Based Methods for Operations Scheduling", Proceedings of IEEE, Vol. 75, No. 12, 1987, pp. 1574?1591.
  9. J. J. Shaw and D. P. Bertsekas, "Optimal Scheduling of Large Hydrothermal Power Systems", IEEE Transactions on Power Apparatus and Systems, Vol. PAS-104, 1985, pp. 286?293.
  10. L. A. F. M. Ferreira, T. Anderson, C. F. Imparato, T. E. Miller, C. K. Pang, A. Svoboda, A. F. Vojdani, "Short-Term Resource Scheduling in Multi-Area Hydrothermal Power Systems", Electric Power & Energy Systems, Vol. 11, No. 3, 1989, pp. 200?212.
  11. A. Renaud, "Daily Generation Management at Electricite de France: From Planning Towards Real Time", IEEE Transaction on Automatic Control, Vol. 38, No. 7, 1993, pp. 1080?1093.
  12. S. Maheswari and C. Vijayalakshmi, "Optimization Model for Electricity Distribution System Control using Communication System by Lagrangian Relaxation Technique", CiiT International Journal of Wireless Communication, Print: ISSN 0974 – 9756 & Online: ISSN 0974 – 9640, Vol 3, No 3, pp. 183-187, March 2011.
  13. S. J. Wang, S. M. Shahidehpour, D. S. Kirschen, S. Mokhtari, and G. D. Irisarri, "Short-Term Generation Scheduling with Transmission Constraints Using Augmented Lagrangian Relaxation", IEEE Transactions on Power Systems, Vol. 10, No. 3, Aug. 1995, pp. 1294?1301.
Index Terms

Computer Science
Information Sciences

Keywords

Unit Commitment Generation Scheduling Lagrangian Decomposition Model Generation Cost

Powered by PhDFocusTM