By Topic

Large scale transmission network planning using optimization and heuristic techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. C. Oliveira ; CEPEL, Electr. Power Res. Center, Rio de Janeiro, Brazil ; A. P. C. Costa ; S. Binato

Pursuing optimal solutions for large scale transmission network planning problems is a formidable task due to their combinatorial nature and also due to the nonconvexities involved. Successful approaches using hierarchical Benders decomposition incur in a high computational cost mainly due to the need to solve a large integer program (the investment sub-problem) for every Benders iteration. In this work the authors propose to use heuristics within the decomposition framework, therefore avoiding to solve to optimality each integer sub-problem. The global computational effort is substantially reduced, and allows coping with large problems that would be intractable using classical combinatorial techniques. Case studies with the 6 bus Garver test system and a reduced Southeastern Brazilian power network are presented and discussed.

Published in:

IEEE Transactions on Power Systems  (Volume:10 ,  Issue: 4 )