Title

Large-scale var optimization and planning by tabu search

Keywords

Combinatorial optimization; Power systems; Tabu search; Var planning

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. © 1996 Elsevier Science S.A.

Publication Date

12-1-1996

Publication Title

Electric Power Systems Research

Volume

39

Issue

3

Number of Pages

195-204

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0378-7796(96)01118-2

Socpus ID

0030361398 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0030361398

This document is currently not available here.

Share

COinS