Firefly algorithm with multiple workers for the power system unit commitment problem

Firefly algorithm with multiple workers for the power system unit commitment problem

This paper proposes an improved firefly (FF) algorithm with multiple workers for solving the unit commitment (UC) problem of power systems. The UC problem is a combinatorial optimization problem that can be posed as minimizing a quadratic objective function under system and unit constraints. Nowadays, highly developed computer systems are available in plenty, and proper utilization of these systems will reduce the time and complexity of combinatorial optimization problems with large numbers of generating units. Here, multiple workers are assigned to solve a UC problem as well as the subproblem, namely economic dispatch (ED) in distributed memory models. The proposed method incorporates a group search in a FF algorithm and thereby a global search is attained through the local search performed by the individual workers, which fine tune the search space in achieving the final solution. The execution time taken by the processor and the solution obtained with respect to the number of processors in a cluster are thoroughly discussed for different test systems. The methodology is validated on a 100 unit system, an IEEE 118 bus system, and a practical Taiwan 38 bus power system and the results are compared with the available literature.

___

  • [1] Frangioni A, Gentile C, Lacalandra F. Sequential Lagrangian-MILP approaches for unit commitment problems. Int J Elec Power 2011; 33: 585-593.
  • [2] Siu TK, Nash GA, Shawwash ZK. A practical hydro, dynamic unit commitment and loading model. IEEE T Power Syst 2001; 16: 301-306.
  • [3] Marcovecchio MG, Novais AQ, Grossmann IE. Deterministic optimization of the thermal unit commitment problem: a branch and cut search. Comput Chem Eng 2014; 67: 53-68.
  • [4] Cheng CP, Liu CW, Liu CC. Unit commitment by Lagrangian relaxation and genetic algorithms. IEEE T Power Syst 2000; 15: 707-714.
  • [5] Cohen AI, Yoshimura M. A branch-and-bound algorithm for unit commitment. IEEE T Power Ap Syst 1983; PAS-102: 444-451.
  • [6] Mantawy AH, Abdel-Magid YL, Selim SZ. Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem. Power Systems, IEEE T Power Syst 1999; 14: 829-836.
  • [7] Dudek G. Genetic algorithm with binary representation of generating unit start-up and shut-down times for the unit commitment problem. Expert Syst Appl 2013; 40: 6080-6086.
  • [8] Saber AY, Senjyu T, Miyagi T, Urasaki N, Funabashi T. Fuzzy unit commitment scheduling using absolutely stochastic simulated annealing. IEEE T Power Syst 2006; 21: 955-964.
  • [9] Yuan X, Nie H, Su A, Wang L, Yuan Y. An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 2009; 36: 8049-8055.
  • [10] Duo H, Sasaki H, Nagata T, Fujita H. Solution for unit commitment using Lagrangian relaxation combined with evolutionary programming. Electr Pow Syst Res 1999; 51: 71-77.
  • [11] Jahromi MZ, Mehdi M, Bioki H. Solution to the unit commitment problem using an artificial neural network. Turk J Electr Eng Co 2013; 21: 198-212.
  • [12] Yang XS. Firefly algorithms for multimodal optimization. Lect Notes Comput Sc 2009; 5792: 169-178.
  • [13] Mohammadi S, Mozafari B, Soleymani S. Optimal operation management of microgrids using the point estimate method and firefly algorithm while considering uncertainty. Turk J Electr Eng & Comp Sci 2014; 22: 735-753.
  • [14] Bosilca G, Bouteiller A, Danalis A, Herault T, Lemarinier P, Dongarra J. DAGuE: A generic distributed DAG engine for high performance computing. Parallel Comput 2012; 38: 37-51.
  • [15] Chakroun I, Melab N, Mezmaz M, Tuyttens D. Combining multi-core and GPU computing for solving combinatorial optimization problems. J Parallel Distr Com 2013; 73: 1563-1577.
  • [16] Tuominen J, Naghdy F, Tabrizi N. Generation of a parallel computing platform for a distributed manipulation environment. Control Eng Pract 1993; 1: 873-880.
  • [17] Christopher Columbus C, Simon SP. Profit based unit commitment: A parallel ABC approach using a workstation cluster. Comput Electr Eng 2012; 38: 724-745.
  • [18] Koodalsamy C, Simon SP. Fuzzified artificial bee colony algorithm for nonsmooth and nonconvex multiobjective economic dispatch problem. Turk J Electr Eng & Comp Sci 2013; 21: 1995-2014.
  • [19] Slimani L, Bouktir T. Economic power dispatch of power systems with pollution control using artificial bee colony optimization. Turk J Electr Eng & Comp Sci 2013; 21: 1515-1527.
  • [20] Carri´on M, Arroyo JM. A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE T Power Syst 2006; 21: 1371-1378.
  • [21] Chandrasekaran K, Simon SP. Optimal deviation based firefly algorithm tuned fuzzy design for multi-objective UCP. IEEE T Power Syst 2013; 28: 460-471.