skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Second-Order Cone model for Active Distribution Network Expansion Planning
Haijun Xing ; Haozhong Cheng ; Libo Zhang ; Shengxi Zhang ; Yi Zhang
2015 IEEE Power & Energy Society General Meeting, 2015, p.1-5
IEEE
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Second-Order Cone model for Active Distribution Network Expansion Planning
Autor:
Haijun Xing
;
Haozhong Cheng
;
Libo Zhang
;
Shengxi Zhang
;
Yi Zhang
Assuntos:
active distribution network
;
Computational modeling
;
distflow
;
distribution network expansion planning
;
Investment
;
Load modeling
;
Mathematical model
;
Planning
;
second-order cone programming
;
Substations
;
Uncertainty
É parte de:
2015 IEEE Power & Energy Society General Meeting, 2015, p.1-5
Descrição:
This paper proposes Second-Order Cone Programming (SOCP) model for Active Distribution Network Expansion Planning (ADNEP). The objective minimizes total investment and operation cost. Distributed Generation (DG) curtailment and load curtailment are used as the active management schemes to decrease the future operation risks of the planning. The expansion model allows alternatives to be considered for new wiring, new substation, substation expansion and DG installation. The Distribution Network Expansion Planning (DNEP) problem is a Mixed Integer Nonlinear Programming (MINLP) problem, which is NP-hard. Active management and uncertainties especially with the DG integration make the DNEP problem much complex. In order to find the polynomial time computable model, this paper converts the DNEP problem to a SOCP model through distflow equations and constraints relaxation. Scenario analysis is picked for the future uncertainties. CVX and GUROBI solver are used to solve the SOCP model, and a 50 nodes application example is used to for the verification.
Editor:
IEEE
Idioma:
Inglês
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_PRODUCAO),scope:(USP_EBOOKS),scope:("PRIMO"),scope:(USP),scope:(USP_EREVISTAS),scope:(USP_FISICO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript