Invasive Weed Optimization for Combined Economic and Emission Dispatch Problems

Invasive Weed Optimization for Combined Economic and Emission Dispatch Problems

B.K. Panigrahi, Manjaree Pandit, Hari Mohan Dubey, Ashish Agarwal, Wei-Chiang Hong
Copyright: © 2014 |Pages: 18
DOI: 10.4018/ijaec.2014010101
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, Invasive Weed Optimization (IWO) algorithm is used to find the optimum solution of Combined Economic Emission Dispatch (CEED) problem. The main objective is to minimize the fuel cost as well as emission level, while satisfying the power demand and associative operational constraints. The bi-objective problem is made to a single objective function using the price penalty factor. Since, the minimize fuel cost and emission are contradictory to each other so to get the optimum compromise solution, weighing factor is used. IWO is applied on three different standard test cases i.e. 6 generators, 10 generators and 40 generators system. To measure the effectiveness and quality of solution, test results have been compared with other existing relevant approaches.
Article Preview
Top

Problem Formulation

Economic Load Dispatch

The main aim of ELD is to minimize the fuel cost while satisfying the equality and inequality constraints. The objective function considering the valve point effect is formulated as the sum of quadratic and sinusoidal function given by Equation (1).

ijaec.2014010101.m01
(1) Where, ‘F(PGi)’ is the total fuel cost, ‘ai’, ‘bi’, ‘ci’, ‘ei’ and ‘fi’ are the fuel cost coefficient of the ith generating unit, ‘PGimin’ is the minimum Power of the ith generating unit and ‘PGi’ is the Power generated by ith unit and ‘i’ is given by:i = 1, 2, 3… NWhere, N is the Number of Generating units. ‘ei’ and ‘fi’ are not used when valve point effect is neglected as shown in Equation (2).

ijaec.2014010101.m02
(2)

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing