1 |
Distribution Network Reconfiguration For Loss Reduction By Multi-branch Exchange MethodGalymov, Birzhan 01 September 2012 (has links) (PDF)
As structure and size of electric power distribution systems are getting more complex, distribution automation schemes become more attractive. One of the features that is desirable in an automated system is feeder reconfiguration for loss reduction. Loss reduction can make considerable savings for a utility and results in released system capacity. There is also improved voltage regulation in the system as a result of reduced feeder voltage drop.
In this thesis, multi branch exchange algorithm is introduced to solve the network reconfiguration for loss reduction problem. The proposed technique is based on heuristic techniques applied to constraint satisfaction optimization problems. A critical review of earlier methods related with feeder reconfiguration is presented. A computer program was developed using Matlab to simulate this algorithm and results of simulations demonstrate its advantages over single branch exchange method. Moreover, the results show that the final configuration is independent of the initial configuration and give assurance that any solution offered will have a radial configuration with all loads connected.
|
2 |
Delay Limited Routing in Multi-hop Wireless Ad-Hoc NetworksSong, Jau-li 26 July 2006 (has links)
In this thesis, we proposed a delay limited routing scheme in wireless ad hoc networks. When nodes transmit packets in wireless ad hoc networks, most people think the one-hop way is better than the multi-hop way in reducing the delay time. Since most cases in wireless ad hoc networks are not single sources, we should consider at least two sources transmitting packets at the same time and then use the multi-hop way in order to reduce the energy consumption. We want to maximize the throughput with limited delay. Our contribution is to transform the optimal scheduling problem in wireless ad hoc networks to the classic maximum flow problem. The maximum flow approach does maximize the throughput and can get the optimal solution.
|
3 |
Studies on mathematical structures of network optimization problems / ネットワーク最適化問題の数学的構造に関する研究 / ネットワーク サイテキカ モンダイ ノ スウガクテキ コウゾウ ニカンスル ケンキュウ渡辺 扇之介, Sennosuke Watanabe 20 September 2013 (has links)
本論文は,様々なネットワーク最適化問題の数学的構造について様々な観点から調べたものである.主たる結果はネットワーク最適化問題の代表例である最大流問題に,関するいくつかの結果と,Min-Plus代数に値をもつ行列の固有値と固有ベクトルに関する特徴づけに関する結果からなっている. / 博士(理学) / Doctor of Philosophy in Science / 同志社大学 / Doshisha University
|
4 |
INTERFACE DE ANÁLISE DA INTERCONEXÃO EM UMA LAN USANDO CORBA / Software development (graphical user interface) that makes possible to analyze the interconnection in a LAN (Local Area Network) using CORBA (Common Object Request Broker Architecture)MONTEIRO, Milson Silva 07 June 2002 (has links)
Made available in DSpace on 2016-08-17T14:52:43Z (GMT). No. of bitstreams: 1
Milson Monteiro.pdf: 1924077 bytes, checksum: 78f931b493f756dec0edee7a465e1099 (MD5)
Previous issue date: 2002-06-07 / Conselho Nacional de Desenvolvimento Científico e Tecnológico / This works concern software development (graphical user interface) that makes
possible to analyze the interconnection in a LAN (Local Area Network) using CORBA (Common
Object Request Broker Architecture) on distributed and heterogeneous environment among
several outlying machines. This works presents paradigms of graphs theory: shortest paths
problems (Dijkstra-Ford-Moore-Belman), maximum flow problems (Edmonds-Karp) and
minimum cost flow problems (Busacker-Gowen) to formalize the interface development. We
discoursed on the graphs theory and networks flows that are essentials to guarantee theoretical
insight. / O objeto de estudo deste trabalho é o desenvolvimento de um software (interface
gráfica do usuário) que possibilita analisar a interconexão de uma LAN (Local Area Network)
usando CORBA (Common Object Request Broker Architecture) em ambientes distribuídos e
heterogêneos entre diversas máquinas periféricas. Este trabalho apresenta os paradigmas da teoria
de grafos: menor caminho (Dijkstra, Ford-Moore-Belman), fluxo máximo (Edmonds-Karp) e
fluxo de custo mínimo (Busacker-Gowen) para formalizar o desenvolvimento da interface.
Discorremos sobre a teoria de grafos e fluxos em redes que são relevantes para garantir o
embasamento teórico.
|
5 |
Pokročilá optimalizace toků v sítích / Advanced Optimization of Network FlowsCabalka, Matouš January 2018 (has links)
The master’s thesis focuses on the optimization models in logistics with emphasis on the network interdiction problem. The brief introduction is followed by two overview chapters - graph theory and mathematical programming. Important definitions strongly related to network interdiction problems are introduced in the chapter named Basic concepts of graph theory. Necessary theorems used for solving problems are following the definitions. Next chapter named Introduction to mathematical programming firstly contains concepts from linear programming. Definitions and theorems are chosen with respect to the following maximum flow problem and the derived dual problem. Concepts of stochastic optimization follow. In the fifth chapter, we discuss deterministic models of the network interdiction. Stochastic models of the network interdiction follow in the next chapter. All models are implemented in programmes written in the programming language GAMS, the codes are attached.
|
Page generated in 0.0689 seconds