Gallego, R. A.Monticelli, A.Romero, R. [UNESP]2014-05-272014-05-271997-12-01IEEE Power Engineering Review, v. 17, n. 12, p. 58-, 1997.0272-1724http://hdl.handle.net/11449/65277We 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.58engCombinatorial optimizationGenetic algorithmNetwork static expansion planningSimulated annealingTabu searchArtigo10.1109/PICA.1997.599370Acesso restrito2-s2.0-35848956337