Deterministically guided PSO for dynamic dispatch considering valve-point effect

被引:104
作者
Victoire, TAA [1 ]
Jeyakumar, AE
机构
[1] Karunya Inst Technol, Dept Elect & Elect Engn, Coimbatore 641114, Tamil Nadu, India
[2] Anna Univ, Dept Elect & Elect Engn, Coimbatore 641013, Tamil Nadu, India
关键词
particle swarm optimization; sequential quadratic programming; dynamic economic dispatch;
D O I
10.1016/j.epsr.2004.07.005
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a deterministically guided particle swarm optimization (DGPSO) algorithm to solve the dynamic economic dispatch problem (DEDP) of generating units considering the valve-point effects. The cost function of the generating units exhibits the non-convex characteristics, as the valve-point effects are modeled and imposed as rectified sinusoid components in the cost function. The DGPSO method is a two-phase optimizer: in the first phase the PSO technique will explore the solution space freely. In the second phase, SQP (sequential quadratic programming) will be called only when there is an improvement of solution (a feasible solution) in the PSO run. Thus, SQP (deterministically) guides the PSO algorithm for better performance in the complex solution space. To validate the feasibility of the DGPSO method a 10-unit systems considered and studied under three different cases. The effectiveness of the presented method over EP (evolutionary programming) and EP-SQP methods is shown in general. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:313 / 322
页数:10
相关论文
共 18 条
[1]  
Angline P, 1998, EVOLUTIONARY OPTIMIZ, V1447, P601, DOI DOI 10.1007/BFB0040753
[2]   A hybrid EP and SQP for dynamic economic dispatch with nonsmooth fuel cost function [J].
Attaviriyanupap, P ;
Kita, H ;
Tanaka, E ;
Hasegawa, J .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2002, 17 (02) :411-416
[3]  
Boggs P.T., 2008, ACTA NUMER, V4, P1, DOI DOI 10.1017/S0962492900002518
[4]   Unit commitment by Lagrangian relaxation and genetic algorithms [J].
Cheng, CP ;
Liu, CW ;
Liu, GC .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (02) :707-714
[5]   A REVIEW OF RECENT ADVANCES IN ECONOMIC-DISPATCH [J].
CHOWDHURY, BH ;
RAHMAN, S .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1990, 5 (04) :1248-1259
[6]   Particle swarm optimization to solving the economic dispatch considering the generator constraints [J].
Gaing, ZL .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (03) :1187-1195
[7]   FAST AND EFFICIENT GRADIENT PROJECTION ALGORITHM FOR DYNAMIC GENERATION DISPATCHING [J].
GRANELLI, GP ;
MARANNINO, P ;
MONTAGNA, M ;
SILVESTRI, A .
IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION, 1989, 136 (05) :295-302
[8]   DYNAMIC ECONOMIC-DISPATCH FOR LARGE-SCALE POWER-SYSTEMS - A LAGRANGIAN-RELAXATION APPROACH [J].
HINDI, KS ;
GHANI, MRA .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 1991, 13 (01) :51-56
[9]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[10]   Hybrid genetic approaches to ramping rate constrained dynamic economic dispatch [J].
Li, F ;
Morgan, R ;
Williams, D .
ELECTRIC POWER SYSTEMS RESEARCH, 1997, 43 (02) :97-103