A tabu search based hybrid optimization approach for a fuzzy modelled unit commitment problem

被引:31
作者
Victoire, TAA [1 ]
Jeyakumar, AE
机构
[1] Karunyan Inst Technol, Dept Elect & Elect Engn, Coimbatore 641114, Tamil Nadu, India
[2] Anna Univ, Dept Elect & Elect Engn, Coimbatore 641013, Tamil Nadu, India
关键词
unit commitment; fuzzy logic; tabu search; particle swarm optimization; sequential quadratic programming;
D O I
10.1016/j.epsr.2005.08.004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This article presents a solution model for the unit commitment problem (UCP) using fuzzy logic to address uncertainties in the problem. Hybrid tabu search (TS), particle swarm optimization (PSO) and sequential quadratic programming (SQP) technique (hybrid TS-PSO-SQP) is used to schedule the generating units based on the fuzzy logic decisions. The fitness function for the hybrid TS-PSO-SQP is formulated by combining the objective function of UCP and a penalty calculated from the fuzzy logic decisions. Fuzzy decisions are made based on the statistics of the load demand error and spinning reserve maintained at each hour. TS are used to solve the combinatorial sub-problem of the UCP. An improved random perturbation scheme and a simple method for generating initial feasible commitment schedule are proposed for the TS method. The non-linear programming sub-problem of the UCP is solved using the hybrid PSO-SQP technique. Simulation results on a practical Neyveli Thermal Power Station system (NTPS) in India and several example systems validate, the presented UCP model is reasonable by ensuring quality solution with sufficient level of spinning reserve throughout the scheduling horizon for secure operation of the system. (c) 2005 Elsevier B.V All rights reserved.
引用
收藏
页码:413 / 425
页数:13
相关论文
共 21 条
[1]   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
[2]   Extended neighborhood search algorithm for constrained unit commitment [J].
Bai, XM ;
Shahidehpour, SM .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 1997, 19 (05) :349-356
[3]   SHORT-TERM SCHEDULING OF THERMAL-ELECTRIC GENERATORS USING LAGRANGIAN-RELAXATION [J].
BARD, JF .
OPERATIONS RESEARCH, 1988, 36 (05) :756-766
[4]  
Boggs PT., 1995, ACTA NUMER, V4, P1, DOI DOI 10.1017/S0962492900002518
[5]   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
[6]  
ELHAWARY M, 1998, IEEE PRESS SERIES PO
[7]  
Glover F., 1990, ORSA Journal on Computing, V2, P4, DOI [10.1287/ijoc.1.3.190, 10.1287/ijoc.2.1.4]
[8]   A genetic algorithm solution to the unit commitment problem [J].
Kazarlis, SA ;
Bakirtzis, AG ;
Petridis, V .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1996, 11 (01) :83-90
[9]  
Kennedy J., 1995, 1995 IEEE International Conference on Neural Networks Proceedings (Cat. No.95CH35828), P1942, DOI 10.1109/ICNN.1995.488968
[10]   Unit commitment by tabu search [J].
Mantawy, AH ;
Abdel-Magid, YL ;
Selim, SZ .
IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 1998, 145 (01) :56-64