Optimal distribution planning by evolutionary computation-how to make it work

Author

Ferreira, LAFM ; Carvalho, PMS ; Jorge, LA ; Grave, SNC ; Barruncho, LMF

Author_Institution

Dept. de Engenharia Electrotecnica e de Comput., Instituto Superior Tecnico, Lisbon, Portugal

Volume

1

fYear

2001

fDate

2001

Firstpage

469

Abstract

The paper addresses key aspects of our experience with evolutionary computation techniques as applied to dealing with the problems of operation planning and expansion planning. Distribution planning-which includes operation planning and expansion planning-can be made optimal by evolutionary computation. The interchange path algorithm plays a major role in the process. The benefits of optimal planning in increasing capacity, improving efficiency and reliability, and in selecting investments are reported

Keywords

evolutionary computation; investment; power distribution economics; power distribution planning; power distribution reliability; distribution planning; efficiency improvement; evolutionary computation; evolutionary computation techniques; expansion planning; operation planning; reliability improvement; Cables; Capacity planning; Cost function; Evolutionary computation; Investments; Maintenance; Meeting planning; Redundancy; Substations; Voltage;

fLanguage

English

Publisher

ieee

Conference_Titel

Transmission and Distribution Conference and Exposition, 2001 IEEE/PES

Conference_Location

Atlanta, GA

Print_ISBN

0-7803-7285-9

Type

conf

DOI

10.1109/TDC.2001.971279

Filename

971279