dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:26:57Z
dc.date.available2014-05-20T15:26:57Z
dc.date.created2014-05-20T15:26:57Z
dc.date.issued1998-08-01
dc.identifierIEEE Transactions on Power Systems. New York: IEEE-Inst Electrical Electronics Engineers Inc., v. 13, n. 3, p. 822-828, 1998.
dc.identifier0885-8950
dc.identifierhttp://hdl.handle.net/11449/37023
dc.identifier10.1109/59.708680
dc.identifierWOS:000075064400016
dc.description.abstractWe have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.
dc.languageeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relationIEEE Transactions on Power Systems
dc.relation5.255
dc.relation2,742
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectsimulated annealing
dc.subjectgenetic algorithm
dc.subjecttabu search
dc.subjectnetwork static expansion planning
dc.subjectcombinatorial optimization
dc.titleComparative studies on non-convex optimization methods for transmission network expansion planning
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución