Solving multi-area economic dispatch problem using hybrid exchange market algorithm with grasshopper optimization algorithm

被引:17
|
作者
Sharifian, Yeganeh [1 ]
Abdi, Hamdi [1 ]
机构
[1] Razi Univ, Engn Fac, Elect Engn Dept, Kermanshah, Iran
关键词
Multi-area economic dispatch; Exchange market algorithm; Grasshopper optimization algorithm; Tie-line constraint; PARTICLE SWARM OPTIMIZATION; SEARCH OPTIMIZATION;
D O I
10.1016/j.energy.2022.126550
中图分类号
O414.1 [热力学];
学科分类号
摘要
This research work proposes the hybrid meta-heuristic algorithm to solve the multi-area economic dispatch problem to operate the power systems economically. The proposed hybrid algorithm combines the exchange market and grasshopper optimization algorithms. The grasshopper optimization algorithm sometimes suffers from premature convergence. To overcome this drawback, a hybrid algorithm for the better balance between exploration and exploitation and thus finding optimal solutions with high quality and robustness, is proposed in this paper. The main target of this paper is to investigate the application of the hybrid algorithm for optimizing the multi-area economic dispatch problem, satisfying different constraints of the valve point loading effect, multiple fuels, prohibited operation zones, ramp-rate limit, the tie-line constraints, and transmission loses. In this regard, after validation of the proposed hybrid algorithm by applying it on some benchmark functions of diverse nature, the effectiveness and robustness of the proposed algorithm are evaluated in three case studies of the multi-area economic dispatch problem. The comparative results confirmed the effectiveness of the proposed method in terms of robustness and quality solutions. Also, the applied method reduces the fuel cost in the range of 0.0229%-1.1622%.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Improve Crisscross optimization algorithm for solving the multi-area economic/emission dispatch
    Li, First A. Jinbei
    2018 CHINA INTERNATIONAL CONFERENCE ON ELECTRICITY DISTRIBUTION (CICED), 2018, : 453 - 461
  • [2] Multi-area economic dispatching using improved grasshopper optimization algorithm
    Peng Zhang
    Weiwei Ma
    Yanli Dong
    Babak Daneshvar Rouyendegh
    Evolving Systems, 2021, 12 : 837 - 847
  • [3] Multi-area economic dispatching using improved grasshopper optimization algorithm
    Zhang, Peng
    Ma, Weiwei
    Dong, Yanli
    Rouyendegh, Babak Daneshvar
    EVOLVING SYSTEMS, 2021, 12 (03) : 837 - 847
  • [4] Multi-area Economic Dispatch Using Hybrid Cuckoo Search Algorithm
    Khai Phuc Nguyen
    Nguyen Duy Dinh
    Fujita, Goro
    2015 50TH INTERNATIONAL UNIVERSITIES POWER ENGINEERING CONFERENCE (UPEC), 2015,
  • [5] Real-Coded Genetic Algorithm for Solving Multi-Area Economic Dispatch Problem
    Huynh Thi Thanh Binh
    Tran Kim Toan
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE FOR ENGINEERING SOLUTIONS (CIES), 2013, : 97 - 101
  • [6] Solving static and dynamic multi-area economic dispatch problems using an improved competitive swarm optimization algorithm
    Chen, Xu
    Tang, Guowei
    ENERGY, 2022, 238
  • [7] Multi-Area Economic Dispatch Using Flower Pollination Algorithm
    Vijayaraj, S.
    Santhi, R. K.
    2016 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, AND OPTIMIZATION TECHNIQUES (ICEEOT), 2016, : 4355 - 4360
  • [8] A Hybrid Algorithm for Solving the Economic Dispatch Problem
    Barros, Raul Silva
    Carmona Cortes, Omar Andres
    Lopes, Rafael Fernandes
    da Silva, Josenildo Costa
    2013 1ST BRICS COUNTRIES CONGRESS ON COMPUTATIONAL INTELLIGENCE AND 11TH BRAZILIAN CONGRESS ON COMPUTATIONAL INTELLIGENCE (BRICS-CCI & CBIC), 2013, : 617 - 621
  • [9] Teaching-learning-based optimization algorithm for multi-area economic dispatch
    Basu, M.
    ENERGY, 2014, 68 : 21 - 28
  • [10] Solving Multi-Area Environmental/Economic Dispatch by Pareto-Based Chemical-Reaction Optimization Algorithm
    Li, Junqing
    Pan, Quanke
    Duan, Peiyong
    Sang, Hongyan
    Gao, Kaizhou
    IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (05) : 1240 - 1250