Profit-Based Unit Commitment Problem Using PSO with Modified Dynamic Programming

被引:0
|
作者
Shukla, Anup [1 ]
Lal, Vivek Nandan [1 ]
Singh, S. N. [1 ]
机构
[1] Indian Inst Technol, Dept Elect Engn, Kanpur, Uttar Pradesh, India
来源
2015 18TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM APPLICATION TO POWER SYSTEMS (ISAP) | 2015年
关键词
Competitive environment; profit-base unit commitment problem; dynamic programming; particle swarm optimization;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a hybrid approach utilizing particle swarm optimization along with dynamic programming to solve unit commitment problem based on the profit under the deregulated power market. In the deregulated market, power and reserve prices are important factors in the decision process for unit commitment scheduling and offer freedom to utilities to schedule their generators to produce less than predicted load as well as reserve to maximize their profit. To solve the profit based unit commitment problem (PBUCP), the model is divided into exterior and interior dependent sub problems, which are discrete and continuous, respectively. The proposed model helps GENCOs to make a decision, how much power and reserve that must be put up for sale in the market, and how to schedule generators in order to receive the maximum profit. GENCOs with 3 and 10 generating units are used to demonstrate the effectiveness of the proposed approach.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] On the equal substitution of MILP unit commitment subproblems with dynamic programming
    Schwaeppe, Henrik
    Nobis, Moritz
    Mueller, Christoph
    2019 16TH INTERNATIONAL CONFERENCE ON THE EUROPEAN ENERGY MARKET (EEM), 2019,
  • [32] Using integer programming to refine Lagrangian-based unit commitment solutions
    Takriti, S
    Birge, JR
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (01) : 151 - 156
  • [33] Comparison Between the Dynamic Programming and Particle Swarm Optimization for Solving Unit Commitment Problems
    Borra, Venkata Silpa
    Debnath, K.
    2019 IEEE JORDAN INTERNATIONAL JOINT CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATION TECHNOLOGY (JEEIT), 2019, : 395 - 400
  • [34] An evolutionary programming based simulated annealing method for unit commitment problem with cooling - Bank constraints
    Rajan, CCA
    PROCEEDINGS OF THE IEEE INDICON 2004, 2004, : 435 - 440
  • [35] On Line Application of profit based unit commitment using Hybrid algorithms of memory management Algorithm
    Amudha, A.
    Rajan, C. Christober Asir
    MEMS, NANO AND SMART SYSTEMS, PTS 1-6, 2012, 403-408 : 3965 - +
  • [36] A dynamic programming based fast computation Hopfield neural network for unit commitment and economic dispatch
    Kumar, S. Senthil
    Palanisamy, V.
    ELECTRIC POWER SYSTEMS RESEARCH, 2007, 77 (08) : 917 - 925
  • [37] Unit commitment based on modified firefly algorithm
    Hussein, Balasim M.
    Jaber, Aqeel S.
    MEASUREMENT & CONTROL, 2020, 53 (3-4) : 320 - 327
  • [38] Application of Dynamic Programming Algorithm for Thermal Unit Commitment with Wind Power
    Tade, Sarika V.
    Ghate, Vilas N.
    Mulla, Shadab Q.
    Kalgunde, M. N.
    2018 2ND IEEE GLOBAL CONFERENCE ON WIRELESS COMPUTING AND NETWORKING (GCWCN - 2018), VOL II, 2018, : 182 - 186
  • [39] An evolutionary programming based tabu search method for unit commitment problem with cooling-banking constraints
    Rajan, C. Christober Asir
    2006 IEEE POWER INDIA CONFERENCE, VOLS 1 AND 2, 2006, : 80 - 87
  • [40] Transfer-Based Approximate Dynamic Programming for Rolling Security-Constrained Unit Commitment with Uncertainties
    Zhu, Jianquan
    Zeng, Kai
    Chen, Jiajun
    Zhao, Wenmeng
    Liu, Wenhao
    Zhu, Wenkai
    PROTECTION AND CONTROL OF MODERN POWER SYSTEMS, 2024, 9 (05) : 42 - 53