Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Specialised branch-and-bound algorithm for transmission network expansion planning

Specialised branch-and-bound algorithm for transmission network expansion planning

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Generation, Transmission and Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An algorithm is presented that finds the optimal plan long-term transmission for all cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, in which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch-and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

http://iet.metastore.ingenta.com/content/journals/10.1049/ip-gtd_20010502
Loading

Related content

content/journals/10.1049/ip-gtd_20010502
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address