Modified GA and data envelopment analysis for multistage distribution network expansion planning under uncertainty

An approach is proposed to solve multistage distribution network expansion planning problems considering future uncertainties, guiding the planner from production of expansion plans, evaluation of the plans under various future uncertain scenarios, to the selection of the best strategy. A new balanced genetic algorithm (BGA) is introduced that improves the intensification of the solution search procedure by trading-off diversification ability. This facilitates searching for the optimal solution, but also the efficient production of suboptimal solutions for the planner to take into consideration. The features of the BGA allow a multistage planning problem to be solved more efficiently; the BGA can consider a set of expansion plans in an early planning stage in a single run and produce planning strategies required to solve network problems in a later stage along the planning horizon. The overall performance of each plan under different uncertain scenarios is evaluated using a modified data envelopment analysis to assist decisions on which solution to adopt. The approach is applied to a multistage “greenfield” distribution network expansion problem considering scenarios for the location of future loads. The results clearly show the advantages of the approach over more conventional methods.

[1]  M. J. Rider,et al.  A Metaheuristic to Solve the Transmission Expansion Planning , 2007, IEEE Transactions on Power Systems.

[2]  Antonio J. Conejo,et al.  Transmission expansion planning: a mixed-integer LP approach , 2003 .

[3]  S. Binato,et al.  Transmission network expansion planning under a Tabu Search approach , 2001 .

[4]  Felix F. Wu,et al.  Transmission Expansion Planning From Past to Future , 2006, 2006 IEEE PES Power Systems Conference and Exposition.

[5]  X. Feng,et al.  An application of genetic algorithms to integrated system expansion optimization , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[6]  H.K.M. Youssef,et al.  Dynamic transmission planning using a constrained genetic algorithm , 2001 .

[7]  Paul R. Drake,et al.  System network planning expansion using mathematical programming, genetic algorithms and tabu search , 2008 .

[8]  Ramesh C. Bansal,et al.  International Journal of Emerging Electric Power Systems Optimization Methods for Electric Power Systems : An Overview , 2011 .

[9]  Fabrizio Giulio Luca Pilo,et al.  Probabilistic Optimization of MV Distribution Network in Presence of Distributed Generation , 2002 .

[10]  A. U.S.,et al.  Measuring the efficiency of decision making units , 2003 .

[11]  Fabrizio Giulio Luca Pilo,et al.  Distributed generation siting and sizing under uncertainty , 2001, 2001 IEEE Porto Power Tech Proceedings (Cat. No.01EX502).

[12]  M. V. F. Pereira,et al.  A New Benders Decomposition Approach to Solve Power Transmission Network Design Problems , 2001, IEEE Power Engineering Review.

[13]  M.J. Rider,et al.  Transmission Network Expansion Planning Considering Uncertainty in Demand , 2006, IEEE Transactions on Power Systems.

[14]  A. El-Keib,et al.  A fuzzy branch and bound-based transmission system expansion planning for the highest satisfaction level of the decision maker , 2005, IEEE Transactions on Power Systems.

[15]  Hong Fan,et al.  Transmission Network Expansion Planning under Improved Genetic Algorithm , 2011 .

[16]  Milan S. Ćalović,et al.  A new decomposition based method for optimal expansion planning of large transmission networks , 1991 .

[17]  Z.M. Al-Hamouz,et al.  Transmission expansion planning using nonlinear programming , 2002, IEEE/PES Transmission and Distribution Conference and Exhibition.

[18]  M. Pereira,et al.  A Mixed Integer Disjunctive Model for Transmission Network Expansion , 2001, IEEE Power Engineering Review.

[19]  Hu Rong,et al.  Modified Interval DEA Method for Economic Evaluation of Distribution Network , 2007, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

[20]  Ruben Romero,et al.  Transmission system expansion planning by simulated annealing , 1995 .

[21]  D. J. Hill,et al.  A New Strategy for Transmission Expansion in Competitive Electricity Markets , 2002, IEEE Power Engineering Review.

[22]  Haozhong Cheng,et al.  New discrete method for particle swarm optimization and its application in transmission network expansion planning , 2007 .

[23]  Jose Roberto Sanches Mantovani,et al.  Branch and bound algorithm for transmission system expansion planning using a transportation model , 2000 .

[24]  A.V. Garcia,et al.  Branch and Bound Algorithm for Transmission Network Expansion Planning Using DC Model , 2007, 2007 IEEE Lausanne Power Tech.

[25]  Luís Ferreira,et al.  Distribution network expansion planning under uncertainty: a hedging algorithm in an evolutionary approach , 2000 .

[26]  G. Latorre,et al.  Classification of publications and models on transmission expansion planning , 2003 .

[27]  Jose Roberto Sanches Mantovani,et al.  Efficient linear programming algorithm for the transmission network expansion planning problem , 2003 .

[28]  R. Romero,et al.  An Efficient Codification to Solve Distribution Network Reconfiguration for Loss Reduction Problem , 2008, IEEE Transactions on Power Systems.

[29]  Vladimiro Miranda,et al.  Probabilistic choice vs. risk analysis-conflicts and synthesis in power system planning , 1997 .

[30]  R.A. Gallego,et al.  Multistage and coordinated planning of the expansion of transmission systems , 2004, IEEE Transactions on Power Systems.

[31]  R.H.C. Takahashi,et al.  Electric Distribution Network Expansion Under Load-Evolution Uncertainty Using an Immune System Inspired Algorithm , 2007, IEEE Transactions on Power Systems.

[32]  P. Andersen,et al.  A procedure for ranking efficient units in data envelopment analysis , 1993 .

[33]  Louis Wehenkel,et al.  A probabilistic approach to power system network planning under uncertainties , 2003, 2003 IEEE Bologna Power Tech Conference Proceedings,.