Unit commitment using time-ahead priority list and heterogeneous comprehensive learning PSO

In power systems, Unit commitment problem (UCP) is mixed-integer nonlinear combinatorial optimization problem that gives the schedule of power generating units (binary on/off (0/1) and continuous power variables) while satisfying the system as well as unit constraints with the minimum production cost. In this paper, we propose a new hybrid method combining priority list (PL) and particle swarm optimization (PSO) to tackle the UCP. Firstly, we develop a new priority list method called time-ahead priority list (TPL) to determine binary on/off schedule of power generating units. Then a variant of PSO called heterogeneous comprehensive learning particle swarm optimization (HCLPSO) is applied to determine the amount of power to be generated with the minimum production cost. In addition, epsilon constraint handling method is implemented to handle the constraints of UCP. The performance of the proposed hybrid model, referred to as TPL_HCLPSO, is evaluated on the well-known benchmark power systems and compared with recent deterministic, stochastic and mainly with the hybrid approaches. The simulation results indicate that the proposed hybrid model achieves a remarkable cost reduction in power production and provides the lowest minimum production cost compared to the recent UCP approaches.

[1]  Dilip Datta,et al.  A binary-real-coded differential evolution for unit commitment problem , 2012 .

[2]  C.D. Vournas,et al.  Unit Commitment by an Enhanced Simulated Annealing Algorithm , 2006, 2006 IEEE PES Power Systems Conference and Exposition.

[3]  Jong-Bae Park,et al.  A New Quantum-Inspired Binary PSO: Application to Unit Commitment Problems for Power Systems , 2010, IEEE Transactions on Power Systems.

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

[5]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[6]  Costas Vournas,et al.  Unit commitment by an enhanced simulated annealing algorithm , 2006 .

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

[8]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[9]  Provas Kumar Roy,et al.  Solution of unit commitment problem using gravitational search algorithm , 2013 .

[10]  Yanbin Yuan,et al.  Unit commitment problem using enhanced particle swarm optimization algorithm , 2011, Soft Comput..

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

[12]  N.P. Padhy,et al.  Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.

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

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

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

[16]  B. Vahidi,et al.  A Solution to the Unit Commitment Problem Using Imperialistic Competition Algorithm , 2012, IEEE Transactions on Power Systems.

[17]  Po-Hung Chen,et al.  Two-Level Hierarchical Approach to Unit Commitment Using Expert System and Elite PSO , 2012, IEEE Transactions on Power Systems.

[18]  M. Piekutowski,et al.  A Linear Programming Method for Unit Commitment Incorporating Generator Configurations, Reserve and Plow Constraints , 1985, IEEE Transactions on Power Apparatus and Systems.

[19]  Bijaya K. Panigrahi,et al.  Binary Grey Wolf Optimizer for large scale unit commitment problem , 2018, Swarm Evol. Comput..

[20]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[21]  Ponnuthurai N. Suganthan,et al.  Unit commitment - a survey and comparison of conventional and nature inspired algorithms , 2014, Int. J. Bio Inspired Comput..

[22]  Hatim S. Madraswala,et al.  Genetic algorithm solution to unit commitment problem , 2016, 2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES).

[23]  Kit Po Wong,et al.  An Advanced Quantum-Inspired Evolutionary Algorithm for Unit Commitment , 2011, IEEE Transactions on Power Systems.

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

[25]  Ran Quan,et al.  An improved priority list and neighborhood search method for unit commitment , 2015 .

[26]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[27]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[28]  Hao Tian,et al.  A new approach for unit commitment problem via binary gravitational search algorithm , 2014, Appl. Soft Comput..