Decomposition method for coordinated planning of distributed generation and distribution network

Decomposition method for coordinated planning of distributed generation and distribution network

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Generation, Transmission & Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

With recent development on renewable energy and distributed generation (DG), distribution system expansion planning (DSEP) problem is facing more challenges. This study proposed a multistage coordinate planning model to minimise the present value of construction cost and operating cost over the planning horizon. Installation of DGs, static var generators, and expansion of distribution network were considered simultaneously. The proposed model is a large-scale mixed-integer second-order conic programming (MISOCP) problem containing large amounts of constraints and variables. The MISOCP can be decomposed into: (i) the master problem which determines the construction plan, (ii) and many subproblems which optimise the operating states under different network configurations and different load levels. A modified Benders decomposition method was applied to generate valid cuts from subproblems with integer variables. Results of the proposed decomposition method were compared with those obtained by commercial software on a 24-node distribution system. Numerical experiments showed that the proposed method can solve the integrated DSEP problem efficiently.

Related content

This is a required field
Please enter a valid email address