Solving the Economic Dispatch Problem by Using Tabu Search Algorithm

This paper presents an algorithm for solving Security Constrained Economic Dispatch (SCED) problem through the application of Tabu Search (TS). The SCED problem is formulated with base case and contingency case line flow constraints, which are important for practical implementation. One representative system namely IEEE-57 bus system is taken for investigations. The SCED results obtained using TS are compared with those obtained using Genetic Algorithm (GA), quasi-Newton method (QN), and Mat-Power.

[1]  K. L. Lo,et al.  Genetic algorithm for optimal reactive power dispatch , 1998, Proceedings of EMPD '98. 1998 International Conference on Energy Management and Power Delivery (Cat. No.98EX137).

[2]  A. Breipohl,et al.  Reserve constrained economic dispatch with prohibited operating zones , 1993 .

[3]  Guangleng Xiong,et al.  Robust decision and optimisation for collaborative parameter design , 2009, Int. J. Comput. Appl. Technol..

[4]  Saïd Hanafi,et al.  On the Convergence of Tabu Search , 2001, J. Heuristics.

[5]  Michel Minoux,et al.  Programmation Mathématique. Théorie et Algorithmes , 2008 .

[6]  Abdelkader Chaker,et al.  HYBRID APPROACH TO THE ECONOMIC DISPATCH PROBLEM USING A GENETIC AND A QUASI-NEWTON ALGORITHMS , 2008 .

[7]  Chao-Hsien Chu,et al.  A heuristic genetic algorithm for grouping manufacturing cells , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..