A multiyear dynamic transmission expansion planning model using a discrete based EPSO approach

被引:26
作者
da Rocha, Manuel Costeira [2 ]
Saraiva, Joao Tome [1 ,2 ]
机构
[1] Univ Porto, Fac Engn, INESC TEC, P-4200465 Oporto, Portugal
[2] Univ Porto, Fac Engn, ECE Dept, P-4200465 Oporto, Portugal
关键词
Transmission expansion planning; Investments; Dynamic multiyear model; Discrete evolutionary particle swarm optimization; ALGORITHM;
D O I
10.1016/j.epsr.2012.07.012
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
This paper presents a multiyear dynamic transmission expansion planning, TEP, model aiming at minimizing operation and investment costs along the entire planning horizon while ensuring an adequate quality of service and enforcing constraints modeling the operation of the network along the planning horizon. The developed model profits from the experience of planners when preparing a list of possible branch (lines and transformers) additions each of them associated to the corresponding investment cost. The objective of solving a TEP problem is to select a number of elements of this list and provide its scheduling along the planning horizon such that one is facing a mixed integer optimization problem. In this case, this problem was solved using a discrete evolutionary particle swarm optimization algorithm, DEPSO. based on already reported EPSO approaches but particularly suited to treat discrete problems. Apart from detailing the developed DEPSO, this paper describes the mathematical formulation of the TEP problem and the adopted solution algorithm. It also includes results of the application of the DEPSO to the TEP problem using two test networks widely used by other researchers on this area. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:83 / 92
页数:10
相关论文
共 25 条
[1]
Transmission expansion planning: A mixed-integer LP approach [J].
Alguacil, N ;
Motto, AL ;
Conejo, AJ .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (03) :1070-1077
[2]
[Anonymous], 1979, IEEE T POWER AP SYST, V98, P2047, DOI 10.1109/TPAS.1979.319398
[3]
A greedy randomized adaptive search procedure for transmission expansion planning [J].
Binato, S ;
de Oliveira, GC ;
de Araújo, JL .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2001, 16 (02) :247-253
[4]
A multiyear dynamic approach for transmission expansion planning and long-term marginal costs computation [J].
Braga, ASD ;
Saraiva, JT .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (03) :1631-1639
[5]
A novel chaotic particle swarm optimization approach using Henon map and implicit filtering local search for economic load dispatch [J].
Coelho, Leandro dos Santos ;
Mariani, Viviana Cocco .
CHAOS SOLITONS & FRACTALS, 2009, 39 (02) :510-518
[6]
A kernel-oriented algorithm for transmission expansion planning [J].
Contreras, J ;
Wu, FF .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (04) :1434-1440
[7]
Transmission network expansion planning under an improved genetic algorithm [J].
da Silva, EL ;
Gil, HA ;
Areiza, JM .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (03) :1168-1175
[8]
Fogel D. B., 2008, MODERN HEURISTIC OPT, P3
[9]
TRANSMISSION NETWORK ESTIMATION USING LINEAR PROGRAMMING [J].
GARVER, LL .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1970, PA89 (07) :1688-&
[10]
HICKS KL, 1974, IEEE T POWER AP SYST, VPA93, P1390, DOI 10.1109/TPAS.1974.293869