Integration of Parallel EPSO and Variable TS for Unit Commitment with Nonsmooth Fuel Cost Functions

In this paper, a new hybrid meta-heuristic method is proposed to solve a unit commitment (UC) problem with nonsmooth fuel cost functions effectively. The proposed method focuses on global optimization in a sense that a generation company need carry out the cost reduction under competitive environment. The proposed method integrates parallel Evolutionary Particle Swarm Optimization (PEPSO) with variable neighborhood tabu search (VTS). The objective of UC is to minimize operation-cost while satisfying the constraints. The unit commitment problem is hard to solve due to the complexity in determining on-off conditions and output of generators. The problem formulation may be written as a nonlinear mixed- integer problem. In addition, large steam turbine generators with nonsmooth fuel cost functions are considered from a realistic standpoint. This paper proposes a new hybrid meta-heuristic method that combines VTS with PEPSO and evaluates solutions with two layers. Layer 1 determines the on-off conditions of generators with VTS while Layer 2 evaluates output of generators with PEPSO. TS is very effective for solving a combinatorial optimization problem efficiently. EPSO has better performance in dealing with an optimization problem of continuous variables. However, both methods still have room to improve solution quality and reduce computational time. Therefore, TS is improved to include the technique of the priority list limit and variable neighborhood search and EPSO is enhanced by the parallel scheme with the island model. The effectiveness of the proposed method is successfully applied to sample systems.

[1]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[2]  F. Albuyeh,et al.  Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit Commitments , 1981, IEEE Transactions on Power Apparatus and Systems.

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  Francisco D. Galiana,et al.  Unit commitment by simulated annealing , 1990 .

[5]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

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

[7]  H. Mori,et al.  Embedding the priority list into tabu search for unit commitment , 2001, 2001 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.01CH37194).

[8]  Vladimiro Miranda,et al.  EPSO - best-of-two-worlds meta-heuristic applied to power system problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[10]  Hiroyuki Mori,et al.  Application of two-layered tabu search to optimal allocation of UPFC for maximizing transmission capability , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[11]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

[12]  L. Coelho,et al.  Combining of chaotic differential evolution and quadratic programming for economic dispatch optimization with valve-point effect , 2006, IEEE Transactions on Power Systems.

[13]  M. I. Wood,et al.  Opportunities for advanced sensors for condition monitoring of gas turbines , 1996 .

[14]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[15]  Jorge Pinho de Sousa,et al.  Using GRASP to Solve the Unit Commitment Problem , 2003, Ann. Oper. Res..

[16]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..