Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/4177
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSahu, Dibya Ranjan-
dc.contributor.authorMohanty, Sanjeeb-
dc.date.accessioned2023-12-27T10:19:05Z-
dc.date.available2023-12-27T10:19:05Z-
dc.date.issued2023-12-
dc.identifier.citation9th International Conference on Advances in Energy Research (ICAER), IIT Bombay, India, 12-14th December 2023en_US
dc.identifier.urihttp://hdl.handle.net/2080/4177-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractUnit Commitment is generally used to schedule the units so as to minimize the cost of the production for the total system across the scheduled time horizon under generator operational constraints. The Unit Commitment problem is nonlinear, and a mixed integer type combinatorial optimization problem. We can obtain the global optimal solution by complete listing which cannot be possible for large power systems due to its requirements for excessive computational time. Unit Commitment presents a methodology to reduce cost and improve the system reliability. Unit Commitment is a dynamic process and power production planning changes as per loads and topologies of the network. The problem is solved by Backward Dynamic Programming approach which solves the dynamic problem in 12 stages. This paper deals with a Unit Commitment problem that is solved using Backward Dynamic programming without time constraints and outcomes show minimum cumulative total cost for operating 4 units in 12 stages for a 24-hour horizon based on a load curve of a dayen_US
dc.subjectUnit Commitmenten_US
dc.subjectBackward Dynamic Programmingen_US
dc.subjectOptimizationen_US
dc.subjectDay Load Curveen_US
dc.titleBackward Dynamic Programming Approach to Solve the Unit Commitment Problem Based on a Day Load Curveen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2023_ICAER_DRSahoo_Backward.pdf406.81 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.