dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T13:28:58Z
dc.date.accessioned2022-10-05T13:27:18Z
dc.date.available2014-05-20T13:28:58Z
dc.date.available2022-10-05T13:27:18Z
dc.date.created2014-05-20T13:28:58Z
dc.date.issued1998-05-01
dc.identifierIee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 145, n. 3, p. 329-335, 1998.
dc.identifier1350-2360
dc.identifierhttp://hdl.handle.net/11449/9693
dc.identifier10.1049/ip-gtd:19981895
dc.identifierWOS:000073942100017
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3886005
dc.description.abstractThe 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.
dc.languageeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relationIEE Proceedings: Generation, Transmission and Distribution
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectgenetic algorithm
dc.subjectnetwork static expansion planning
dc.subjectcombinatorial optimisation
dc.titleTransmission system expansion planning by an extended genetic algorithm
dc.typeArtigo


Este ítem pertenece a la siguiente institución