Transmission network expansion planning under a Tabu Search approach

被引：100

作者：

da Silva, EL ^{[1
]}

Ortiz, JMA

de Oliveira, GC

Binato, S

机构：

[1] Univ Fed Santa Catarina, BR-88040900 Florianopolis, SC, Brazil

[2] Pontificia Univ Catolica Rio de Janeiro, Rio De Janeiro, Brazil

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 2001年 / 16卷 / 01期

关键词：

integer programming; metaheuristics; optimization; Tabu Search; transmission network expansion planning;

D O I：

10.1109/59.910782

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper describes an implementation of Tabu Search to cope with long-term transmission network expansion planning problems. Tabu Search is a metaheuristic proposed in 1989 to be applied to combinatorial problems. To assess the potential of our approach we will test it with two cases of transmission network expansion planning. The results obtained by our approach let us to conclude that TS is a robust and promising technique to be applied in this problem.

引用

页码：62 / 68

页数：7

共 16 条

[1] Partitioning procedures for solving mixed-variables programming problems [J].

Benders, J. F. .

COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19

[2]

BINATO S, IN PRESS IEEE T PAS

[3]

BINATO S, 1994, J S SPEC EL OP EXP P

[4]

FEO TA, 1995, IN PRESS J GLOBAL OP

[5] TRANSMISSION NETWORK ESTIMATION USING LINEAR PROGRAMMING [J].

GARVER, LL .

IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1970, PA89 (07) :1688-&

[6]

Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]

[7]

Goldberg D. E., 1989, GENETIC ALGORITHMS S

[8] OPTIMIZATION BY SIMULATED ANNEALING - QUANTITATIVE STUDIES [J].

KIRKPATRICK, S .

JOURNAL OF STATISTICAL PHYSICS, 1984, 34 (5-6) :975-986

[9]

ORTIZ JMA, 1998, THESIS FEDERAL U SAN

[10]

ROMERO R, 1994, IEEE T POWER SYST, V9

← 1 2 →