A T-cell algorithm for solving dynamic economic power dispatch problems

被引:0
|
作者
Aragon, Victoria S. [1 ]
Coello Coello, Carlos A. [2 ]
Leguizamon, Mario G. [1 ]
机构
[1] Univ Nacl San Luis, Lab Invest & Desarrollo Inteligencia Computac, Ej Los Andes 950, RA-5700 San Luis, Argentina
[2] CINVESTAV IPN, Evolutionary Computat Grp, Dept Comp, Av IPN 2508, Mexico City 07300, DF, Mexico
来源
关键词
Artificial immune systems; dynamic economic dispatch problem; dynamic economic; emission dispatch problem; metaheuristics; HARMONY SEARCH; LOAD DISPATCH; OPTIMIZATION; UNITS; PSO; SQP;
D O I
10.24215/16666038.20.e01
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents the artificial immune system IA DED (Immune Algorithm Dynamic Economic Dispatch) to solve the Dynamic Economic Dispatch (DED) problem and the Dynamic Economic Emission Dispatch (DEED) problem. Our approach considers these as dynamic problems whose constraints change over time. IA DED is inspired on the activation process that T cells suffer in order to find partial solutions. The proposed approach is validated using several DED problems taken from specialized literature and one DEED problem. The latter is addressed by transforming a multi-objective problem into a single-objective problem by using a linear aggregating function that combines the (weighted) values of the objectives into a single scalar value. Our results are compared with respect to those obtained by other approaches taken from the specialized literature. We also provide some statistical analysis in order to determine the sensitivity of the performance of our proposed approach to its parameters. Part of this work was presented at the XXV Argentine Congress of Computer Science (CACIC), 2019.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 50 条
  • [1] A T-cell algorithm for solving dynamic optimization problems
    Aragon, Victoria S.
    Esquivel, Susana C.
    Coello Coello, Carlos A.
    [J]. INFORMATION SCIENCES, 2011, 181 (17) : 3614 - 3637
  • [2] An immune algorithm with power redistribution for solving economic dispatch problems
    Aragon, V. S.
    Esquivel, S. C.
    Coello Coello, C. A.
    [J]. INFORMATION SCIENCES, 2015, 295 : 609 - 632
  • [3] Improved tunicate swarm algorithm: Solving the dynamic economic emission dispatch problems
    Li, Ling-Ling
    Liu, Zhi-Feng
    Tseng, Ming-Lang
    Zheng, Sheng-Jie
    Lim, Ming K.
    [J]. APPLIED SOFT COMPUTING, 2021, 108
  • [4] Harmony search algorithm for solving combined heat and power economic dispatch problems
    Khorram, Esmaile
    Jaberipour, Majid
    [J]. ENERGY CONVERSION AND MANAGEMENT, 2011, 52 (02) : 1550 - 1554
  • [5] Implementation of Flower Pollination Algorithm for Solving Economic Dispatch Problems in Power System
    Ramli, Nur Fariza
    Kamari, Nor Azwan Mohamed
    Abd Halim, Syahirah
    Ibrahim, Asrul
    Musirin, Ismail
    [J]. JURNAL KEJURUTERAAN, 2021, 33 (04): : 1053 - 1060
  • [6] Dynamic Economic Dispatch Solving in Power Systems Using Imperialist Competitive Algorithm
    Samadi, Reza
    Hamidzadeh, Javad
    [J]. 2014 INTERNATIONAL CONGRESS ON TECHNOLOGY, COMMUNICATION AND KNOWLEDGE (ICTCK), 2014,
  • [7] Implementation of flower pollination algorithm for solving economic load dispatch and combined economic emission dispatch problems in power systems
    Abdelaziz, A. Y.
    Ali, E. S.
    Abd Elazim, S. M.
    [J]. ENERGY, 2016, 101 : 506 - 518
  • [8] Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch
    Mohammadi-ivatloo, Behnam
    Rabiee, Abbas
    Soroudi, Alireza
    Ehsan, Mehdi
    [J]. ENERGY, 2012, 44 (01) : 228 - 240
  • [9] Dragonfly Algorithm for solving probabilistic Economic Load Dispatch problems
    Das, Diptanu
    Bhattacharya, Aniruddha
    Ray, Rup Narayan
    [J]. NEURAL COMPUTING & APPLICATIONS, 2020, 32 (08): : 3029 - 3045
  • [10] Solving Economic Dispatch Problems Utilizing Cuckoo Search Algorithm
    Sulaiman, M. H.
    Mohamed, M. R.
    [J]. 2014 IEEE 8TH INTERNATIONAL POWER ENGINEERING AND OPTIMIZATION CONFERENCE (PEOCO), 2014, : 89 - 93