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 条
  • [21] A NEW APPROACH FOR SOLVING EXTENDED UNIT COMMITMENT PROBLEM
    RUZIC, S
    RAJAKOVIC, N
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1991, 6 (01) : 269 - 277
  • [22] Lagrangian relaxation method for price-based unit commitment problem
    Shiina, T
    Watanabe, I
    ENGINEERING OPTIMIZATION, 2004, 36 (06) : 705 - 719
  • [23] A New Strategy for Solving Unit Commitment Problem by PSO algorithm
    Yehescale, Gandham
    Reddy, M. Damodar
    2018 IEEE INTERNATIONAL CONFERENCE ON CURRENT TRENDS IN ADVANCED COMPUTING (ICCTAC), 2018,
  • [24] A Memetic Computing Approach for Unit Commitment with Energy Storage Systems
    Salvini, Coriolano
    Monacchia, Stefano
    3RD INTERNATIONAL CONFERENCE ON ENERGY AND ENVIRONMENT RESEARCH, ICEER 2016, 2017, 107 : 377 - 382
  • [25] Efficient Holomorphic Based Approach for Unit Commitment Problem
    Shukla, Anup
    Kesherwani, Saurabh
    Singh, S. N.
    2016 NATIONAL POWER SYSTEMS CONFERENCE (NPSC), 2016,
  • [26] Unit Commitment Problem Using An Efficient PSO Based Algorithm
    Zhai, Yu
    Mu, Nankun
    Liao, Xiaofeng
    Le, Junqing
    Huang, Tingwen
    2019 ELEVENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI 2019), 2019, : 320 - 324
  • [27] A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem
    Roque, Luis A. C.
    Fontes, Dalila B. M. M.
    Fontes, Fernando A. C. C.
    EXPERIMENTAL ALGORITHMS, 2011, 6630 : 327 - +
  • [28] An Improved Genetic Algorithm Approach to the Unit Commitment/Economic Dispatch Problem
    Ponciroli, Roberto
    Stauff, Nicolas E.
    Ramsey, Jackson
    Ganda, Francesco
    Vilim, Richard B.
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2020, 35 (05) : 4005 - 4013
  • [29] A BIASED RANDOM KEY GENETIC ALGORITHM APPROACH FOR UNIT COMMITMENT PROBLEM
    Roque, Luis A. C.
    Fontes, Dalila B. M. M.
    Fontes, Fernando A. C. C.
    ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION, 2010, : 332 - 339
  • [30] A unit commitment problem by using genetic algorithm based on unit characteristic classification
    Senjyu, T
    Yamashiro, H
    Uezato, K
    Funabashi, T
    2002 IEEE POWER ENGINEERING SOCIETY WINTER MEETING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, 2002, : 58 - 63