A primary unit commitment approach with a modification process

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.

[1]  H.K.M. Youssef,et al.  A two-stage genetic based technique for the unit commitment optimization problem , 2008, 2008 12th International Middle-East Power System Conference.

[2]  Tomonobu Senjyu,et al.  A unit commitment problem by using genetic algorithm based on unit characteristic classification , 2002, 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309).

[3]  F. N. Lee,et al.  Short-term thermal unit commitment-a new method , 1988 .

[4]  T. O. Ting,et al.  Methodological Priority List for Unit Commitment Problem , 2008, 2008 International Conference on Computer Science and Software Engineering.

[5]  H. H. Happ,et al.  Large Scale Hydro-Thermal Unit Commitment-Method and Results , 1971 .

[6]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[7]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

[8]  Eiichi Tanaka,et al.  An Evolutionary Programming Solution to the Unit Commitment Problem , 1997 .

[9]  Ahmed Yousuf Saber,et al.  Scalable unit commitment by memory-bounded ant colony optimization with A∗ local search , 2008 .

[10]  F. Aminifar,et al.  A Novel Straightforward Unit Commitment Method for Large-Scale Power Systems , 2007, IEEE Transactions on Power Systems.

[11]  Wei Xiong,et al.  An Improved Particle Swarm Optimization Algorithm for Unit Commitment , 2008, 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA).

[12]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[13]  S. Chusanapiputt,et al.  A solution to unit commitment problem using hybrid ant system/priority list method , 2008, 2008 IEEE 2nd International Power and Energy Conference.

[14]  P. G. Lowery,et al.  Generating Unit Commitment by Dynamic Programming , 1966 .

[15]  A. Merlin,et al.  A New Method for Unit Commitment at Electricite De France , 1983, IEEE Transactions on Power Apparatus and Systems.

[16]  K.-i. Tokoro,et al.  Soving unit commitment problem by combining of continuous relaxation method and genetic algorithm , 2008, 2008 SICE Annual Conference.

[17]  Chuan-Ping Cheng,et al.  Unit commitment by Lagrangian relaxation and genetic algorithms , 2000 .

[18]  Koichi Nara,et al.  Maintenance scheduling by using simulated annealing method (for power plants) , 1991 .

[19]  Russell C. Eberhart,et al.  Recent advances in particle swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[20]  Z. Gaing.  Discrete particle swarm optimization algorithm for unit commitment , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[21]  A. H. Mantawy,et al.  A simulated annealing algorithm for unit commitment , 1998 .

[22]  A. Bakirtzis,et al.  A solution to the unit-commitment problem using integer-coded genetic algorithm , 2004, IEEE Transactions on Power Systems.

[23]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[24]  P. Sriyanyong,et al.  Unit commitment using particle swarm optimization combined with Lagrange relaxation , 2005, IEEE Power Engineering Society General Meeting, 2005.

[25]  T.O. Ting,et al.  A novel approach for unit commitment problem via an effective hybrid particle swarm optimization , 2006, IEEE Transactions on Power Systems.

[26]  R. H. Kerr,et al.  Unit commitment , 1966, Mathematical Programming for Power Systems Operation with Applications in Python.

[27]  Tomonobu Senjyu,et al.  A fast technique for unit commitment problem by extended priority list , 2003 .

[28]  Russell C. Eberhart,et al.  Particle swarm with extended memory for multiobjective optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[29]  A. Ebenezer Jeyakumar,et al.  Hybrid PSO–SQP for economic dispatch with valve-point effect , 2004 .

[30]  W. Ongsakul,et al.  Unit commitment by enhanced adaptive Lagrangian relaxation , 2004, IEEE Transactions on Power Systems.

[31]  Sohrab Khanmohammadi,et al.  A new three-stage method for solving unit commitment problem , 2010 .

[32]  I. Erlich,et al.  A new approach for solving the unit commitment problem by adaptive particle swarm optimization , 2008, 2008 IEEE Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century.

[33]  Koichi Nara,et al.  Optimal long-term unit commitment in large scale systems including fuel constrained thermal and pumped-storage hydro , 1989 .