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 条
  • [41] An improved TLBO algorithm to solve profit based unit commitment problem under deregulated environment
    Krishna, P. V. Rama
    Sao, Sukhdeo
    1ST GLOBAL COLLOQUIUM ON RECENT ADVANCEMENTS AND EFFECTUAL RESEARCHES IN ENGINEERING, SCIENCE AND TECHNOLOGY - RAEREST 2016, 2016, 25 : 652 - 659
  • [42] An ICA based approach for solving profit based unit commitment problem market
    Ghadi, M. Jabbari
    Baghramian, A.
    Imani, M. Hosseini
    APPLIED SOFT COMPUTING, 2016, 38 : 487 - 500
  • [43] A deterministic optimization approach for the unit commitment problem
    Marcovecchio, Marian G.
    Novais, Augusto Q.
    Grossmann, Ignacio E.
    21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 532 - 536
  • [44] An Optimal Control Approach to the Unit Commitment Problem
    Fontes, F. A. C. C.
    Fontes, D. B. M. M.
    Roque, L. A.
    2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2012, : 7069 - 7074
  • [45] A memetic algorithm for the inventory routing problem
    Sakhri, Mohamed Salim Amri
    Tlili, Mounira
    Korbaa, Ouajdi
    JOURNAL OF HEURISTICS, 2022, 28 (03) : 351 - 375
  • [46] Solving unit commitment problem by a binary shuffled frog leaping algorithm
    Barati, Mohammad
    Farsangi, Malihe M.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2014, 8 (06) : 1050 - 1060
  • [47] Application of Binary Slime Mould Algorithm for Solving Unit Commitment Problem
    Rifat, Md. Sayed Hasan
    Niloy, Md. Ashaduzzaman
    Rizvi, Mutasim Fuad
    Ahmed, Ashik
    Ahshan, Razzaqul
    Nengroo, Sarvar Hussain
    Lee, Sangkeum
    IEEE ACCESS, 2023, 11 : 45279 - 45300
  • [48] Solution to security constrained unit commitment problem using genetic algorithm
    Kumar, V. Senthil
    Mohan, M. R.
    INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2010, 32 (02) : 117 - 125
  • [49] An efficient hybrid Taguchi-immune algorithm for the unit commitment problem
    Lin, Whei-Min
    Gow, Hong-Jey
    Tsai, Ming-Tang
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (11) : 13662 - 13669
  • [50] A memetic algorithm for the inventory routing problem
    Mohamed Salim Amri Sakhri
    Mounira Tlili
    Ouajdi Korbaa
    Journal of Heuristics, 2022, 28 : 351 - 375