We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Local Relaxation Approach for the Siting of Electrical Substations.
- Authors
Murray, Walter; Shanbhag, Uday V.
- Abstract
The siting and sizing of electrical substations on a rectangular electrical grid can be formulated as an integer programming problem with a quadratic objective and linear constraints. We propose a novel approach that is based on solving a sequence of local relaxations of the problem for a given number of substations. Two methods are discussed for determining a new location from the solution of the relaxed problem. Each leads to a sequence of strictly improving feasible integer solutions. The number of substations is then modified to seek a further reduction in cost. Lower bounds for the solution are also provided by solving a sequence of mixed-integer linear programs. Results are provided for a variety of uniform and Gaussian load distributions as well as some real examples from an electric utility. The results of GAMS/DICOPT, GAMS/SBB, GAMS/BARON and CPLEX applied to these problems are also reported. Our algorithm shows slow growth in computational effort with the number of integer variables.
- Subjects
ELECTRIC substations; ELECTRIC utilities; INTEGER programming; DYNAMIC programming; LINEAR programming; COMPUTER programming; MATHEMATICAL programming; MATHEMATICS; ALGORITHMS
- Publication
Computational Optimization & Applications, 2005, Vol 32, Issue 3, p7
- ISSN
0926-6003
- Publication type
Article
- DOI
10.1007/s10589-005-5957-4