Multi-objective quasi-oppositional teaching learning based optimization for economic emission load dispatch problem

被引:147
作者
Roy, Provas Kumar [1 ]
Bhui, Sudipta [1 ]
机构
[1] Dr BC Roy Engn Coll, Dept Elect Engn, Durgapur 713206, W Bengal, India
关键词
Economic dispatch; Emission; Valve point loading; Pareto front; Opposition based learning; Teaching learning based optimization; BIOGEOGRAPHY-BASED OPTIMIZATION; GRAVITATIONAL SEARCH ALGORITHM; ENVIRONMENTAL/ECONOMIC POWER DISPATCH; DIFFERENTIAL EVOLUTION ALGORITHM; GENETIC ALGORITHM; PROGRAMMING TECHNIQUES; FLOW;
D O I
10.1016/j.ijepes.2013.06.015
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes an efficient optimization approach, namely quasi-oppositional teaching learning based optimization (QOTLBO) for solving non-linear multi-objective economic emission dispatch (EED) problem of electric power generation with valve point loading. In this article, a non-dominated sorting QOTLBO is employed to approximate the set of Pareto solution through the evolutionary optimization process. The proposed approach is carried out to obtain EED solution for 6-unit, 10-unit and 40-unit systems. For showing the superiority of this optimization technique, numerical results of the four test systems are compared with several other EED based recent optimization methods. The simulation results show that the proposed algorithm gives comparatively better operational fuel cost and emission in less computational time compared to other optimization techniques. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:937 / 948
页数:12
相关论文
共 50 条
[21]   Performance Assessment of a Set of Multi-Objective Optimization Algorithms for Solution of Economic Emission Dispatch Problem [J].
Mishra, Sarat Kumar ;
Mishra, Sudhansu Kumar .
INFORMATICA-AN INTERNATIONAL JOURNAL OF COMPUTING AND INFORMATICS, 2020, 44 (03) :349-360
[22]   Environmental/economic power dispatch problem using multi-objective differential evolution algorithm [J].
Wu, L. H. ;
Wang, Y. N. ;
Yuan, X. F. ;
Zhou, S. W. .
ELECTRIC POWER SYSTEMS RESEARCH, 2010, 80 (09) :1171-1181
[23]   Multi-objective biogeography-based optimization for dynamic economic emission load dispatch considering plug-in electric vehicles charging [J].
Ma, Haiping ;
Yang, Zhile ;
You, Pengcheng ;
Fei, Minrui .
ENERGY, 2017, 135 :101-111
[24]   Multi-objective Optimization of Economic Environmental Dispatch [J].
Zhang, Rui ;
Zhang, Li-sheng ;
Liu, Shu-nan .
2016 INTERNATIONAL CONFERENCE ON ENVIRONMENT, CLIMATE CHANGE AND SUSTAINABLE DEVELOPMENT (ECCSD 2016), 2016, :30-36
[25]   Differential Evolution Algorithm for Multi-objective Economic Load Dispatch Considering Minimum Emission Costs [J].
Yao, Fang ;
Meng, Ke ;
Xu, Zhao ;
Dong, Zhao Yang ;
Iu, Herbert ;
Zhao, Jun Hua ;
Wong, Kit Po .
2011 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2011,
[26]   Teaching learning based optimization for economic load dispatch problem considering valve point loading effect [J].
Banerjee, Sumit ;
Maity, Deblina ;
Chanda, Chandan Kumar .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2015, 73 :456-464
[27]   Linear Hopfield Based Optimization for Combined Economic Emission Load Dispatch Problem [J].
Sharma, J. P. ;
Kamath, H. R. .
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2012), 2014, 236 :885-894
[28]   Multi-objective optimization for economic emission dispatch using an improved multi-objective binary differential evolution algorithm [J].
Di, Yijuan ;
Fei, Minrui ;
Wang, Ling ;
Wu, Wei .
INTERNATIONAL CONFERENCE ON APPLIED ENERGY, ICAE2014, 2014, 61 :2016-2021
[29]   A Multi-objective Chaotic Optimization Algorithm for Economic Emission Dispatch with Transmission Loss [J].
Di, Yijuan ;
Wang, Ling ;
Fei, Minrui .
INTELLIGENT COMPUTING IN SMART GRID AND ELECTRICAL VEHICLES, 2014, 463 :304-312
[30]   A multi-objective optimization based solution for the combined economic-environmental power dispatch problem [J].
Gjorgiev, Blaze ;
Cepin, Marko .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (01) :417-429