Abstract
Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
