Large-scale var optimization and planning by tabu search

Citation data:

Electric Power Systems Research, ISSN: 0378-7796, Vol: 39, Issue: 3, Page: 195-204

Publication Year:
1996
Captures 3
Readers 3
Citations 39
Citation Indexes 39
Repository URL:
http://stars.library.ucf.edu/facultybib/2744; http://stars.library.ucf.edu/facultybib1990/1624
DOI:
10.1016/s0378-7796(96)01118-2
Author(s):
Deqiang Gan; Qu Zhihua; Hongzhi Cai
Publisher(s):
Elsevier BV
Tags:
Energy; Engineering; power systems; var planning; combinatorial optimization; tabu search; POWER-SYSTEMS; SECURITY; Engineering; Electrical & Electronic
article description
A generalization on the tabu search method, recently developed for combinatorial optimization problems, is described in this paper. The novel version of the tabu search method can be used to solve a larger class of combinatorial optimization problems. Application of this method to var optimization and planning, which is formulated as a nonlinear large-scale mixed integer programming problem with non-differentiable objective function, is demonstrated. Judicious engineering judgment which is essential for a successful application of the proposed tabu search is developed. Simulation results of a real-world power system are included. A simulation comparison is done between the proposed method and the simulated annealing method, which is currently one of the most popular method for combinatorial optimization problem.