Transmission network expansion planning under an improved genetic algorithm

This paper describes the application of an improved genetic algorithm (IGA) to deal with the solution of the transmission network expansion planning (TNEP) problem. Genetic algorithms (GAs) have demonstrated the ability to deal with nonconvex, nonlinear, integer-mixed optimization problems, like the TNEP problem, better than a number of mathematical methodologies. Some special features have been added to the basic genetic algorithm (GA) to improve its performance in solving the TNEP problem for three real-life, large-scale transmission systems. Results obtained reveal that GAs represent a promising approach for dealing with such a problem. In this paper, the theoretical issues of GA applied to this problem are emphasized.

[1]  Bull,et al.  An Overview of Genetic Algorithms: Pt 2, Research Topics , 1993 .

[2]  Hong-Tzer Yang,et al.  A parallel genetic algorithm approach to solving the unit commitment problem: implementation on the transputer networks , 1997 .

[3]  L. L. Garver,et al.  Transmission Network Estimation Using Linear Programming , 1970 .

[4]  Ruben Romero,et al.  A hierarchical decomposition approach for transmission network expansion planning , 1994 .

[5]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..

[6]  J. Galletly.  An Overview of Genetic Algorithms , 1992 .

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

[8]  Kit Po Wong,et al.  Combined genetic algorithm/simulated annealing/fuzzy set approach to short-term generation scheduling with take-or-pay fuel contract , 1996 .

[9]  Loi Lei Lai,et al.  Application of evolutionary programming to reactive power planning-comparison with nonlinear programming approach , 1997 .

[10]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

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

[12]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[13]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[14]  S. Binato,et al.  A Greedy Randomized Adaptive Search Procedure for Transmission Expansion Planning , 2001, IEEE Power Engineering Review.

[15]  R. C. G. Teive,et al.  A cooperative expert system for transmission expansion planning of electrical power systems , 1998 .