An Efficient Multi-objective Meta-heuristic Method for Distribution Network Expansion Planning

This paper proposes a new method for distribution network expansion planning. The proposed method is based on SPEA2 (strength Pareto evolutionary algorithm 2) of multi-objective meta-heuristics. As power systems are deregulated, the power market becomes more competitive. Hence, the cost minimization has been recognized as one of the most important factors in distribution systems. Apart from the cost minimization, the network loss minimization and the power quality are also important. This paper focuses on distribution network expansion planning under new environment with distribution generations (DG). It needs to deal with multi-objective optimization. In this paper, SPEA2 that is effective for evaluating the Pareto solution set is used to solve the multi-objective network expansion planning problem. It has advantage in finding out a set of Pareto solutions with the strategies of using both the archives and the evaluated solution set. The proposed method is successfully applied to the 69-node distribution system with DG units.

[1]  J. T. Boardman,et al.  A Branch and Bound Formulation to an Electricity Distribution Planning Problem , 1985, IEEE Power Engineering Review.

[2]  H. Chiang.  A decoupled load flow method for distribution power networks: algorithms, analysis and convergence study , 1991 .

[3]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[4]  Swapan Kumar Goswami,et al.  A new power distribution system planning through reliability evaluation technique , 2000 .

[5]  Tomoyuki Hiroyasu,et al.  SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 , 2004, PPSN.

[6]  Vladimiro Miranda,et al.  Genetic algorithms in optimal multistage distribution network planning , 1994 .

[7]  K. Nara,et al.  Multi-year and multi-state distribution systems expansion planning by multi-stage branch exchange , 1997 .

[8]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[9]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[10]  Hiroki Mori,et al.  Two-layered neighborhood tabu search for multi-objective distribution network expansion planning , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[11]  Simon French,et al.  Multi-Objective Decision Analysis with Engineering and Business Applications , 1983 .

[12]  K. Aoki,et al.  New approximate optimization method for distribution system planning , 1990 .

[13]  H. Mori,et al.  An improved tabu search approach to distribution network expansion planning under new environment , 2004, 2004 International Conference on Power System Technology, 2004. PowerCon 2004..

[14]  Roy Billinton,et al.  Minimum Cost Analysis of Feeder Routing in Distribution System Planning , 1996, IEEE Power Engineering Review.

[15]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[16]  Kalyanmoy Deb,et al.  Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence , 2001, EMO.

[17]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[18]  Koichi Nara,et al.  Algorithm for expansion planning in distribution systems taking faults into consideration , 1994 .

[19]  Vladimiro Miranda,et al.  A General Methodology For Distribution Planning Under Uncertainty, Including Genetic Algorithms And Fuzzy Models In A Multi-Criteria Environment , 1995 .

[20]  J. BOARDMAN,et al.  A Branch And Bound Formulation To An Electricity Distribution Planning Problem , 1985, IEEE Transactions on Power Apparatus and Systems.