Global optimization methods for optimal power flow and transmission switching problems in electric power systems
Başlık çevirisi mevcut değil.
- Tez No: 403005
- Danışmanlar: DOÇ. DR. SANTANU S. DEY, YRD. DOÇ. DR. X. ANDY SUN
- Tez Türü: Doktora
- Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2016
- Dil: İngilizce
- Üniversite: Georgıa Instıtute Of Technology
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: Belirtilmemiş.
Özet
Özet yok.
Özet (Çeviri)
Power engineering is concerned with the generation, transmission, and distribution of electricity over electric power network. In this thesis, we focus on two operational level optimization problems from power system planning, namely the Optimal Power Flow Problem (OPF) and the Optimal Transmission Switching (OTS) Problem. The former is a nonlinear network problem and the latter is the network design version of the rst one. Due to nonlinearity induced by alternating current power ow equations, these two optimization problems, de ned precisely in Chapter 1, are nonconvex and require e cient global optimization methods. In Chapter 2, we consider Alternating Current OPF (AC OPF) problem over radial networks and analyze the approximation outcomes of the semide nite programming (SDP) relaxation, which is proven to be exact over radial networks under some technical conditions. We design a library of instances that demonstrate positive SDP optimality gaps when these conditions do not hold. Finally, we propose valid inequalities and variable bound tightening techniques that signi cantly improve the computational performance of a global optimization solver. Our work demonstrates the need of developing e cient global optimization methods for the solution of OPF even in the simple but fundamental case of radial networks. In Chapter 3, we focus on the solution of AC OPF problem for the general case of meshed networks. This chapter proposes three strong second-order cone programming (SOCP) relaxations for the AC OPF problem by exploiting the underlying network structure. Two of these three relaxations are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature in terms of both quality of the relaxations and practicability to obtain feasible solutions within a time framework that is compatible with the real-time operations in the current industry practice. In Chapter 4, we again consider the AC OPF problem with a particular emphasis on solving more challenging instances. We analyze the properties of the minors and submatrices of the matrix variable in a lifted formulation, and obtain a stronger SOCP relaxation than the ones proposed in Chapter 3 by the addition of valid inequalities and improved bound tightening techniques. We also propose an SOCP based spatial branch-and-cut algorithm to solve the most di cult instances. Overall, our methodology provides a computationally tractable approach to obtain strong relaxation bounds for some of the hardest OPF instances from the literature. In Chapter 5, we consider the so-called Direct Current OTS problem, which incorporates a linear approximation to nonconvex AC power ow equations. Most research on DC OTS has focused on heuristic algorithms for generating quality solutions. However, the mathematical theory of the DC OTS problem is less well-developed. In this chapter, we formally establish that DC OTS is NP-Hard. We characterize the convex hull of a cycle-induced relaxation inspired by Kircho 's Voltage Law, and this characterization provides strong valid inequalities that can be used in a cutting-plane approach to solve the DC OTS. We give details of a practical implementation, and show promising computational results on standard benchmark instances. In Chapter 6, we focus on the OTS problem with the full AC power ow model since the commonly-used DC approximation of the power ow model is known to result in inaccurate ow solutions. In this chapter, we propose a new exact formulation for AC OTS and its mixed-integer second-order cone programming (MISOCP) relaxation. We improve this relaxation via several types of strong valid inequalities inspired by the developments for the AC OPF problem in Chapter 3. We also propose a practical algorithm to obtain high quality feasible solutions for the AC OTS problem. Extensive computational experiments show that the proposed formulation and algorithms lead to signi cant cost bene ts with provably tight bounds.
Benzer Tezler
- Kalbin global iskemisi sırasında sol ventrikül kavitesine uygulanan basıncın miyokard kontraktürü ve fonksiyonları üzerine etkisi (deneysel çalışma)
Başlık çevirisi yok
TAYFUN SUAT ÇEŞMECİ
Tıpta Uzmanlık
Türkçe
1987
Göğüs Kalp ve Damar Cerrahisiİstanbul ÜniversitesiGöğüs Kalp ve Damar Cerrahisi Ana Bilim Dalı
- Süpersimetri
Başlık çevirisi yok
AYSUN HİLAL
Yüksek Lisans
Türkçe
1987
Fizik ve Fizik MühendisliğiÇukurova ÜniversitesiFizik Ana Bilim Dalı
PROF. DR. MEHMET KOCA
- Manisa-Yamanlar dağı ve çevresinin fiziki coğrafyası
Başlık çevirisi yok
LÜTFİ İHSAN SEZER
Yüksek Lisans
Türkçe
1987
CoğrafyaEge ÜniversitesiFiziki Coğrafya Ana Bilim Dalı
DOÇ. DR. İBRAHİM ATALAY
- Depresif kişilerin kendilerine ve önem verdikleri bir kişiye ilişkin yüklemeleri
Başlık çevirisi yok
IŞIK PAPATYA
Yüksek Lisans
Türkçe
1987
PsikolojiHacettepe ÜniversitesiPsikoloji Ana Bilim Dalı
YRD. DOÇ. DR. ALİ UZUNÖZ