Transmission system expansion planning by an extended genetic algorithm


Autoria(s): Gallego, R. A.; Monticelli, A.; Romero, R.
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

20/05/2014

20/05/2014

01/05/1998

Resumo

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Formato

329-335

Identificador

http://dx.doi.org/10.1049/ip-gtd:19981895

Iee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 145, n. 3, p. 329-335, 1998.

1350-2360

http://hdl.handle.net/11449/9693

10.1049/ip-gtd:19981895

WOS:000073942100017

Idioma(s)

eng

Publicador

Institute of Electrical and Electronics Engineers (IEEE)

Relação

IEE Proceedings: Generation, Transmission and Distribution

Direitos

closedAccess

Palavras-Chave #genetic algorithm #network static expansion planning #combinatorial optimisation
Tipo

info:eu-repo/semantics/article