A new memetic algorithm approach for the price based unit commitment problem

被引:40
|
作者
Dimitroulas, Dionisios K. [1 ]
Georgilakis, Pavlos S. [1 ]
机构
[1] Natl Tech Univ Athens, Sch Elect & Comp Engn, Elect Power Div, GR-15780 Athens, Greece
关键词
Price based unit commitment (PBUC); Memetic algorithm (MA); Genetic algorithm (GA); Ramp rate constraints; Electric energy markets; Generation scheduling; GENETIC ALGORITHM; DECOMPOSITION APPROACH; ELECTRICITY MARKETS; OPTIMAL RESPONSE; PROFIT; OPTIMIZATION; GENERATOR; SYSTEMS; MODEL;
D O I
10.1016/j.apenergy.2011.06.009
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Unit commitment (UC) is a very important optimization task, which plays a major role in the daily operation planning of electric power systems that is why UC is a core research topic attracting a lot of research efforts. An innovative method based on an advanced memetic algorithm (MA) for the solution of price based unit commitment (PBUC) problem is proposed. The main contributions of this paper are: (i) an innovative two-level tournament selection, (ii) a new multiple window crossover, (iii) a novel window in window mutation operator, (iv) an innovative local search scheme called elite mutation, (v) new population initialization algorithm that is specific to PBUC problem, and (vi) new PBUC test systems including ramp up and ramp down constraints so as to provide new PBUC benchmarks for future research. The innovative two-level tournament selection mechanism contributes to the reduction of the required CPU time. The method has been applied to systems of up to 110 units and the results show that the proposed memetic algorithm is superior to other methods since it finds the optimal solution with a high success rate and within a reasonable execution time. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:4687 / 4699
页数:13
相关论文
共 50 条
  • [1] A genetic algorithm approach to price-based unit commitment
    Solanki, Jignesh
    Khushalani, Sarika
    Srivastava, Anurag
    2006 38TH ANNUAL NORTH AMERICAN POWER SYMPOSIUM, NAPS-2006 PROCEEDINGS, 2006, : 425 - +
  • [2] A binary differential evolution based memetic algorithm to solve profit based unit commitment problem
    Dhaliwal, Jatinder Singh
    Dhillon, Jaspreet Singh
    2018 IEEE 8TH POWER INDIA INTERNATIONAL CONFERENCE (PIICON), 2018,
  • [3] New algorithm for the unit commitment based on the system marginal price
    Jiang, J.J.
    Xia, Q.
    Shen, Y.
    Kang, C.Q.
    Xu, H.Q.
    Zhang, Y.P.
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2001, 41 (04): : 151 - 154
  • [4] A new hybrid algorithm for unit commitment problem
    Mantawy, AH
    AbdelMagid, YL
    Selim, SZ
    PROCEEDINGS OF THE AMERICAN POWER CONFERENCE, VOL 59, I AND II, 1997, 59 : 706 - 711
  • [5] A New Heuristic Algorithm for Unit Commitment Problem
    Najafi, S.
    Pourjamal, Y.
    2011 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN ENERGY ENGINEERING (ICAEE), 2012, 14 : 2005 - 2011
  • [6] A new hybrid algorithm for unit commitment problem
    Mantawy, AH
    AbdelMagid, YL
    Selim, SZ
    PROCEEDINGS OF THE AMERICAN POWER CONFERENCE, VOL 59 - PTS I AND II, 1997, 59 : 706 - 711
  • [7] Memetic Algorithm for Solving Monthly Unit Commitment Problem Considering Uncertain Wind Power
    Zhu, Yongli
    Liu, Xuechun
    Deng, Ran
    Zhai, Yujia
    JOURNAL OF CONTROL AUTOMATION AND ELECTRICAL SYSTEMS, 2020, 31 (02) : 511 - 520
  • [8] Memetic Algorithm for Solving Monthly Unit Commitment Problem Considering Uncertain Wind Power
    Yongli Zhu
    Xuechun Liu
    Ran Deng
    Yujia Zhai
    Journal of Control, Automation and Electrical Systems, 2020, 31 : 511 - 520
  • [9] A new method based on immune algorithm to solve the unit commitment problem
    Li, Wei
    Sheng, Deren
    Chen, Jianhong
    Yuan, Zhenfu
    Cen, Kefa
    KNOWLEDGE ENTERPRISE: INTELLIGENT STRATEGIES IN PRODUCT DESIGN, MANUFACTURING, AND MANAGEMENT, 2006, 207 : 840 - +
  • [10] A seeded memetic algorithm for large unit commitment problems
    Valenzuela, J
    Smith, AE
    JOURNAL OF HEURISTICS, 2002, 8 (02) : 173 - 195