A novel decomposition procedure for distribution network planning

Abstract

This paper presents a new optimization procedure for distribution network planning based on dynamic programming, local network concept and mixed integer model. By introducing local network concept and principles of dynamic programming the real-size network planning problem is divided into sequences of sub problems with significantly reduced dimensions, enabling application of complex mixed integer programming model in each sub problem. The results obtained on several real-life distribution networks have shown that suggested procedure enables more efficient use of existing capacities and reduction of future expansion costs.