A primary unit commitment approach with a modification process

被引:13
作者
Amiri, Mohsen [1 ]
Khanmohammadi, Sohrab [2 ]
机构
[1] Islamic Azad Univ, Abhar branch, Dept Engn, Elect Engn Div, Abhar, Zanjan, Iran
[2] Univ Tabriz, Dept Elect & Comp Engn, Div Automat Control, Tabriz, Iran
关键词
Unit commitment problem; Primary UC; Economic dispatch; Modification process; OPTIMIZATION; ALGORITHM;
D O I
10.1016/j.asoc.2012.10.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper introduces an approach to one of the most important problems in electrical power system called the Unit Commitment (UC). The proposed method PUC-MP which stands for the primary unit commitment-modification process, addresses this problem firstly by using a simple and new priority for operating the generating units in each hour, and then, using a modification process which enhances the solution quality with lower cost. The PUC-MP takes advantage of both deterministic and stochastic algorithms in its structure to solve the discrete-variable part of the UC problem for choosing a suitable combination of units in each hour, and also, continuous-variable part of it which is dispatching the operating units' output power to the power network load economically. The latter part which is called economic dispatch (ED) has been solved using an intelligent algorithm which in turn has been customized by two new ideas to increase its efficiency. Simulation results show that this new approach even without using its modification process can be considered as an effective approach which surpasses some other popular and recently reported methods in producing near-optimal and robust solutions. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1007 / 1015
页数:9
相关论文
共 35 条
[11]   Particle swarm with extended memory for multiobjective optimization [J].
Hu, XH ;
Eberhart, RC ;
Shi, YH .
PROCEEDINGS OF THE 2003 IEEE SWARM INTELLIGENCE SYMPOSIUM (SIS 03), 2003, :193-197
[12]  
Hu XH, 2004, IEEE C EVOL COMPUTAT, P90
[13]   An evolutionary programming solution to the unit commitment problem [J].
Juste, KA ;
Kita, H ;
Tanaka, E ;
Hasegawa, J .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1999, 14 (04) :1452-1459
[14]   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
[15]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[16]   UNIT COMMITMENT [J].
KERR, RH ;
SCHEIDT, JL ;
FONTANA, AJ ;
WILEY, JK .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1966, PA85 (05) :417-&
[17]   A new three-stage method for solving unit commitment problem [J].
Khanmohammadi, S. ;
Amiri, M. ;
Haque, M. Tarafdar .
ENERGY, 2010, 35 (07) :3072-3080
[18]   SHORT-TERM THERMAL UNIT COMMITMENT - A NEW METHOD [J].
LEE, FN .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1988, 3 (02) :421-428
[19]  
Lowery G., 1996, IEEE T POWERAPPAR SY, V85, P422
[20]   A Simulated Annealing Algorithm for unit commitment [J].
Mantawy, AH ;
Abdel-Magid, YL ;
Selim, SZ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1998, 13 (01) :197-204