Solving radial topology constrained problems with evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1585, Issue , 1999, Pages 58-65

  Carvalho, P M S ^a   Ferreira, L A F M ^a   Barruncho, L M F ^b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b EDINFOR   (Portugal)

Author keywords

Evolutionary computation; Network planning; Radial topology constraints

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENES; GENETIC ALGORITHMS;

CONSTRAINED PROBLEM; GENETIC INFORMATION; INFORMATION STRUCTURES; LARGE-SCALE NETWORK; NETWORK PLANNING; RADIAL TOPOLOGY; RECOMBINATION OPERATORS; TOPOLOGICAL STRUCTURE;

TOPOLOGY;

EID: 84956862025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48873-1_9     Document Type: Conference Paper

References (18)

1. R. N. Adams and M. A. Laughton ‘Optimal Planning of Power Networks using Mixedinteger Programming Part 1—Static and time-phased network synthesis’ Proceedings IEE, Vol 121, No 2, 1974, pp. 139-148
2. G. T. Boardman and C. C. Meckiff ‘A Branch-and-Bound Formulation to an Electricity Distribution Planning Problem’ IEEE Trans. PAS, Vol 104, No 8, 1985, pp. 2112-2118
3. R. H. Jan, F. J. Hwang, S.T. Cheng, ‘Topological Optimization of a Communication Network Subject to a Reliability Contsraint’ IEEE Trans. Reliability, Vol. 42, 1993, pp. 63-70.
4. M. A. El-Kady ‘Computer-aided Planning of Distribution Substation and Primary Feeders IEEE Trans. PAS, Vol 103, No 6, 1984, pp. 1183-1189
5. N. Kagan and R. N. Adams ‘Application of Benders Decomposition Technique to the Distribution Planning Problem’ Proc. 10th Power System Computation Conference, Graz, Austria, 1990
6. G. J. Peponis and M. P. Papadopoulos ‘New Dynamic, Branch Exchange Method for Optimal Distribution System Planning’ IEE Proc. Gener. Transm. Distrib., Vol 144, No 3, 1997, pp. 333-339
7. F. Glover, M. Lee, J Ryan, ‘Least-cost Network Topology Design for a New Service: An Application of a Tabu Search’, Ann. Oper. Research, Vol 33, 1991, pp. 351-362
8. S. Pierre, M.-A. Hyppolite, J.-M. Bourjolly, O. Dioume, ‘Topology Design of Computer Communication Networks Using Simulated Annealing’, Eng. Application Artificial Intelligence, Vol 8, 1995, pp. 61-69
9. J. Partanen ‘A Modified Dynamic Programming Algorithm for Sizing, Locating, and Timing of Feeder Reinforcements’, IEEE Trans. Power Delivery, Vol 5, No 1, 1990, pp. 277-283.
10. V. Miranda, J. V. Ranito, L. M. Proença, ‘Genetic Algorithms in Optimal Multistage Distribution Networks Planning’, IEEE Trans. Power Systems, Vol 9, No 4, 1994, pp. 1927-1933.
11. P. M. S. Carvalho, L. A F. M. Ferreira, F. G. Lobo and L. M. F. Barruncho ‘Optimal Distribution Network Expansion Planning Under Uncertainty by Evolutionary Decision Convergence’, International Journal of Electrical Power & Energy Systems (Special Issue on PSCC’96), Vol. 20, No. 2, 1998, pp. 125-129.
12. Berna Dengiz, F. Altiparmak, Alice E. Smith, ‘Local Search Genetic Algorithm for Optimal Design of Reliabe Networks’, IEEE Trans. Evolutionary Computation, Vol 1, No. 3, 1997, pp. 179-188.
13. Z. Michalewicz, ‘Genetic Algorithms + Data Structures = Evolution Programs’, (Berlin, Germany: Spriger, 1996).
14. D. E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, (Reading, MA, Addison-Wesley, 1989).
15. Thomas Bäck, Ulrich Hammel, Hans-Paul Schwefel, ‘Evolutionary Computation: Comments on the History and Current State’, IEEE Trans. Evolutionary Computation, Vol 1, No 1, 1997, pp. 3-17
16. Seymour Lipschutz, General Topology, McGraw-Hill (1965).
17. D. E. Goldberg, K. Deb and J. H. Clark ‘Genetic Algorithms, Noise and the Sizing of Populations’, Complex Systems, 6, 1992, pp. 333-362
18. D. E. Goldberg and K. Deb ‘A Comparative Analysis of Selection Schemes Used in Genetic Algorithms’ pp. 69-93 in Foundations of Genetic Algorithms, edited by G. Rawlins (San Mateo, CA, Morgan Kaufman, 1991).