Answers are grounded in this paper and cite their sources.
We have investigated and extensively tested three families of nonconvex 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.
No takes yet. Share an insight, caveat, or question.
Monticelli et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: