On spanning-tree recombination in evolutionary large-scale network problems - application to electrical distribution planning

We report the key algorithms involved in the recombination-based evolutionary software developed for planning electrical distribution networks. We focus on the dimensionality problem of large-scale networks and on the specificities of its search space. We report the difficulties in handling topology constraints and present both the geno-type and the operators to overcome such difficulties. The operators are designed to process meaningful topological information as geno-type substructures and turn the radiality and connectivity into genetic transmissible properties. First, a theoretical example is presented to illustrate important differences between other common approaches and the approach taken. Then, a real electrical industry application is presented to illustrate the ability of the approach to handle large-scale distribution-network problems.

[1]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[2]  M. P. Papadopoulos,et al.  New dynamic, branch exchange method for optimal distribution system planning , 1997 .

[3]  G. Thompson,et al.  A Branch and Bound Model for Choosing Optimal Substation Locations , 1981, IEEE Transactions on Power Apparatus and Systems.

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

[5]  Luís Ferreira,et al.  Optimal distribution network expansion planning under uncertainty by evolutionary decision convergence , 1998 .

[6]  K. Aoki,et al.  Multi-year expansion planning for distribution systems , 1991 .

[7]  S. S. Venkata,et al.  APR: a geographic information system based primary router for underground residential distribution design , 1994, Proceedings of IEEE/PES Transmission and Distribution Conference.

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[10]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[11]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[12]  Alice E. Smith,et al.  Local search genetic algorithm for optimal design of reliable networks , 1997, IEEE Trans. Evol. Comput..

[13]  M. El-Kady Computer-Aided Planning of Distribution Substation and Primary Feeders , 1984, IEEE Transactions on Power Apparatus and Systems.

[14]  G. Chartrand,et al.  Introduction to the theory of graphs , 1971 .

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

[16]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[17]  Godfrey A. Walters,et al.  EVOLUTIONARY DESIGN ALGORITHM FOR OPTIMAL LAYOUT OF TREE NETWORKS , 1995 .

[18]  M. Kitagawa,et al.  Implementation of genetic algorithm for distribution systems loss minimum re-configuration , 1992 .

[19]  R. N. Adams,et al.  Optimal planning of power networks using mixed-integer programming. Part 1: Static and time-phased network synthesis , 1974 .

[20]  Mark Weiss Algorithms, Data Structures, and Problem Solving With C++ , 1996 .