.png){kind=icon}
Return
Solving dynamic economic dispatch problem with security constraints using bacterial foraging PSO-DE algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2012.01.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a heuristic optimization methodology, namely, Bacterial foraging PSO-DE (BPSO-DE) algorithm by integrating Bacterial Foraging Optimization Algorithm (BFOA), Particle Swarm Optimization (PSO) and Differential Evolution (DE) for solving non-smooth non-convex Dynamic Economic Dispatch (DED) problem. The DED problem exhibits non-smooth, non-convex nature due to valve-point loading effects, ramp rate limits, spinning reserve capacity, prohibited operating zones and security constraints. The proposed hybrid method eliminates the problem of stagnation of solution with the incorporated PSO and DE operators in original bacterial foraging algorithm. It achieves global cost by selecting the bacterium with good foraging strategies. The bacteria with good foraging strategies are obtained in the updating process of every chemo-tactic step by the PSO operator. The DE operator fine tunes the solution obtained through bacterial foraging and PSO operator. A 3- and 7-unit systems for static economic dispatch, a 26-bus, 6-generator test system and an IEEE 39-bus, 10-unit New England test systems are considered to show the effectiveness of the proposed method over other methods reported in the literature. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Bacterial foraging optimization algorithm
Particle swarm optimization
Differential evolution
Dynamic economic dispatch
Non-smooth fuel cost function
Journal
I
IF:
5
Papers:
1.1W
Citations:
3.1W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
View more