By Topic

Mixed integer conic programming approach for optimal capacitor placement in radial distribution networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. A. Abou Jawdeh ; Departement of Electrical & Computer Engineering, American University of Beirut, Lebanon ; R. A. Jabr

This paper introduces a mixed-integer conic programming approach to solve the optimal capacitor placement problem in radial distribution networks. The problem is formulated to allow optimally placing fixed and switched-type capacitors; its objective is to minimize the peak power losses, the energy losses, and the costs associated with the required capacitor banks while satisfying the physical and technical constraints on the network. The proposed solution is based on the conic quadratic format of the power flow equations. As a result of using the conic format, the relaxation becomes convex and therefore a global solution to the capacitor planning problem can be obtained using a branch-and-cut algorithm. The method is tested on two radial test systems with 34 and 83 nodes having up to 12 load levels and is validated by comparison with previously published solution results.

Published in:

2012 47th International Universities Power Engineering Conference (UPEC)

Date of Conference:

4-7 Sept. 2012