Abstract
This paper proposes Second-Order Cone Programming (SOCP) model for Active Distribution Network Expansion Planning (ADNEP). The objective minimizes total investment and operation cost. Distributed Generation (DG) curtailment and load curtailment are used as the active management schemes to decrease the future operation risks of the planning. The expansion model allows alternatives to be considered for new wiring, new substation, substation expansion and DG installation. The Distribution Network Expansion Planning (DNEP) problem is a Mixed Integer Nonlinear Programming (MINLP) problem, which is NP-hard. Active management and uncertainties especially with the DG integration make the DNEP problem much complex. In order to find the polynomial time computable model, this paper converts the DNEP problem to a SOCP model through distflow equations and constraints relaxation. Scenario analysis is picked for the future uncertainties. CVX and GUROBI solver are used to solve the SOCP model, and a 50 nodes application example is used to for the verification.
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.
