Large-Scale Var Optimization And Planning By Tabu Search

    Authors

    D. Q. Gan; Z. H. Qu;H. Z. Cai

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Electr. Power Syst. Res.

    Keywords

    power systems; var planning; combinatorial optimization; tabu search; POWER-SYSTEMS; SECURITY; Engineering, Electrical & Electronic

    Abstract

    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. (C) 1996 Elsevier Science S.A.

    Journal Title

    Electric Power Systems Research

    Volume

    39

    Issue/Number

    3

    Publication Date

    1-1-1996

    Document Type

    Article

    Language

    English

    First Page

    195

    Last Page

    204

    WOS Identifier

    WOS:A1996WW34900005

    ISSN

    0378-7796

    Share

    COinS