To see the other types of publications on this topic, follow the link: Reconfiguration network.
Dissertations / Theses on the topic 'Reconfiguration network'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Reconfiguration network.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Ajaja, Adile. "Distribution network optimal reconfiguration." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=110641.
Full textAbstract:
This thesis reports on research conducted on the Optimal Reconfiguration (OR) of distribution networks using Mixed Integer Linear Programming (MILP). At the operational hourly level, for a set of predicted bus loads, OR seeks the optimum on/off position of line section switches, shunt capacitors and distributed generators so that the distribution network is radial and operates at minimum loss. At the planning level, OR seeks the optimum placement of line switches and shunt capacitors so that, over the long-term, losses will be minimized. The main steps and outcomes of this research are (i) the development of a simplified single-phase distribution network model for Optimal Reconfiguration; (ii) the development of a linear DC load flow model with line and device switching variables accounting for both active and reactive power flows; (iii) the development of an algorithm HYPER which finds the minimum loss on/off status of existing line switches, shunt capacitors and distributed generators; (iv) the extension of HYPER to find the optimum (minimum loss) placement of switches, capacitors and distributed generators; (v) the representation of losses via supporting hyperplanes enabling the full linearization of the OR problem, which can then be solved using efficient and commercially available MILP solvers like CPLEX. Keywords: Distribution Network, Optimal Reconfiguration, OR, Loss minimization, Mixed-Integer Linear Programming, MILP, Operations research, Linear network model, DC load flow, Supporting hyperplanes, Real time optimization, Switch, Capacitor and Distributed Generator placement, Power Systems Operations and Planning.<br>Ce mémoire de thèse rend compte des produits d'activités de recherche menée relativement à la Reconfiguration Optimale (RO) de réseaux de distribution par Programmation Linéaire en Variables Mixtes (PLVM). Dans un contexte de conduite de réseau, la RO s'applique à déterminer l'état ouvert/fermé optimal des interrupteurs, disjoncteurs, condensateurs et producteurs distribués, avec objectif d'opérer à un niveau de pertes minimum un réseau de distribution radial. La RO s'applique également, dans un contexte de planification, à identifier l'emplacement optimal sur le réseau d'interrupteurs, disjoncteurs et condensateurs visant le maintien, sur le long terme, des pertes à un niveau minimum. Les principaux résultats de cette recherche sont: (i) le développement d'un modèle unifilaire simplifié de réseau de distribution pour la Reconfiguration Optimale; (ii) le développement d'un modèle d'écoulement de puissance linéaire avec variables contrôlant l'état des lignes, adapté autant pour l'écoulement de puissance actif que réactif; (iii) le développement de l'algorithme HYPER capable d'identifier l'état ouvert/fermé optimal (minimum de pertes) des interrupteurs, disjoncteurs, condensateurs et producteurs distribués; (iv) une extension de l'algorithme HYPER permettant de déterminer l'emplacement optimal (minimum de pertes) d'interrupteurs, disjoncteurs, condensateurs et producteurs distribués; (v) la représentation des pertes via hyperplans-porteurs permettant la linéarisation complète du problème RO et sa résolution par l'emploi de solveurs PLVM performants et commercialement disponibles tels que CPLEX.Mots clés: Réseau de distribution, Reconfiguration Optimale, RO, Minimisation des pertes, Programmation Linéaire en Variables Mixtes, PLVM, Recherche opérationnelle, Modèle de réseau linéaire, Écoulement de puissance linéaire, Hyperplans-porteurs, Optimisation temps réel, Interrupteur, Disjoncteur, Condensateur, Producteur privé, Exploitation, Conduite, Planification.
2
Fard, Pedram J. "Dynamic reconfiguration of network topology in optical networks." College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/7412.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2007.<br>Thesis research directed by: Electrical Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
3
Saivichit, Chalyachet. "Network reconfiguration algorithm for overcoming faults arising in networks." Thesis, Imperial College London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395652.
Full text
4
Peng, Zhengrui. "Feeder reconfiguration on distribution network considering harmonics." Thesis, University of Strathclyde, 2017. http://digitool.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=28416.
Full textAbstract:
One of the most important measures that can be employed to enhance the supply reliability and quality of electrical energy in a distribution network is feeder reconfiguration. Many studies have been conducted in this area, but only a minor proportion have considered the concept of system harmonics in feeder reconfiguration. In recent years, an increasing number of invertor/converter-based renewable generators are being connected to the distribution network, and given that these generators are harmonic sources, it is important to consider the impacts of the system harmonics in the feeder reconfiguration. Load flow analysis is used to determine a suitable network structure for specific purposes in the feeder reconfiguration problem. In this thesis, a new load flow method is proposed based on the backward/forward sweep method. This method can analyse distribution network load flow under both fundamental and harmonic conditions with distributed generators. Following this, a hybrid optimization method is proposed based on the salient features of the ant colony system and particle swarm optimization. This hybrid method has a higher searching accuracy performance for feeder reconfiguration when compared, on test system, with the ant colony system and particle swarm optimization. Finally, a 118 mid-voltage level distribution system is used to investigate the impacts of renewable generators and system harmonics. The test results verify that system harmonics will have a significant influence on feeder reconfiguration and, consequently, cannot be ignored. Furthermore, other factors including the different capacities of renewable generators, fluctuations in load demands over 24 hours, and the variable output of the renewable generators in different seasons are also investigated in the feeder reconfiguration problem.
5
Karnib, Nour. "Application of Optimization in Regional Distribution Network Reconfiguration." Electronic Thesis or Diss., Chasseneuil-du-Poitou, Ecole nationale supérieure de mécanique et d'aérotechnique, 2025. http://www.theses.fr/2025ESMA0001.
Full textAbstract:
Dans le domaine de la recherche opérationnelle, le sujet de cette thèse consiste à optimiser les réseaux électriques (en particulier les réseaux de distribution) en termes de pertes de puissance. Le principal problème abordé est le problème de la reconfiguration des réseaux de distribution (DNR) et plusieurs variations de ce problème. Le problème DNR est largement étudié dans la littérature et constitue une approche efficace pour les gestionnaires de réseaux de distribution (DSO) afin d’optimiser leurs réseaux en termes de perte de puissance due à la chaleur Joule. Avec la forte intégration de la production distribuée(production décentralisée), la reconfiguration du schéma d’exploitation du réseau devient cruciale pour améliorer l’économie de ces GRD. Le modèle d’optimisation consiste en un problème de programmation quadratique en nombres entiers mixtes (MIQP), où le réseau de distribution est représenté sous la forme d’un graphe, qui sert d’entrée à ce MIQP. Les variables binaires sont l’état de chaque interrupteur (1 ou 0)et les variables continues représentent les flux dans chaque ligne. La fonction objective est la somme des pertes de puissance pour la configuration sélectionnée par le solveur. Cette thèse réduit d’abord le temps de calcul du solveur lorsque les charges et les générations considérées sont statiques (à un seul moment dans le temps). Elle propose une méthode de réduction du réseau, où le graphe d’entrée du MIQP est réduit pour diminuer l’espace de recherche de la solution pour le solveur. Dans le même but, une méthode d’élimination des commutateurs à faible impact est proposée et testée sur un réseau d’agences SRD. Cette méthode consiste à proposer un ensemble de points de fonctionnement pour les coefficients de charge et de production sur l’ensemble du réseau, où le MIQP est lancé de manière séquentielle. Ensuite, les commutateurs à faible impact dans le MIQP sont fixés en tant que données, tandis que les commutateurs les plus importants restent en tant que variables. Les résultats ont montré que la méthode proposée améliorait considérablement le temps de calcul, le rendant environ 177 fois plus rapide dans le cas d’un point de fonctionnement donné indépendant des points initiaux. Après ces tentatives de réduction du temps de calcul du solveur dans le cas statique, une généralisation est proposée, où l’objectif est d’optimiser les pertes de puissance sur un horizon temporel. On parle alors de reconfiguration multiple sous contraintes opérationnelles. Ensuite, le cas des reconfigurations libres est exploré, lorsqu’aucune contrainte opérationnelle n’est imposée. Ce cas permet au solveur de modifier la solution à chaque point dans le temps, mais cette approche se heurte à de nombreux obstacles technologiques et économiques. Enfin, dans le cas d’une forte intégration de la production, qu’aucune solution ne peut gérer, la réduction de la puissance est introduite pour réduire la puissance excédentaire et maintenir une solution réalisable<br>In the domain of operations research, this thesis’s subject consists of optimizing electrical networks (specifically, distribution networks) in terms of power losses. The main adressed problem is the Distribution Network Reconfiguration (DNR) problem and several variations of the problem. The DNR problem is widely studied in the literature and is an effective approach for Distribution System Operators (DSOs) to optimize their networks in terms of power loss due to Joule heat. With the high integration of distributed generation (decentralized generation), reconfiguring the network’s operation scheme becomes crucial to improving the economics for these DSOs. The optimization model consists of a Mixed Integer Quadratic Programming (MIQP) problem, where the distribution network is represented as a graph, which serves as an input for this MIQP. The binary variables consist of the state of each switch (1 or 0) along with the continuous variables representing the flows in each line. The objective function is the sum of power losses for the configuration selected by the solver. This thesis first reduces the solver’s computational time when the considered loads and generations are static (at one single point in time). It proposes a network reduction method, where the input graph in the MIQP is reduced to decrease the solution’s search space for the solver. With the same goal, a method for eliminating low-impact switches is proposed and tested on an SRD agency network. This method involves proposing a set of operating points for load and generation coefficients across the entire network, where the MIQP is launched sequentially. Then,the low-impact switches in the MIQP are fixed as data, while the most impactful switches remain as variables. The results showed that the proposed method greatly improved computational time, making it roughly 177 times faster in the case of a given operating point independent of the initial ones. After these attempts to reduce the solver’s computational time in the static case, a generalization is proposed, where the goal is to optimize power losses over a time horizon. This is referred to as multiple reconfiguration under operational constraints. Then, the case of free reconfigurations is explored, where no operational constraints are imposed. This case allows the solver to change the solution at each time point, but this approach faces many technological and economic barriers. Finally, in the case of high production integration, where no solution can handle it, power curtailment is introduced to curtail power in excess and maintain a feasible solution
6
Khan, Asif H. "Analysis of time varying load for minimum loss distribution reconfiguration." Diss., This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-06062008-171313/.
Full text
7
Dzalilov, Zari. "Mathematical models of dynamic reconfiguration of telecommunication networks." Thesis, University of Ballarat, 2004. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/58707.
Full textAbstract:
In this thesis we examine mathematical models for dynamical reconfiguration of telecommunication networks. Dynamical configuration is one of the most important problems in the field of network management. In the case of some part of the network being damaged the system should maintain its operations, taking into account the new conditions. This can be achieved by using the residual capacity of the system if it is available. If there were not enough residual capacity, the managers of the system need to involve some of the unaffected traffic in order to reorganize traffic. A prolonged breakdown will push some customers to change their provider; there is also a lost [sic] of profit because of breakdowns, that can be considered as a certain implicit penalty. To reorganize traffic by using new routes we should have a flexible routing system.<br>Doctor of Philosophy
8
Ding, Fei. "Smart Distribution System Automation: Network Reconfiguration and Energy Management." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1417291114.
Full text
9
Biallach, Hanane. "Optimization of VNF reconfiguration problem for 5G network slicing." Electronic Thesis or Diss., Compiègne, 2022. http://www.theses.fr/2022COMP2707.
Full textAbstract:
Ces dernières années, en raison de la croissance sans précédent du nombre d'appareils connectés et de données mobiles, et des développements continus des technologies pour répondre à cette énorme demande de données, le réseau de cinquième génération (5G) a émergé. La future architecture 5G sera essentiellement basée sur le Network Slicing (NS), qui permet de fournir une approche flexible pour réaliser la vision 5G. Grâce au concept émergent de virtualisation des fonctions réseau (NFV), les fonctions réseau sont découplées des matériels physiques dédiés et réalisées sous forme de logiciel. Cela offre plus de flexibilité et d'agilité dans les opérations commerciales. Malgré les avantages qu'il apporte, NFV soulève quelques défis techniques, le problème de reconfiguration étant l'un d'entre eux. Ce problème, qui est NP-difficile, consiste à réaffecter les fonctions de réseau virtuel (VNFs) pour s'adapter aux changements du réseau, en transformant l'état courant des services déployés, on peut illustrer cela par la migration des machines virtuelles (VM) qui hébergent les VNF, à un autre état qui répond aux objectives des opérateurs. Cette thèse de doctorat étudie comment reconfigurer les VNFs en les migrant vers un état optimal qui pourrait être calculé en avance ou inconnu. Dans cette thèse, nous avons étudié les deux cas en minimisant la durée d'interruption de service et la durée de migration des VNFs. Nous avons proposé des méthodes exactes et approchées. Parmi les méthodes exactes, nous citons deux modèles PLNE. Nous avons également proposé deux approches heuristiques, l'une basée sur la génération de colonnes et la deuxième utilisant la notion de “feedback arc set". L'objectif global de ce travail est donc de définir et d'étudier le problème de reconfiguration des VNFs dans le contexte du 5G network slicing, et de proposer des modèles mathématiques et des algorithmes efficaces pour résoudre les problèmes d'optimisation sous-jacents<br>In recent years, because of the unprecedented growth in the number of connected devices and mobile data, and the ongoing developments in technologies to address this enormous data demand, the fifth generation (5G) network has emerged. The forthcoming 5G architecture will be essentially based on Network Slicing (NS), which enables provide a flexible approach to realize the 5G vision. Thanks to the emerging Network Function Virtualization (NFV) concept, the network functions are decoupled from dedicated hardware devices and realized in the form of software. This offers more flexibility and agility in business operations. Despite the advantages it brings, NFV raises some technical challenges, the reconfiguration problem is one of them. This problem, which is NP-Hard, consists in reallocating the Virtual Network Functions (VNFs) to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. This PhD thesis investigates how to reconfigure the VNFs by migrating them to an optimal state that could be computed in advance or free placement. In this thesis, we studied both cases while minimizing the service interruption duration and the VNF migration duration. We have proposed exact and approximate methods. Among the exact methods, we cite two ILP models. We also proposed two heuristic approaches, one based on column generation and the second using the concept of “arc set feedback”. The overall objective of this work is therefore to define and study the problem of VNF reconfiguration problem in the context of 5G network slicing, and propose mathematical models and efficient algorithms to solve the underlying optimization problems
10
Harper, Scott Jeffery. "A Secure Adaptive Network Processor." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/28023.
Full textAbstract:
Network processors are becoming a predominant feature in the field of network hardware. As new network protocols emerge and data speeds increase, contemporary general-purpose network processors are entering their second generation and academic research is being actively conducted into new techniques for the design and implementation of these systems. At the same time, systems ranging from secured military communications equipment to consumer devices are being updated to provide network connectivity. Many of these devices require, or would benefit from, the inclusion of device security in addition to data security. Whether it is a top-secret encryption scheme that must be concealed or a personal device that needs protection against unauthorized use, security of the device itself is becoming an important factor in system design. Unfortunately, current network processor solutions were not developed with device security in mind. A secure adaptive network processor can provide the means to fill this gap while continuing to provide full support for emerging communication protocols. This dissertation describes the concept and structure of one such device. Analysis of the hardware security provided by the proposed device is provided to highlight strengths and weaknesses, while a prototype system is developed to allow it to be embedded into practical applications for investigation. Two such applications are developed, using the device to provide support for both a secure network edge device and a user-adaptable network gateway. Results of these experiments indicate that the proposed device is useful both as a hardware security measure and as a basis for user adaptation of information-handling systems.<br>Ph. D.
11
Khan, Ajab. "Stochastic simulation of P2P VoIP network reconfiguration using graph transformation." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/10428.
Full textAbstract:
Peer-to-Peer (P2P) networks provide an alternative approach to distributed systems, relaxing the requirements for dedicated servers from the client-server model. A P2P network operates as an overlay at application layer, on top of the physical network. In the early years of P2P, most applications lacked mechanisms for enforcing a particular overlay topology. This resulted in inefficient communication schemes, such as flooding or the maintenance of large numbers of connections with other peers. However, researchers and practitioners have realized the importance of constructing and maintaining appropriate overlay topologies for efficient and robust P2P systems. P2P-based Voice over IP (VoIP) networks, such as Skype, distinguish client peers from super peers. This results in a two-level hierarchy: Peers with powerful CPU, more free memory and greater bandwidth take on server-like responsibilities and provide services to a set of client peers. But building and maintaining a super peer-based overlay topology is not easy. In particular, the uncontrollable and unpredictable behaviour of peers results in volatile overlay topologies. This makes it challenging to design reconfigurable and stable networks that provide good Quality of Service (QoS). Various solutions have been proposed. However, peer dynamics, scale and complexity make it hard and expensive to validate them by testing. Simulation can help to validate network designs and protocols, but most existing approaches cannot cope with unbounded dynamic change of network topology. We propose a new approach to the modelling and simulation of P2P network reconfigurations using graph transformation, a visual rule based formalism. Based on existing alternatives we classify network design variations by means of a feature tree. Focussing on P2P VoIP applications, we develop a structural model and transformation rules to compare alternative solutions to the problems of selection and connection to super peers, peer promotion, and load balancing, evaluating their QoS properties. We validate the model using statistics from the real Skype network and experimental data in the literature.
12
Pikelis, Winfred Prescott. "Dynamic reconfiguration and link fault tolerance in a Transputer network." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/25859.
Full text
13
Tercero, Pablo 1973. "Distribution network reconfiguration for an apparel manufacturer : an inventory analysis." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/28573.
Full textAbstract:
Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2003.<br>Includes bibliographical references (p. 84-85).<br>Companies in the footwear and apparel industry must deal with many supply chain challenges, including intense competition, long production lead times, reliance on international carriers, and shifting consumer preferences. For many large companies, only design and distribution are performed internally. This places pressure on footwear and apparel companies to continually improve supply chain management. This study considers a company in the footwear and apparel industry and its option to consolidate distribution for two separate regions into one. One region currently serves nine times the demand of the other region. In addition, there are differences in labor and transportation costs between the two regions. The company would like to understand the financial, operational, and service impacts associated with consolidation. This study uses a total logistics system approach with particular focus on inventory. The results indicate that if the company were to consolidate distribution for the two regions into one, then there would be a slight total logistics system cost increase. This is due mainly to differences in labor and transportation costs between the two regions. However, sensitivity analysis indicates that if some costs can be reduced, there may actually be potential savings associated with consolidating the two regions.<br>by Pablo Tercero.<br>M.Eng.in Logistics
14
Anthony, Ikenna O., Geev Mokryani, Rana H. A. Zubo, and O. A. Ezechukwu. "Distribution Network Reconfiguration Considering Security-Constraint and Multi-DG Configurations." IEEE, 2020. http://hdl.handle.net/10454/18492.
Full textAbstract:
Yes<br>This paper proposes a novel method for distribution network reconfiguration considering security-constraints and multi-configuration of renewable distributed generators (DG). The objective of the proposed method is to minimize the total operational cost using security constrained optimal power flow (SCOPF). The impact of multi-configuration of renewable DGs in a meshed network is investigated. In this work, lines were added to the radial distribution network to analyse the network power flow in different network configurations. The added lines were connected to the closest generator bus which offered least operating cost. A 16-bus UK generic distribution system (UKGDS) was used to model the efficiency of the proposed method. The obtained results in multi-DG configuration ensure the security of the network in N-1 contingency criteria.
15
Ekstrand, Aaron Jordan. "A Fast and Efficient Method for Power Distribution Network Reconfiguration." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/theses/2094.
Full textAbstract:
We have proposed a method by which the topology of a network might be discovered through an algorithm like the distributed Bellman-Ford algorithm. We have explored the inner workings of two methods to automate power distribution network reconfiguration, the ILP Solver and the Heuristic Solver. We have seen how networks of different shapes can be translated into a flattened topology, which is necessary preprocessing to find a power assignment solution for a network. We have also seen some experimental results comparing the performance of the ILP Solver and the Heuristic Solver. The Heuristic Solver is a very fast, efficient algorithm to reconfigure power distribution, which is important in the case of an emergency. It performs consistently with near perfect results at a speed that is orders of magnitude quicker than the ILP Solver in almost all cases. In an application where a network is small and time is not an important constraint, the ILP Solver could possibly be preferable, but in any context where time is sensitive and near-perfect results are as acceptable as perfect results, the Heuristic Solver is much preferable. There is always room for improvement. Future tests should perhaps allow for non-integer capacity units, or loads that require other values than unit capacity. Optimizing each algorithm by rewriting them in C could give more optimized tests, though this may not be necessary to make judgments about implementing one or the other. There may be some ways to improve the Heuristic Solver, such as arranging the ordered_links in some way that could be more optimal. The algorithm could also be improved by taking advantage of the fact that once there are no more sources with capacity to provide any loads, the process of trying to assign loads to them for power supply can cease. Perhaps this method could be combined with other methods that do not presently account for load priorities or place as much value on fast execution.
16
Galymov, Birzhan. "Distribution Network Reconfiguration For Loss Reduction By Multi-branch Exchange Method." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614663/index.pdf.
Full textAbstract:
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.
17
Isapour, Chehardeh Maziar. "AUTOMATIC RECONFIGURATION OF RADIAL DISTRIBUTION NETWORK FOR RELIABILITY ASSESSMENT USING THE CIRCUIT GRAPH." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1572.
Full textAbstract:
The problem of optimum restoration after occurrence the outages in a distribution network is an important issue in smart grids. In this kind of networks remote-controlled switches, alternative sources and grid-connected distributed generators (DG) are employed. Therefore, the reliability of the system (corresponding to the frequency of failures and the duration of interruptions) is improved by operating the switches to resupply a part of interrupted system during the repair time. To evaluate the reliability indices in smart grids, neglecting the restoration during the repair time causes the wrong assessment of the network. Thus, considering the rerouting the power during the interruptions seems necessary to calculate the reliability indices. The problem of restoration is formulated as a non-linear integer programming problem with the assistance of the network graph. The circuit graph method is also used to pre-evaluate the feasible interchanging operations to enhance the efficiency of the computations. The topological and operational constraints in this formulation can be found and resolved with the assistance of fundamental cut-set matrix. The optimum restoration schemes is obtained by considering the optimal islanded mode of operation of the DGs which implies maximizing the loading of DGs while not violating their generation capacities. The optimum restoration policies lead us to find the optimum number and location of those manual switches that should be upgraded to the remote-controlled switches. This is a multi-objective problem that contains the contribution of each restoration policy in the reliability improvement and the cost of those switching operations. The proposed algorithm is applied to different standard test systems and the results are compared to the results obtained from other methods and algorithms.
18
Chaubal, Aditya Prakash. "Design and Implementation of an FPGA-based Partially Reconfigurable Network Controller." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/10098.
Full textAbstract:
There is currently a strong trend towards embedding Internet capabilities into electronics and everyday appliances. Most network controllers used in small appliances or for specialized purposes are built using micro controllers. However there are many applications where a hardware-oriented approach using Application Specific Integrated Circuits (ASICs) or Field Programmable Gate Arrays (FPGAs) is more suitable. One of the features of FPGAs that cannot be integrated into ASICs is runtime reconfiguration in which, certain portions of the chip are reconfigured at runtime while the other parts continue to operate normally. This feature is required for network controllers with multiple data transfer channels that need to preserve the state of the static channels while reconfiguration is taking place. It is also required for controllers with space constraints in terms of FPGA resources or time constraints in terms of reconfiguration times. This thesis explores the impact of partial reconfiguration on the performance of a network controller. An FPGA-based network controller that supports partial reconfiguration has been designed and constructed. Partial bitstreams that can configure certain channels of the network controller without a ecting the functioning of others have been created. Experiments have been performed that quantify the manner in which, the performance of the controller can be changed by loading these partial bitstreams onto the FPGA. These experiments demonstrated the advantages of using partial reconfiguration to change network-related parameters at runtime to optimize performance of the network controller.<br>Master of Science
19
Ghaweta, Ahmad. "OPTIMAL DISTRIBUTION FEEDER RECONFIGURATION WITH DISTRIBUTED GENERATION USING INTELLIGENT TECHNIQUES." UKnowledge, 2019. https://uknowledge.uky.edu/ece_etds/134.
Full textAbstract:
Feeder reconfiguration is performed by changing the open/close status of two types of switches: normally open tie switches and normally closed sectionalizing switches. A whole feeder or part of a feeder may be served from another feeder by closing a tie switch linking the two while an appropriate sectionalizing switch must be opened to maintain the radial structure of the system. Feeder reconfiguration is mainly aiming to reduce the system overall power losses and improve voltage profile. In this dissertation, several approaches have been proposed to reconfigure the radial distribution networks including the potential impact of integrating Distributed Energy Resources (DER) into the grid. These approaches provide a Fast-Genetic Algorithm “FGA” in which the size and convergence speed is improved compared to the conventional genetic algorithm. The size of the population matrix is also smaller because of the simple way of constructing the meshed network.
Additionally, FGA deals with integer variable instead of a binary one, which makes FGA a unique method. The number of the mesh/loop is based on the number of tie switches in a particular network. The validity of the proposed FGA is investigated by comparing the obtained results with the one obtained from the most recent approaches. The second the approach is the implementation of the Differential Evolution (DE) algorithm. DE is a population-based method using three operators including crossover, mutation, and selection. It differs from GA in that genetic algorithms rely on crossover while DE relies on mutation. Mutation is based on the differences between randomly sampled pairs of solutions in the population. DE has three advantages: the ability to find the global optimal result regardless of the initial values, fast convergence, and requirement of a few control parameters. DE is a well-known and straightforward population-based probabilistic approach for comprehensive optimization.
In distribution systems, if a utility company has the right to control the location and size of distributed generations, then the location and size of DGs may be determined based on some optimization methods. This research provides a promising approach to finding the optimal size and location of the planned DER units using the proposed DE algorithm. DGs location is obtained using the sensitivity of power losses with respect to real power injection at each bus. Then the most sensitive bus is selected for installing the DG unit. Because the integration of the DG adds positive real power injections, the optimal location is the one with the most negative sensitivity in order to get the largest power loss reduction. Finally, after the location is specified, the proposed Differential Evolution Algorithm (DEA) is used to obtain the optimal size of the DG unit. Only the feasible solutions that satisfy all the constraints are considered.
The objective of installing DG units to the distribution network is to reduce the system losses and enhance the network voltage profile. Nowadays, these renewable DGs are required to equip with reactive power devices (such as static VAR compensators, capacitor banks, etc.), to provide reactive power as well as to control the voltage at their terminal bus. DGs have various technical benefits such as voltage profile improvement, relief in feeder loading, power loss minimization, stability improvement, and voltage deviation mitigation. The distributed generation may not achieve its full potential of benefits if placed at any random location in the system. It is necessary to investigate and determine the optimum location and size of the DG. Most distribution networks are radial in nature with limited short-circuit capacity. Therefore, there is a limit to which power can be injected into the distribution network without compromising the power quality and the system stability. This research is aiming to investigate this by applying DG technologies to the grid and keeping the system voltage within a defined boundary [0.95 - 1.05 p.u]. The requirements specified in IEEE Standard 1547 are considered.
This research considers four objectives related to minimization of the system power loss, minimization of the deviations of the nodes voltage, minimization of branch current constraint violation, and minimization of feeder’s currents imbalance. The research formulates the problem as a multi-objective problem. The effectiveness of the proposed methods is demonstrated on different revised IEEE test systems including 16 and 33-bus radial distribution system.
20
Mahr, Philipp. "Resource efficient communication in network-based reconfigurable on-chip systems." Phd thesis, Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2012/5991/.
Full textAbstract:
The constantly growing capacity of reconfigurable devices allows simultaneous execution of complex applications on those devices. The mere diversity of applications deems it impossible to design an interconnection network matching the requirements of every possible application perfectly, leading to suboptimal performance in many cases. However, the architecture of the interconnection
network is not the only aspect affecting performance of communication. The
resource manager places applications on the device and therefore influences
latency between communicating partners and overall network load. Communication protocols affect performance by introducing data and processing overhead putting higher load on the network and increasing resource demand.
Approaching communication holistically not only considers the architecture
of the interconnect, but communication-aware resource management, communication protocols and resource usage just as well. Incorporation of different
parts of a reconfigurable system during design- and runtime and optimizing
them with respect to communication demand results in more resource efficient communication. Extensive evaluation shows enhanced performance and flexibility, if communication on reconfigurable devices is regarded in a holistic fashion.<br>Die Leistungsfähigkeit rekonfigurierbarer Rechensysteme steigt kontinuierlich
und ermöglicht damit die parallele Ausführung von immer mehr und immer
größeren Anwendungen. Die Vielfalt an Anwendungen macht es allerdings
unmöglich ein optimales Kommunikationsnetzwerk zu entwickeln, welches die
Anforderung jeder denkbaren Anwendung berücksichtigt. Die Performanz des
rekonfigurierbaren Rechensystems sinkt. Das Kommunikationsnetzwerk ist jedoch nicht der einzige Teil des Systems, der Einfluss auf die Kommunikation-
sperformanz nimmt. Die Ressourcenverwaltung des Systems beeinflusst durch
die Platzierung der Anwendungen die Latenz zwischen Kommunikationspartnern und die Kommunikationslast im Netzwerk. Kommunikationsprotokolle
beeinträchtigen die Performanz der Kommunikation durch Daten und Rechen-
overhead, die ebenso zu erhöhter Netzwerklast sowie Ressourcenanforderungen
führen.
In einem ganzheitlichen Kommunikationsansatz wird nicht nur das Kommunikationsnetzwerk berücksichtigt, sondern außerdem Ressourcenverwaltung,
Kommunikationsprotokolle und die anderweitige Verwendung vorhandener,
temporär ungenutzter Kommunikationsressourcen. Durch Einbeziehung dieser
Aspekte während Entwurfs- und Laufzeit und durch Optimierung unter Berücksichtigung der Kommunikationsanforderungen, wird eine ressourceneneffizien
tere Kommunikation erreicht. Ausführliche Evaluationen zeigen, dass eine
ganzheitliche Betrachtung von Kommunikationsfaktoren, Verbesserungen von
Performanz und Flexibilität erzielt.
21
Zhang, Boyi. "Distribution network automation for multi-objective optimisation." Thesis, University of Manchester, 2018. https://www.research.manchester.ac.uk/portal/en/theses/distribution-network-automation-for-multiobjective-optimisation(4d04be21-2ac5-4891-8bcf-9b8ed6532043).html.
Full textAbstract:
Asset management and automation are acknowledged by distribution utilities as a useful strategy to improve service quality and reliability. However, the major challenge faced by decision makers in distribution utilities is how to achieve long-term return on the projects while minimising investment and operation costs. Distribution automation (DA) in terms of transformer economic operation (TEO), distribution network reconfiguration (DNR), and sectionalising switch placement (SSP) is recognised as the most effective way for distribution network operators (DNOs) to increase operation efficiency and reliability. Automated tie-switches and sectionalising switches play a fundamental role in distribution networks. A method based on the Monte Carlo simulation is discussed for transformer loss reduction, which comprises of profile generators of residential demand and a distribution network model. The ant colony optimisation (ACO) algorithm is then developed for optimal DNR and TEO to minimise network loss. An ACO algorithm based on a fuzzy multi-objective approach is proposed to solve SSP problem, which considers reliability indices and switch costs. Finally, a multi-objective ant colony optimisation (MOACO) and an artificial immune systems-ant colony optimisation (AIS-ACO) algorithm are developed to solve the reconfiguration problem, which is formulated within a multi-objective framework using the concept of Pareto optimality. The performance of the optimisation techniques has been assessed and illustrated by various case studies on three distribution networks. The obtained optimum network configurations indicate the effectiveness of the proposed methods for optimal DA.
22
Ali, Zazou Abdelkrim. "Conception d'un outil d'optimisation dynamique du schéma d'exploitation du réseau de distribution d'électricité de SRD." Thesis, Chasseneuil-du-Poitou, Ecole nationale supérieure de mécanique et d'aérotechnique, 2017. http://www.theses.fr/2017ESMA0010.
Full textAbstract:
Le réseau de distribution électrique français, construit dans une optique de desserte d'électricité depuis les centrales de production en amont, vers les consommateurs en aval, est aujourd'hui le lieu de transits d'énergie multi-sens et dont la charge instantanée dépend à la fois des consommations et des productions locales. Il faut donc moderniser les modèles d'exploitation des réseaux actuellement utilisés.C'est dans ce contexte que le gestionnaire du réseau de distribution de la Vienne SRD, et les différentes équipes du laboratoire LIAS, ont cherché à mettre en place un outil d'optimisation des schémas d'exploitation des réseaux de distribution d'électricité de la VIENNE.Dans cette thèse, le trnvt1il s'est porté principalement sur la modélisation du problème et non sur les méthodes de résolution. En effet, le contexte industriel du développement de l'outil d'optimisation du réseau a permis de se rapprocher au mieux de la réalité des informations disponibles concernant le réseau électrique. Et il est apparu plus pertinent d'utiliser des méthodes de résolution exactes tout en recherchant à simplifier le modèle complexe de représentation du réseau électrique. Ainsi,un modèle simple d'optimisation basé sur le problème de Bot à coût minimum a été mis en place et une étude comparative a été réalisée avec les modèles complexes présents dans la littérature.Ce premier modèle a été reformulé et rendu convexe et quadratique, et permet ainsi d'obtenir des performances supérieures en terme de temps de résolution à solution égale. Le problème d'optimisation simplifié a aussi été élaboré pour permettre de prendre en compte un horizon de temps dans l'optimisation du réseau électrique', afin de prendre en compte des profils de consommation et de production au cours du temps. En effet, ceci permet ainsi de prendre en compte des variations liées au comportement des consommateurs et des producteurs reliés au réseau.Et pour finir. ces modèles d'optimisation ayant pour objectif d'être inséré dans un outil d'aide à la décision pour une utilisation dans un contexte industriel. différentes contraintes liées à l'exploitation des réseaux électriques ont été insérées au modèle.Différents cas d'études issus de la littérature sont présentés pour valider la pertinence du modèle au regard des méthodes existantes. Nous avons pu expérimenter en simulation notre optimisation de réseau sur données de réseaux réels, ce qui a démontré l'applicabilité de la démarche à des problèmes de tailles importantes correspondant à la réalité du réseau électrique de SRD<br>The French electrical distribution network was originally built to bring electricity from very large producers to consumers, but it has now become a place of multi-directional energy flows that rely on local production and consumption. Because of this new situation, the way of operating electrical networks needs to be renewed. In light of this, the local Distribution System Operator (SRO) of the French department Vienne and the different teams of the LIAS laboratory have worked together on the development of a distribution network configuration optimization tool. In this thesis the majority of the work was focused on the modeling part of the problem rather than on the development of new optimization methods. The industrial root of this project gave the opportunity to be very close to the reality of the available network data. Based on those observations,it was more consistent to use exact and precise optimization methods to solved simplified versions of the complex electrical network models.Thus a simple optimization model based on the minimum cost flow problem was developed, and a comparative study between the developed model and state of the art more complex one was led. This simple model was reformulated to become convex and quadratic and to reach better resolution time performances with the same solutions. This optimization problem was developed to take into account a time horizon factor into the optimization of the operation planning of the distribution network. The time horizon factor aim to represent the production and consumption variation over a selected period. Finally. because this model has to be integrated into a decision making helping tool that will be used by the DSO SRD several operational constraints were added into the optimization model. Several state of the art case studies arc presented to validate the model accuracy regarding existing methods. Simulation experiments were done on real networks data to show the applicability of the proposed optimization model over large scale case studies which correspond to the DSO SRO reality
23
Lalevée, André. "Towards highly flexible hardware architectures for high-speed data processing : a 100 Gbps network case study." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2017. http://www.theses.fr/2017IMTA0054/document.
Full textAbstract:
L’augmentation de la taille des réseaux actuels ainsi que de la diversité des applications qui les utilisent font que les architectures de calcul traditionnelles deviennent limitées. En effet, les architectures purement logicielles ne permettent pas de tenir les débits en jeu, tandis que celles purement matérielles n’offrent pas assez de flexibilité pour répondre à la diversité des applications. Ainsi, l’utilisation de solutions de type matériel programmable, en particulier les Field Programmable Gate Arrays (FPGAs), a été envisagée. En effet, ces architectures sont souvent considérées comme un bon compromis entre performances et flexibilité, notamment grâce à la technique de Reconfiguration Dynamique Partielle (RDP), qui permet de modifier le comportement d’une partie du circuit pendant l’exécution. Cependant, cette technique peut présenter des inconvénients lorsqu’elle est utilisée de manière intensive, en particulier au niveau du stockage des fichiers de configuration, appelés bitstreams. Pour palier ce problème, il est possible d’utiliser la relocation de bitstreams, permettant de réduire le nombre de fichiers de configuration. Cependant cette technique est fastidieuse et exige des connaissances pointues dans les FPGAs. Un flot de conception entièrement automatisé a donc été développé dans le but de simplifier son utilisation.Pour permettre une flexibilité sur l’enchaînement des traitements effectués, une architecture de communication flexible supportant des hauts débits est également nécessaire. Ainsi, l’étude de Network-on-Chips dédiés aux circuits reconfigurables et au traitements réseaux à haut débit.Enfin, un cas d’étude a été mené pour valider notre approche<br>The increase in both size and diversity of applications regarding modern networks is making traditional computing architectures limited. Indeed, purely software architectures can not sustain typical throughputs, while purely hardware ones severely lack the flexibility needed to adapt to the diversity of applications. Thus, the investigation of programmable hardware, such as Field Programmable Gate Arrays (FPGAs), has been done. These architectures are indeed usually considered as a good tradeoff between performance and flexibility, mainly thanks to the Dynamic Partial Reconfiguration (DPR), which allows to reconfigure a part of the design during run-time.However, this technique can have several drawbacks, especially regarding the storing of the configuration files, called bitstreams. To solve this issue, bitstream relocation can be deployed, which allows to decrease the number of configuration files required. However, this technique is long, error-prone, and requires specific knowledge inFPGAs. A fully automated design flow has been developped to ease the use of this technique. In order to provide flexibility regarding the sequence of treatments to be done on our architecture, a flexible and high-throughput communication structure is required. Thus, a Network-on-Chips study and characterization has been done accordingly to network processing and bitstream relocation properties. Finally, a case study has been developed in order to validate our approach
24
Morell, Jared Anthony. "Adaptive Resizing of Deadline-Driven Requests for Provisioning Traffic in Elastic Optical Networks." Miami University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=miami1375629976.
Full text
25
Hoang, Van Trinh. "Design under constraints of Dependability and Energy for Wireless Sensor Network." Thesis, Lorient, 2014. http://www.theses.fr/2014LORIS351/document.
Full textAbstract:
Le contexte incertain dans lequel évoluent les applications embarquées influencefortement ces dernières. L'objectif de disponibilité induit généralement une forteredondance matérielle et fonctionnelle. A l'inverse, le paramètre de consommation prôneun nombre et un fonctionnement à minima des ressources. Avec la réduction de latechnologie, la variabilité des procédés de fabrication induit la possibilité accrue dedéfaillances. De façon à garantir une qualité de service acceptable par l'utilisateur, et cesur la totalité de la durée de vie du circuit, il convient de mener des études associant dèsles phases amont les deux paramètres sûreté de fonctionnement et consommation. Cettethèse a pour objectif de proposer une nouvelle conception pour les réseaux de capteurssans fil, afin de réduire consommation d'énergie et d'augmenter la fiabilité du réseau<br>The uncertain contexts in which recent WSN embedded applications evolve have bigimpact on these applications. Traditionally, the objective of availability generally doubleshardware and functional redundancy; it means that the overhead is doubled in term ofenergy and cost. Besides, wireless node system is powered by limited battery; hencepower consumption parameter is only set to a number of components and functionalitiesat minimum resources. However, due to the technology reduction, process variabilityconducts to increase the possibility of failures. In order to guarantee an acceptablequality of service for the users, and on the operating lifetime of the system, it should carrystudies at the upper phases involving both dependability and consumption constraints.This thesis aims to propose novel design for wireless sensor networks, in order to reduceenergy consumption and to increase network dependability
26
Diamanti, Alessio. "Une nouvelle architecture d'automatisation des réseaux : de la détection d'anomalie à la reconfiguration dynamique." Thesis, Paris, HESAM, 2021. http://www.theses.fr/2021HESAC036.
Full textAbstract:
Les technologies de softwarisation des réseaux entraînent de nouvelles architectures de réseau qui remettent en question les systèmes de gestion des défaillance existants et la caractérisation de la résilience. En effet, la coordination entre les différents composants logiciels pour, par exemple, l’orchestration, la commutation et la gestion des machines virtuelles et des conteneurs, implique différents points de supervision et de nouvelles sources de défaillance et de bogues. Dans cette thèse, nous proposons un framework d’automatisation de réseau qui détecte les anomalies et caractérise l’état de résilience d’un service de réseau virtualisé. Un algorithme bas´e sur les Long Short Term Memory Autoencoder analyse une série temporelle multidimensionnelle construite à partir de centaines de métriques collectées au niveau des couches physique, virtuelle et de service. Il apprend les conditions de fonctionnement nominales de l’infrastructure, sur la base desquelles les déviations (anomalies) par rapport à la référence apprise sont détectées et analysées. Le framework produit une caractérisation des déviations utilisée pour élaborer le graphe d’état et la visualisation sous forme de radiographie. Tandis que cette dernière visualise de manière compacte la propagation des anomalies à travers les trois couches composant un réseau virtualisé, le graphe d’état vise à établir l’état de résilience de la plateforme comme base d’un algorithme de réorchestration qui s’appuie sur une nouvelle technique de gestion de la résilience basée sur la réputation. Le framework est implémenté et validé par des tests expérimentaux sur la plateforme Kubernetes hébergeant un services de coeur de réseau virtualisé conteneurisé et open-source<br>Legacy and novel network services are expected to be migrated and designedto be deployed in fully virtualized environments which lead to novel network architecturesthat challenge legacy fault management systems and resilience characterization. Indeed, thecoordination among the different software components for, e.g., orchestration, switching, andvirtual machine and container management creates different monitoring points, besides novelsources of faults and bugs. In this thesis, we propose a network automation framework thatdetects anomalies and characterizes the resiliency state of a virtualized network service. ALong-Short-Term-Memory-Autoencoder-based algorithm analyzes a multidimensional timeseriesbuilt from hundreds of metrics collected at the physical, virtual, and service layers.It learns the nominal working conditions of both the infrastructure and the service, and foreach type of resource (i.e., CPU, network, memory, and disk); it then detects and analyzesdeviations (anomalies) from the learned reference. The produced deviations characterizationis finally used to generate both the transition state graph and the innovative radiographyvisualization. The latter compactly visualizes the propagation of anomalies across all thelayers down from the physical and up to the service, highlighting the temporal evolutionas well. The former aims at establishing the virtualized platform state as the basis for are-orchestration algorithm that leverages a novel reputation-based resiliency managementtechnique. We implement and validate the proposed framework through experimental tests onthe Kubernetes platform hosting a containerized, open-source, and virtualized network core service
27
Ragavan, Rengarajan. "Reconfigurable FSM for Ultra-Low Power Wireless Sensor Network Nodes." Thesis, Linköpings universitet, Elektroniska komponenter, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-100121.
Full textAbstract:
Wireless sensor networks (WSN) play an important role in today’s monitoring and controlsystems like environmental monitoring, military surveillance, industrial sensing and control, smarthome systems and tracking systems. As the application of WSN grows by leaps and bounds, there is anincreasing demand in placing a larger number of sensors and controllers to meet the requirements. Theincreased number of sensors necessitates flexibility in the functioning of nodes. Nodes in wirelesssensor networks should be capable of being dynamically reconfigured to perform various tasks is theneed of the hour.In order to achieve flexibility in node functionality, it is common to adopt reconfigurablearchitecture for WSN nodes. FPGA-based architectures are popular reconfigurable architectures bywhich WSN nodes can be programmed to take up different roles across time. Area and power are themajor overheads in FPGA based architectures, where interconnect consumes more power and area thanlogic cells. The contemporary WSN standard requires longer battery life and micro size nodes for easyplacement and maintenance-free operation for years together.Three solutions have been studied and evaluated to approach this problem: 1) Homogenousembedded FPGA platform, 2) Power gated reconfigurable finite state machines and 3) Pass transistorlogic (PTL) based reconfigurable finite state machines. Embedded FPGA is a CMOS 65nm customdeveloped small homogenous FPGA which holds the functionality of the WSN nodes and it will bedynamically reconfigured from time to time to change the functionality of the node. In Power gatedreconfigurable FSM architecture, the functionality of the node is expressed in the form of finite statemachines, which will be implemented in a LUT based power gated design. In PTL based reconfigurablefinite state machine architecture, the finite state machines are completely realized using PTL basedcustom designed sets of library components. Low power configuration memory is used to dynamicallyreconfigure the design with various FSMs at different times.
28
Dafali, Rachid. "Conception des réseaux sur puce reconfigurables dynamiquement." Lorient, 2011. http://www.theses.fr/2011LORIS233.
Full textAbstract:
Ce travail de thèse porte sur la problématique des communications entre les unités detraitement ou de stockage d’un système reconfigurable sur puce (RSoC). Notre approche repose sur l’intégration de mécanismes de reconfiguration dynamiquedans les réseaux sur puce afin de répondre aux difficultés croissantes de prédiction a priori du trafic au sein des futurs systèmes sur puce. Ainsi, l’objectif est de conférer auNoC des propriétés d’auto-configuration lui permettant de s’adapter en temps réel, aux besoins réels et variables de chaque unité de traitement en termes de qualité de service etde type de transfert. Cette thèse propose deux approches pour rendre le NoC adaptatif. La première reposesur un concept de mémoires tampons configurables dynamiquement qui permet d’adapter la profondeur des FIFOs dans les interfaces réseau en temps réel et selon les besoins des communications. La seconde approche propose une table TDMA configurable dynamiquement, qui adapte le nombre d’intervalles de temps alloués aux communications selon les besoins tout en conservant la propriété de trafic garanti. Ce travail a également consisté à développer un nouvel environnement de CAO, μSpider II, pour automatiser le flot de conception. Celui-ci est constitué de plusieurs outils qui permettent l’exploration, l’optimisation, la génération de la description matérielle du NoC, et la simulation de son fonctionnement et ses performances. L’ensemble des approches ont été validées avec des expériences et implantations sur FPGA qui intègrent les différentes versions du NoC μSpider II au sein d’architectures multiprocesseurs<br>This work addresses the issue of communications between processing or storage units within reconfigurable system on chip. Our approach relies on the implementation of reconfiguration mechanisms in Network. On Chips (NoC) in order to solve the increasing problem of traffic variability in future RSoC. Thus, the objective is to provide the NoC with self-adaptitvity properties so that it can adapt at run-time to real and variable communication requirements of processing and storage units. This thesis proposes two original and efficient mechanisms of reconfiguration. The first one relies on the concept of dynamically reconfigurable memory buffers that allow forthe runtime adaptation of FIFO depths in Network Interfaces according to communication needs. The second one is complementary and controls the TDMA table which is dynamically reconfigurable, it can adapt the number of time slots allocated to different communications according to real bandwidth needs while preserving guaranteed traffic property. This work also consists in developing a new CAD environment, μSpider II, to automize the design flow. This framework is composed of various associated tools that perform exploration, optimization and VHDL code generation, it also provides material for test and performances evaluation. Both approaches have been validated with expe- riments and implementations on FPGA with different versions of the μSpider II NoC with multiprocessor archite
29
Kidane, Hiliwi Leake. "Run-time scalable NoC for virtualized FPGA based accelerators as cloud services." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCK032.
Full textAbstract:
Ces dernières années, les fournisseurs de cloud et les centres de données ont intégrés les FPGA dans leur environnement à des fins d'accélération. Cela est dû au fait que les accélérateurs à base de FPGA sont connus pour leur faible puissance et leurs bonnes performances par watt. En outre, l'introduction de la capacité de reconfiguration partielle dynamique (DPR) de certains FPGA incite les chercheurs de l'industrie et des universitaires à proposer des services de cloud FPGA virtualisés baser sur DPR. Dans la plupart des travaux existants, l'interconnexion entre les vFPGA repose soit sur les réseaux BUS ou OpenFlow. Cependant le bus et OpenFlow ne sont pas des solutions optimales pour la virtualisation.Dans cette thèse, nous avons proposé un NoC évolutif à l'exécution pour les accélérateurs basés sur FPGA virtualisés dans un cloud computing. Les composants NoC s'adapteront dynamiquement aux nombres d'accélérateurs virtualisés actifs en ajoutant et en supprimant des sous-noC. Pour minimiser la complexité de la conception de l'architecture NoC à un niveau inférieur (implémentation HDL), nous avons proposé un langage de modélisation unifié de haut niveau (UML) basé sur une ingénierie dirigée par les modèles. Une approche basée sur UML / MARTE et IP-XACT est utilisée pour définir les composants de la topologie NoC de haut niveau et générer les fichiers HDL requis. Les résultats des expériences montrent que le NoC évolutif à l'exécution peut réduire la consommation d'énergie de 17%. La caractérisation NoC sur la modélisation de haut niveau basée sur MDE réduit également le temps de conception de 25%<br>In the last few years, cloud providers and data centers have been integrating FPGAs in their environment for acceleration purpose. This is due to the fact that FPGA based accelerator are known for their lower power and good performance per watt. Moreover, the introduction of the ability for dynamic partial reconfiguration (DPR) of some FPGAs trigger researchers in both industry and academics to propose DPR based virtualized FPGA (vFPGA) cloud services. In most of the existing works, the interconnection between the vFPGAs relies either on BUS or OpenFlow networks. However, both the bus and OpenFlow are not virtualization-aware and optimal solutions. In this thesis, we have proposed a virtualization-aware dynamically scalable NoC for virtualized FPGA accelerators in cloud computing. The NoC components will adapt to the number of active virtualized accelerator dynamically by adding and removing sub-NoCs. To minimize the complexity of NoC architecture design at a low level (HDL implementation), we have proposed a Model-Driven Engineering (MDE) based high-level unified modeling language (UML). A UML/MARTE and IP-XACT based approach are used to define the NoC Topology components at a high-level and generate the required HDL files. Experiment results show that the dynamically scalable NoC can reduce the power consumption by 17%. The MDE based high-level modeling based NoC characterization also reduce the design time by 25%
30
Stebbings, H. "Business process resource networks : a multi-theoretical study of continuous organisational transformation." Thesis, Cranfield University, 2016. http://dspace.lib.cranfield.ac.uk/handle/1826/10182.
Full textAbstract:
Drawing on multiple theoretical lenses, this research studies continuous transformation, or ‘morphing’, of a business process resource network (BPRN). The aim is to further our understanding of continuous organisational change at the lowest levels of analysis within an organisation: that is, at the resource level, and that resource’s relationships to other resources as they exist within a BPRN.
Data was gathered from a single, in depth case study. Analysis was achieved by means of mapping BPRN evolution using ‘temporal bracketing’, ‘visual’ and ‘narrative’ approaches (Langley, 1999). The analysis revealed two mechanisms that appear to govern microstate morphing: bond strength and stakeholder expectation. In addition, four factors emerged as important: environmental turbulence, timing and timeliness of changes, concurrency of changes, and enduring business logic.
An emergent model of microstate morphing which acknowledges the importance of socio-materiality in actor network morphogenesis (ANM) is presented. This study shows how effective relationships and configuration of resources within the BPRN can be achieved to facilitate timely, purposeful morphing. Five propositions are offered from the emergent ANM model. Specifically, these relate to the conditional operating parameters and the identified generative mechanisms for continuous organisational transformation within the BPRN.
Implications for practice are significant. A heuristic discussion guide containing a series of questions framed around the ANM model to highlight the challenges of microstate morphing for practitioners is proposed.
Two routes for future research are suggested: replication studies, and quantifying BPRN change in relation to an organisation’s environment using a
ii
survey instrument and inferential statistical analysis based on the ANM model features and propositions.
31
Ghyoot, Michaël. "Le concepteur et les matériaux de construction: éléments de réflexion pour une reconfiguration des circuits de l'économie matérielle par les pratiques architecturales contemporaines." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209238.
Full textAbstract:
Cette recherche s'intéresse aux matériaux de construction et aux architectes. Elle explore les circuits le long desquels circulent les matériaux et étudie les dispositifs dont ils sont munis pour rendre cette circulation possible. Elle se penche sur les rôles que jouent et sur ceux que pourraient jouer les concepteurs au sein de ces circuits et en regard de ces dispositifs.<p>Ce travail s'inscrit dans le cadre d'une réflexion sur les pratiques de l'aménagement de l'espace bâti. Au cours de son trajet entre son site de production et celui de sa mise en œuvre (c'est-à-dire le chantier de construction) – et même au-delà, lorsqu'une transformation libère des éléments constructifs – un matériau passe par de nombreuses étapes. Parmi toutes celles-ci, le passage par le moment de la conception est un élément central de cette recherche (même si d'autres étapes seront également explorées au fil de pages de ce travail). Quels rôles les concepteurs jouent-ils au sein de ces vastes assemblages d'acteurs et de dispositifs qui se déploient le long des trajectoires des matériaux de construction ? Comment les concepteurs sont-ils affectés par ces assemblages et comment peuvent-ils les affecter en retour ?<p>Répondre à ces questions engage une exploration des principales trajectoires des matériaux de construction et un examen attentif des dispositifs dont ils sont munis au fil de ce processus. C'est ce à quoi s'attache la première partie de cette recherche, dont la portée est plutôt descriptive. Mais elle ne s'arrête pas à ce stade. Elle comporte également une seconde partie, plus prospective et critique. Cette recherche propose en effet d'explorer certaines pistes de reconfiguration au sein de ces assemblages. Elle examine plusieurs questions touchant aux limites des circuits de l'économie matérielle : par quelles modifications faudrait-il en passer pour que des matériaux actuellement exclus des circuits les plus courants de l'économie matérielle puissent malgré tout y circuler ? D'autres arrière-plans axiologiques pourraient-ils être mis en jeu dans les circuits de l'économie matérielle ?<p>La présente recherche repose sur l'hypothèse que les concepteurs peuvent effectivement contribuer à la transformation progressive des circuits de l'économie matérielle. Ils ont vraisemblablement un rôle à jouer dans la possibilité d'ouvrir ces circuits à de nouveaux matériaux, et de contribuer ainsi à établir des pratiques plus à même de répondre aux enjeux écologiques et politiques auxquels sont confrontés notre planète et ses habitants. Bien sûr, les concepteurs n'ont pas l'exclusivité de tels changements. D'autres acteurs peuvent, et même doivent, participer à de tels efforts. Ce sont pourtant principalement les concepteurs qui retiendront l'attention de cette recherche. Il s'agit dans ce cadre d'explorer les conditions d'un tel changement, et ce tant d'un point de vue méthodologique que d'un point de vue pratique.<p>/<p>This research investigates the relation between construction materials and architects. It examines the circuits along which the materials circulates and it studies the devices that are embedded in the materials in order to render this circulation feasible. It looks into the roles that are played, and those that could be played, by the designers within these circuits and in regard with these devices.<p>This work is part of a reflection on the practices of designing and constructing the built environment. During its journey between its production site and that of its implementation (i.e. the construction site) – and even beyond, when a transformation frees again constructive elements – a construction material travels through many steps. Among all these, the passage through the design process is a key element. What role do the designers perform within these networks of actors and devices? How are they affected by these assemblages and how can they affect them in return?<p>Answering these questions undertakes an exploration of the main trajectories of construction materials and of the devices that are embedded throughout these processes. This is the topic of the first part of the research. At this point, the scope is mainly descriptive. But the research goes further: it also involves a more critical and prospective dimension. It proposes indeed to discuss several possible reconfigurations within these assemblages. What would be necessary in order to include new materials that are currently excluded from the main circuits of material economy? Could other axiological backgrounds be represented within these circuits?<p>This research is based on the assumption that designers can effectively contribute to the gradual transformation of the circuits of material economy. They can probably help alternative materials to circulate in more standard circuits, and thus help to establish new practices that are more likely to respond to environmental and social issues. Of course, the designers do not have a monopoly on such changes. Other actors may, and even must, participate in such efforts. Yet, the main focus of this research is the designer. It explores the conditions of such a change, both from a methodological and practical perspective.<br>Doctorat en Art de bâtir et urbanisme<br>info:eu-repo/semantics/nonPublished
32
Pfitscher, Luciano Lopes. "Reconfiguração automáticas das redes de distribuição de energia elétrica com monitoramento em tempo real." Universidade Federal de Santa Maria, 2013. http://repositorio.ufsm.br/handle/1/3684.
Full textAbstract:
In normal operation, the reconfiguration of distribution network can reduce losses,
balance loads and improve quality indicators. The increasing use of remote controlled
equipment in power systems leads the development of more efficient techniques for automatic
reconfiguration of network, being particularly important in Smart Grid applications. This
thesis presents a methodology and system for automatic reconfiguration of distribution
network in real time. The optimization of the network performance is based on a heuristic
method and multicriterial analysis. The work relies on the AHP (Analytic Hierarchy Process)
method to define weights for the optimization criteria and to determine the best switching
sequence for the network. In addition, the analysis of the technical feasibility of connecting
feeders in parallel during the reconfiguration is also considered, focusing on determining
transient constraints. The method assumes that only the remote controlled switches are
analyzed. The developed algorithms are integrated into a supervisory system, which allows
real time measurements and commands to the equipment. The proposed methodology was
validated with data from a real network of a power utility.<br>Em regime normal de operação, a reconfiguração de redes de distribuição permite
reduzir perdas, balancear cargas e melhorar indicadores de qualidade. Com o aumento do uso
de equipamentos telecomandados nos Sistemas de Potência, torna-se viável o
desenvolvimento de sistemas que permitam que a reconfiguração da rede seja feita de forma
automática. Essa abordagem vem ao encontro de técnicas atualmente aplicadas nas Redes
Elétricas Inteligentes, ou Smart Grids. Este trabalho apresenta um sistema de reconfiguração
automática de redes de distribuição, em tempo real, baseado em um método heurístico para
determinação da melhor configuração. O método parte da premissa de que apenas as chaves
telecomandadas são consideradas na análise. O método de análise multicriterial AHP
(Analytic Hierarchy Process) é empregado para definir pesos para os critérios de otimização e
determinar a melhor sequência de chaveamentos na rede. A análise da viabilidade técnica de
ligação de alimentadores em paralelo durante a reconfiguração é abordada, com enfoque nas
respostas em regime transitório e permanente do sistema. Os algoritmos desenvolvidos são
integrados a um Sistema Supervisório, que permite monitorar dados em tempo real e aplicar
os comandos de abertura e fechamento de chaves automaticamente. A metodologia proposta
foi validada com dados de uma rede real de uma concessionária de energia elétrica.
33
Яценко, Олексій Валерійович. "Оптимізація процесів розподілу енергії в системах з локальними джерелами генерування та акумулювання". Master's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/40797.
Full textAbstract:
Магістерська дисертація присвячена розробці алгоритму, згідно якого,з метою зниження втрат активної потужності буде здійснюватися у реальному часі реконфігурація розподільної мережі, в складі якої є джерела розподіленої генерації. Для прийняття рішень по зміні топології мережі розроблено модель адаптивного прогнозування, яка на кожному кроці прогнозування обирає модель, що показала найкращу точність на попередньому кроці і яка враховує наявної інформації відносно електричного навантаження.
Методика вибору оптимальної конфігурації мережі була розроблена на основі класичної задачі вибору місць розмикання, але окрім мети керування режимом в режимі реального часу було враховано наявність в мережі джерел розподіленої генерації. В якості моделей прогнозування було обрано методи машинного навчання (для випадку достатньої інформаційної забезпеченості) і метод нечітких часових рядів (для випадку недостатньої інформаційної забезпеченості).
В результаті досліджено було визначено, що застосування алгоритму реконфігурації позитивно впливає на зниження втрат потужності і електричної енергії в мережі і він може використовуватисяоперативним персоналоменергетичних компаній.
Очікується, що результати досліджень суттєво сприятимуть подальшому розвитку задачі управління режимами розподільних мереж в реальному часі.<br>The master's thesis is devoted to the development of an algorithm according to which the real-time distribution network will be reconfigured, which includes distributed generation sources in order to reduce active power losses. To make decisions on changing the network topology, an adaptive forecasting model has been developed, which at each step of forecasting selects the model that showed the best accuracy and which takes into account the degree of information security according to the electrical load.
The method of selecting the optimal network configuration was developed on the basis of the classical problem of selecting break points, but for the real-time control problem, the availability of distributed generation sources was taken into account. Machine learning methods (for the case of sufficient information security) and the method of fuzzy time series (for the case of insufficient information security) were chosen as forecasting models.
As a result, it was investigated that the application of the reconfiguration algorithm has a positive effect on reducing power losses in the network and can be used for control personnel of substations.
It is expected that the results of the research will significantly contribute to the further development of the task of managing the modes of distribution networks in real time.
34
Theviot, Anaïs. "Mobiliser et militer sur Internet : reconfiguration des organisations partisanes et du militantisme au Parti Socialiste et à l'Union pour un Mouvement Populaire." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0231.
Full textAbstract:
La campagne pour l’élection présidentielle de 2012 a été marquée par le rôle majeur joué par Internet pour s’informer, débattre en ligne, mobiliser ou organiser l’action militante sur le terrain. Ce recours au numérique invite à questionner, sous un nouveau jour, des thématiques centrales de l’étude des partis politiques et à contribuer ainsi au débat sur les transformations partisanes, au niveau de l’organisation, mais aussi des acteurs qui s’y insèrent et l’utilisent. Cette étude comparative interroge les processus de recrutement des membres des équipes de campagne, les relations entre médias et professionnels de la communication politique, ainsi que les évolutions du militantisme<br>The 2012 French presidential campaign was marked by the Internet's prominent role in providing information, debating on-line, mobilizing, and organizing activists in the field. This turn to digital tools allows for a reexamination of central themes in the study of political parties, thereby contributing to the debate on party transformations in terms of organization as well as actors who get involved and use the tools. This comparative study examines the recruitment of campaign team members, relations between the media and political communications professionals, as well as changes in political activism
35
Sigurd, Karin. "Reconfiguration control in adaptive networks." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/16948.
Full textAbstract:
Includes bibliographical references (p. 159-162).<br>Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>(cont.) In the second setting, we propose a novel total field collision avoidance algorithm of magnetic nature which permits a set of vehicles to reconfigure successively without knowing each other's positions; strategic sensor positioning makes sure that the vehicles do not sense their own fields. Contributions of our research are a multiagent learning algorithm, a unified game theoretic framework for addressing reconfiguration problems, the identification of reconfiguration control as a problem common to several different fields but previously addressed with field-specific methods, the proposal of a definition of robustness in this context and, for the two trajectory planning settings in which our algorithm was implemented, two algorithms for distributed coordination and collision avoidance, respectively.<br>Distributed control systems are emerging as more robust and flexible alternatives to traditional control systems in several mechatronic fields such as satellite control and robotics. Instead of relying on one large unit with a centralized control architecture, one thus uses a parallel structure composed of many simple controllers collectively capable of performing the same task as the large unit. Reconfiguration control involves cooperation, coordination and mutual adaptation and is relevant in a number of engineering problems such as formation control, multiagent learning and role allocation. In addition to being a key issue for using the distributed control paradigm to its full potential, reconfiguration control also offers a well delimited framework for addressing a number of interesting theoretical questions in distributed control such as those related to the overlapping notions of cooperation and coordination. We propose a unified game theoretic approach to the problem of reconfiguration control which interprets node positions as strategies, identifies each configuration with the unique equilibrium of a game and sees reconfigurations as switches of games. Our approach is implemented in two different settings, both related to trajectory planning, and illustrated with simulation results. In the first setting, we propose replicator learning as a multiagent learning algorithm which is a generalization of the replicator dynamics and show convergence in any finite dimension I of the average strategy to any desired strategy as a function of the chosen game matrix. We show how this result can be linked to collective motion in a subspace of Rl-1 resulting in a successive visiting of a set of waypoints.<br>by Karin Sigurd.<br>Ph.D.
36
Narváez, Guarnieri Paolo L. (Paolo Lucas). "Routing reconfiguration in IP networks." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86482.
Full text
37
Xue, Quanhu Carleton University Dissertation Computer Science. "Reconfiguration of chordal ring networks." Ottawa, 1994.
Find full text
38
Тарнавський, Ярослав Валерійович. "Розробка моделі з нечітким методом вибору місця розмикання замкненої електричної мережі". Master's thesis, Київ, 2018. https://ela.kpi.ua/handle/123456789/25750.
Full textAbstract:
Магістерська дисертація складається з пояснювальної записки та графічної частини. Обсяг пояснювальної записки – 175 сторінок машинописного тексту. Пояснювальна записка містить 44 рисунка, 85 таблиць, 25 джерел використаної літератури. Графічна частина містить 8 аркушів технічних креслень форматом А1.
В даній магістерській дисертації виконано проектування районної мережі 110 кВ, проектування електричної частини підстанції 110/35/10 кВ, вибір та розрахунок релейного захисту для трансформатора. Проведено розробку методу для визначення оптимального місця розмикання електричної мережі з метою зменшення втрат електроенергії на основі нечіткої логіки.<br>The master's dissertation consists of an explanatory note and a graphic part. The explanatory note consists of 175 pages of typewritten text. The explanatory note contains 44 figures, 85 tables, 25 sources of used literature. The graphic part contains 8 sheets of A1 technical drawings.
The master's dissertation includes the design of the 110 kV district network, the design of the electrical part of the 110/35/10 kV substation, the selection and calculation of relay protection for the transformer. A method has been developed to determine the optimal location of the electrical circuit breakdown in order to reduce electricity losses based on fuzzy logic.
39
Ramos, Maicon Jaderson da Silveira. "Metodologia para análise da coordenação e seletividade de dispositivos de proteção durante reconfigurações de redes de distribuição." Universidade Federal de Santa Maria, 2014. http://repositorio.ufsm.br/handle/1/8546.
Full textAbstract:
With the emergence of the concept of Smart Grid (SG), the Power Distribution Systems are undergoing major changes in the way it is operated, studied and analyzed. The breakthrough technology of measurement, automation, control and telecommunication equipment, together with the reduction of the costs of acquisition and implementation, allowed Brazilian electric utilities to invest in automation, control and telecommunication, facing distribution networks. This technological development applied in the networks allows new studies and new methodologies to be developed and implemented by utilities in order to improve their technical and operational performance. Many studies are being conducted in order to propose automatic reconfiguration in the distribution networks, automatic restoration and distribution management system in real time, aiming to optimize the loads distribution, reduce energy losses, improve system reliability and the quality indicators of power supply, among other possible needs of the distribution company. Nowadays a fairly explored point is the switching through automatic devices, which have criteria and assumptions for execution in the network. Among the criteria and assumptions, there is the guarantee of coordination and selectivity of protective devices involved in the reconfiguration after switching and consequent topological change. The need for analysis of protective devices and possible reparameterization of them, justifies the development of a methodology through computational solution, able to analyze the coordination and selectivity of the devices (microprocessor reclosers) after network changes. It is due to this niche opportunities caused by technological development and changes in operating philosophy of distribution networks, that this dissertation has as main objective to develop a methodology to validate the operation condition of protective devices, ensuring the safety and system reliability and proposing new protection settings when needed, which consequently will allow network reconfigurations.<br>Com o surgimento do conceito de Smart Grid (SG), os Sistemas de Distribuição de Energia vêm sofrendo grandes modificações em sua forma de operação, estudo e análise. O grande avanço tecnológico dos equipamentos de medição, automação, controle e telecomunicação, aliado à redução dos custos de aquisição e implementação, permitiu que as distribuidoras brasileiras de energia elétrica realizassem grandes investimentos em automação, controle e telecomunicação, voltados para redes de distribuição. Este avanço tecnológico aplicado nas redes permite que novos estudos e novas metodologias sejam desenvolvidos e aplicados pelas concessionárias, a fim de melhorar o seu desempenho técnico operacional. Muitos estudos estão sendo realizados com o intuito de propor reconfigurações automáticas nas redes de distribuição, recomposição automática e gerenciamento do sistema em tempo real, sempre com o objetivo de otimizar a distribuição das cargas, reduzir as perdas de energia, melhorar a confiabilidade do sistema e os indicadores de qualidade do fornecimento de energia, entre outras possíveis necessidades da respectiva distribuidora. Atualmente um ponto bastante explorado são os chaveamentos através de dispositivos automatizados, os quais possuem critérios e premissas para efetivação em campo. Dentre os critérios e premissas, destaca-se a garantia da coordenação e seletividade dos equipamentos de proteção envolvidos na reconfiguração após a realização do chaveamento e consequente mudança topológica. A necessidade de análise dos dispositivos de proteção e possível reparametrização dos mesmos justifica o desenvolvimento de uma metodologia através de solução computacional, capaz de analisar a coordenação e seletividade dos dispositivos (religadores microprocessados), após mudanças na rede. É devido a este nicho de oportunidades causadas pelo desenvolvimento tecnológico e pelas mudanças na filosofia de operação das redes de distribuição, que esta dissertação tem por objetivo principal desenvolver uma metodologia que permita validar a condição de operação dos dispositivos de proteção, garantindo a segurança e a confiabilidade do sistema e propondo novos ajustes de proteção quando necessário, o que consequentemente permitirá reconfigurações de rede.
40
Baldine, Ilia. "Dynamic Reconfiguration in Broadcast WDM Networks." NCSU, 1998. http://www.lib.ncsu.edu/theses/available/etd-19980723-230505.
Full textAbstract:
<p>In this research we study the problems associated with dynamic reconfiguration of broadcast WDM networks.Adaptability to the changing traffic conditions is viewed as one of the key features of multiwavelength optical networks, and this is the first comprehensive in-depth study of this problem area.Our contribution consists of identifying the three main questions related to network reconfiguration: a) how to balance the load across multiple wavelengths; b) deciding when it is best to reconfigure the network and c) performing the actual reconfiguration in an efficient manner, that minimizes cell losses.We provide novel solutions to each of these problems.Our solutions consist of an algorithm we call GLPT, which balances the cell load across wavelengths, an optimal reconfiguration policy, derived from representing the problem as a Markovian Decision Process, and a class of retuning strategies that allow us to reconfigure the system.In addition, we perform a simulated comparison of static and dynamically reconfigurable networks in order to verify the validity of our approach.The simulation also provides us with valuable insights into the behavior of an adaptable optical network.<P>
41
Bueno, Edilson Aparecido. "Redução de perdas tecnicas atraves de reconfigurações de redes de distribuição de energia eletrica sob demandas variaveis." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261734.
Full textAbstract:
Orientadores: Christiano Lyra Filho, Celso Cavellucci<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-07T20:13:55Z (GMT). No. of bitstreams: 1
Bueno_EdilsonAparecido_M.pdf: 1593593 bytes, checksum: ff2749c689002cc1c4de48ee0899defc (MD5)
Previous issue date: 2005<br>Resumo: Este trabalho apresenta uma nova visão para o problema de redução das perdas técnicas em sistemas de distribuição de energia elétrica, através de reconfiguração de redes. A principal inovação consiste em abordar o problema com a consideração explícita das variações de demandas, mas impondo-se a restrição de que as configurações devem permanecer fixas ao longo do período de planejamento. Esta característica abre a perspectiva de que a metodologia venha a ser usada na operação diária dos sistemas de distribuição. No entanto, leva a um problema de otimização bem mais complexo do que o caracterizado pela visão tradicional. Formulações para demandas fixas e variáveis são desenvolvidas. Duas metodologias distintas para abordagem do novo problema são elaboradas. A primeira utiliza a metodologia denominada Busca Menor Energia, inspirada na técnica de Abertura Seqüencial de Chaves. A segunda técnica, denominada Árvore de Aproximação, faz uso das idéias de árvore geradora de custo mínimo. Ambas são combinadas com uma busca local, denominada Troca de Ramos Generalizada, baseada na técnica de Troca de Ramos. Explora-se também uma extensão da metodologia Árvore de Aproximação caracterizada por associação com conceitos do método GRASP (Greedy Randomized Adaptive Search Procedure). Estudos de casos ilustram a aplicação das metodologias em redes de cidades brasileiras<br>Abstract: This work presents a new point of view for the technical losses reduction problem in electric power distribution systems, through network reconfigurations. The main innovation is the explicit consideration of demand variations and the use of a fixed configuration during the planning period. This last characteristic makes the methodology able to be used in the daily operation of distribution systems. However, it leads to an optimization problem more complex than approaches without demand variations. Formulations for fixed and variable demands are created. Two distinct methodologies for the resolution of the new problem are elaborated. The first one uses the Minimum Energy Losses methodology, inspired by the ¿Sequential Switch Opening¿ technique. The last one, called Approximation Tree, is based on algorithms for the minimum spanning tree problem. Both of them are combined with a local search procedure, called Branch Exchange by Energy, based on the ¿Branch Exchange¿ technique. An extension of the Approximation Tree methodology is proposed by using concepts of the well-known GRASP method (Greedy Randomized Adaptive Search Procedure). Case Studies demonstrate the application of the methodologies in Brazilian cities¿ networks<br>Mestrado<br>Automação<br>Doutor em Engenharia Elétrica
42
Коваленко, Андрій Анатолійович. "Моделі та методи синтезу і реконфігурації архітектур комп'ютерних систем і мереж об'єктів критичного застосування". Thesis, Харківський національний університет радіоелектроніки, 2018. http://repository.kpi.kharkov.ua/handle/KhPI-Press/37690.
Full textAbstract:
Дисертація на здобуття наукового ступеня доктора технічних наук за спеціальністю 05.13.05 – комп'ютерні системи та компоненти. – Харківський національний університет радіоелектроніки, Національний технічний університет "Харківський політехнічний інститут", Міністерство освіти і науки України, Харків, 2018.
Дисертаційна робота присвячена вирішенню актуальної науково-прикладної проблеми забезпечення вимог з оперативності процесу обміну інформацією в комп'ютерних системах (КС) об'єктів критичного застосування (ОКЗ) на основі розробки математичного апарату (математичних моделей і методів) синтезу нових і реконфігурації існуючих архітектур комп'ютерних систем і мереж. Проведено аналіз стану проблеми, тенденцій розвитку КС ОКЗ, а також вимог до архітектур КС і мереж ОКЗ. В результаті встановлено, що на даний момент існуючі моделі та методи синтезу і реконфігурації КС ОКЗ не завжди призводять до забезпечення вимог з оперативності процесу обміну інформацією в КС і мережах (КСіМ) ОКЗ. Ця обставина визначає необхідність удосконалення відповідного класичного математичного інструментарію для підвищення оперативності передачі інформації. Розроблено комплекс методів багатопараметричного синтезу архітектур КСіМ ОКЗ, який оптимізує витрати на побудову компонентів КС об'єкту критичного застосування, котрі забезпечують виконання вимог з оперативності. Дістала подальшого розвитку модель процесу розподілу задач по компонентах розподіленої КС ОКЗ, що дозволяє при великих розмірностях суттєво прискорити рішення відповідної задачі оптимізації. Розроблено комплекс моделей еволюції архітектур комп'ютерних мереж (КМ) ОКЗ, що дозволяє виконати прогноз змін архітектури мережі протягом фіксованого часового інтервалу. Розроблено комплекс методів реконфігурації КМ ОКЗ, що дозволяє скорегувати множину параметрів функціонування бездротових компонентів мережі для зменшення часу передачі інформації. Удосконалено математичну модель функціонування хмарної компоненти КМ ОКЗ, що дозволяє прискорити процес передачі інформації. Удосконалено метод побудови оптимальних часових шкал для апроксимації довжини черг КМ ОКЗ, що дозволяє визначити довжину черг при реконфігурації мережі. Удосконалено метод передачі інформації у бездротовому сегменті КМ ОКЗ, що призводить до зменшення часу передачі інформації.<br>Dissertation for the degree of Doctor of Technical Sciences in the specialty of 05.13.05 – Computer Systems and Components. – Kharkiv National University of Radio Electronics, National Technical University "Kharkiv Polytechnic Institute", Ministry of Education and Science of Ukraine, Kharkiv, 2018.
The thesis is devoted to solving of actual scientific and applied problem of ensuring the operativeness requirements for information exchange process in computer systems (CS) of critical application objects (CAO) on the basis of mathematical apparatus (mathematical models and methods) development intended for synthesis of new and reconfiguration of existing architectures of computer systems and networks. It was performed an analysis of the problem, appropriate trends of CAO CS, as well as the requirements for architectures of CAO CS and networks. The results revealed that currently existing models intended for synthesis and reconfiguration of CAO CS does not always lead to meet the operativity requirements for the process of information exchange in CAO CS and networks (CSN). This circumstance determines the need to improve the corresponding classical mathematical tools to increase the operativity of information transmission. It was developed a complex of methods for multiparameter synthesis of CAO CSN that optimizes the costs of constructing components of the critical application object CS, which ensure the meeting of operativity requirements. It was developed a further improvement for the model of tasks distribution process within the components of distributed CAO CS that allows significant accelerating the solution of the optimization problem in a case of large dimensions. It was developed a complex of evolution models for CAO computer networks (CN) that allows executing the prediction of network architecture changes during a fixed time interval. It was developed a complex of reconfiguration methods for CAO CN that allows adjusting the set of operation parameters of wireless components of the network in order to reduce the time of information transmission. It was improved a mathematical model describing the operation of CAO CN cloud component that allows accelerating the process of information transmission. It was improved a method of optimal time scales constructing for approximating the length of CAO CN queues that allows determining the length of queues during network reconfiguration. It was improved a method for information transmission in a wireless segment of CAO CN that allows reducing the time of information transmission.
43
Yeh, Cheng-tai. "Dynamic reconfiguration techniques for wireless sensor networks." Connect with this title, 2008. http://scholarworks.umass.edu/theses/119/.
Full text
44
Mello, Ana Paula Carboni de. "Reconfiguração de redes de distribuição considerando multivariáveis e geração distribuída." Universidade Federal de Santa Maria, 2014. http://repositorio.ufsm.br/handle/1/8537.
Full textAbstract:
Conselho Nacional de Desenvolvimento Científico e Tecnológico<br>The new design of electric power system, called Smart Grid, has emerged as a new challenge
especially for power distribution networks, which need to promote greater functionality such
as real-time monitoring of the information about the energy consumption of consumers, the
massive automation with smarter equipment and devices, monitoring and quick action when
facing problems, connection of distributed generation, among others. The connection of
distributed generation sources such as wind and solar power in the distribution network is
becoming an increasingly common practice and it has great influence on several aspects of the
distribution network, especially in system reconfiguration. The initial topology of the feeders
may not be ideal after the connection of the power generation, as well as the power flow is
modified by the distributed generation. In this sense, this Master Thesis presents a
methodology for the management of distribution networks through reconfiguration of the
network topology and the power injection of distributed generators based on wind,
photovoltaic and hydroelectric generation. The solution of the reconfiguration problem is
based on heuristic technique Branch Exchange, which seeks to optimize multiple objectives.
To select the networks configuration the multi-criteria decision AHP (Analytic Hierarchy
Process) method is used. To illustrate the efficiency of the methodology the results for a real
network of an electric utility are presented, considering different scenarios of load and
distributed generation availability, as well as validation of the results by the exhaustive search
method.<br>A nova concepção do sistema elétrico de potência, chamada Smart Grid, surgiu como
um novo desafio especialmente para as redes de distribuição de energia, as quais necessitam
promover maiores funcionalidades como o acompanhamento em tempo real das informações
sobre o consumo de energia dos consumidores, a massiva automação com dispositivos e
equipamentos mais inteligentes, o monitoramento e atuação rápida frente a problemas, a
conexão de geração distribuída, entre outros aspectos. A conexão de fontes de geração
distribuída como a eólica e fotovoltaica na rede de distribuição vem se tornando uma prática
cada vez mais comum e tem grande influência sobre vários aspectos da rede de distribuição,
sobretudo na reconfiguração do sistema. A topologia inicial dos alimentadores pode não ser a
ideal após a conexão das centrais de geração, uma vez que o fluxo de potência é modificado
com a presença da geração distribuída. Neste sentido, este trabalho apresenta uma metodologia
para o gerenciamento das redes de distribuição através da reconfiguração da topologia dos
alimentadores e da conexão de geradores distribuídos baseados na geração eólica, fotovoltaica e
hidráulica. A solução do problema de reconfiguração é baseada na técnica heurística Branch
Exchange, onde se procura a otimização de múltiplos objetivos. Para a seleção das
configurações das redes é utilizado o método de tomada de decisão multicriterial AHP (Analytic
Hierarchy Process). A fim de ilustrar a eficiência da metodologia, são apresentados os
resultados para uma rede real de uma concessionária de energia elétrica, considerando
diferentes cenários de carga e de disponibilidade de geração dos geradores distribuídos, bem
como a validação dos resultados através do método de busca exaustiva.
45
Crispino, Ferdinando. "Reconfiguração de redes primárias de distribuição de energia elétrica utilizando sistemas de informações geográficas." Universidade de São Paulo, 2001. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-15042003-092110/.
Full textAbstract:
Este trabalho apresenta um sistema de informações geográficas (SIG) como ferramenta de analise da reconfiguração de redes de distribuição de energia elétrica, juntamente com a evolução e tendências para os sistemas SIG. É utilizado um banco de dados relacional para armazenar dados geográficos e não geográficos e resultados de cálculo de fluxo de potência. A região em estudo é visualizada em forma de mapa sobrepondo a rede primária e os seus elementos elétricos. A simulação do novo estado da rede é feita, intuitivamente com o mouse, a partir dos elementos gráficos. O aplicativo apresenta graficamente os resultados de simulações de manobras na rede de distribuição e os valores resultantes do fluxo de potência para suas principais grandezas elétricas.<br>This work describes the implementation of a Geographical Information System (GIS) based reconfiguration system, aimed at primary distribution feeders (13.8 kV), together with an overview on the evolution and future trends of GIS applications. A relational database stores both spatial and non-spatial data, which are shown on the screen as a map on top of which all elements of the electrical system are displayed. An intuitive user interface, through the use of the mouse and graphical resources, allows the state of protective/switching devices to be easily changed (from closed to open and vice-versa). A load-flow routine can be executed at any time, allowing the evaluation of the impact of a particular operation. Simulation results are presented in two forms: graphical data shown directly on the screen and alphanumeric reports for later analysis.
46
Коваленко, Андрій Анатолійович. "Моделі та методи синтезу і реконфігурації архітектур комп'ютерних систем і мереж об'єктів критичного застосування". Thesis, НТУ "ХПІ", 2018. http://repository.kpi.kharkov.ua/handle/KhPI-Press/37686.
Full textAbstract:
Дисертація на здобуття наукового ступеня доктора технічних наук за спеціальністю 05.13.05 – комп'ютерні системи та компоненти. – Харківський національний університет радіоелектроніки, Національний технічний університет "Харківський політехнічний інститут", Міністерство освіти і науки України, Харків, 2018.
Дисертаційна робота присвячена вирішенню актуальної науково-прикладної проблеми забезпечення вимог з оперативності процесу обміну інформацією в комп'ютерних системах (КС) об'єктів критичного застосування (ОКЗ) на основі розробки математичного апарату (математичних моделей і методів) синтезу нових і реконфігурації існуючих архітектур комп'ютерних систем і мереж. Проведено аналіз стану проблеми, тенденцій розвитку КС ОКЗ, а також вимог до архітектур КС і мереж ОКЗ. В результаті встановлено, що на даний момент існуючі моделі та методи синтезу і реконфігурації КС ОКЗ не завжди призводять до забезпечення вимог з оперативності процесу обміну інформацією в КС і мережах (КСіМ) ОКЗ. Ця обставина визначає необхідність удосконалення відповідного класичного математичного інструментарію для підвищення оперативності передачі інформації. Розроблено комплекс методів багатопараметричного синтезу архітектур КСіМ ОКЗ, який оптимізує витрати на побудову компонентів КС об'єкту критичного застосування, котрі забезпечують виконання вимог з оперативності. Дістала подальшого розвитку модель процесу розподілу задач по компонентах розподіленої КС ОКЗ, що дозволяє при великих розмірностях суттєво прискорити рішення відповідної задачі оптимізації. Розроблено комплекс моделей еволюції архітектур комп'ютерних мереж (КМ) ОКЗ, що дозволяє виконати прогноз змін архітектури мережі протягом фіксованого часового інтервалу. Розроблено комплекс методів реконфігурації КМ ОКЗ, що дозволяє скорегувати множину параметрів функціонування бездротових компонентів мережі для зменшення часу передачі інформації. Удосконалено математичну модель функціонування хмарної компоненти КМ ОКЗ, що дозволяє прискорити процес передачі інформації. Удосконалено метод побудови оптимальних часових шкал для апроксимації довжини черг КМ ОКЗ, що дозволяє визначити довжину черг при реконфігурації мережі. Удосконалено метод передачі інформації у бездротовому сегменті КМ ОКЗ, що призводить до зменшення часу передачі інформації.<br>Dissertation for the degree of Doctor of Technical Sciences in the specialty of 05.13.05 – Computer Systems and Components. – Kharkiv National University of Radio Electronics, National Technical University "Kharkiv Polytechnic Institute", Ministry of Education and Science of Ukraine, Kharkiv, 2018.
The thesis is devoted to solving of actual scientific and applied problem of ensuring the operativeness requirements for information exchange process in computer systems (CS) of critical application objects (CAO) on the basis of mathematical apparatus (mathematical models and methods) development intended for synthesis of new and reconfiguration of existing architectures of computer systems and networks. It was performed an analysis of the problem, appropriate trends of CAO CS, as well as the requirements for architectures of CAO CS and networks. The results revealed that currently existing models intended for synthesis and reconfiguration of CAO CS does not always lead to meet the operativity requirements for the process of information exchange in CAO CS and networks (CSN). This circumstance determines the need to improve the corresponding classical mathematical tools to increase the operativity of information transmission. It was developed a complex of methods for multiparameter synthesis of CAO CSN that optimizes the costs of constructing components of the critical application object CS, which ensure the meeting of operativity requirements. It was developed a further improvement for the model of tasks distribution process within the components of distributed CAO CS that allows significant accelerating the solution of the optimization problem in a case of large dimensions. It was developed a complex of evolution models for CAO computer networks (CN) that allows executing the prediction of network architecture changes during a fixed time interval. It was developed a complex of reconfiguration methods for CAO CN that allows adjusting the set of operation parameters of wireless components of the network in order to reduce the time of information transmission. It was improved a mathematical model describing the operation of CAO CN cloud component that allows accelerating the process of information transmission. It was improved a method of optimal time scales constructing for approximating the length of CAO CN queues that allows determining the length of queues during network reconfiguration. It was improved a method for information transmission in a wireless segment of CAO CN that allows reducing the time of information transmission.
47
Gois, Marcilyanne Moreira. "Redução de perdas em sistemas de distribuição por reconfiguração de redes utilizando aceleradores de hardware." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-23052018-084132/.
Full textAbstract:
A reconfiguração de redes é uma técnica utilizada para alterar topologias de redes por meio da mudança dos estados das chaves normalmente aberta e normalmente fechada. Essa técnica é muito utilizada para tratar problemas relacionados ao excesso de perdas ôhmicas em uma rede elétrica. Tais perdas representam um custo considerável no faturamento das empresas distribuidoras. O problema de redução de perdas via reconfiguração de redes pode ser modelado como um problema de otimização combinatória, em que se deve determinar a combinação de estados de chaves que correspondem a configuração radial da rede com menor nível de perdas. De modo a lidar com esse problema por reconfiguração da redes, diversas técnicas computacionais têm sido propostas. Dentre essas técnicas, estruturas de dados eficientes, como a Representação nó-profundidade (RNP), viabilizam a modelagem radial dos sistemas de distribuição (SDs) e o uso combinado com métodos de otimização possibilitam uma redução do espaço de busca de soluções consequentemente pode-se obter melhores soluções. Para otimizar a capacidade de processamento, este trabalho propõe tratar o problema de redução de perdas em SDs via reconfiguração de redes em aceleradores de hardware utilizando da arquitetura de hardware paralelizada em FPGA baseada na RNP (HP-RNP) proposta em (GOIS, 2011). Assim, um problema combinatório é tratado em aceleradoras de hardware reduzindo significativamente o custo computacional devido ao alto grau de paralelismo no processo de busca por soluções. Nesse sentido, foi proposto neste trabalho a extensão da HP-RNP, a partir de modificações no barramento de comunicação da arquitetura original para o envio e recebimentos dos dados que representam os SDs de forma mais eficiente. Além disso, o problema de redução de perdas por reconfiguração de redes foi mapeado em um problema de floresta geradora mínima com restrição de grau (dc-MSFP), a partir de uma aproximação que faz uso de uma heurística de pesos, em que informações relacionadas com grandezas elétricas e características topológicas da rede são transformadas em pesos. A partir da extensão da HP-RNP e do mapeamento do problema em um dc-MSFP, foi possível obter soluções de qualidade (próximas da ótima) em tempo significativamente reduzido quando comparado às outras abordagens.<br>Network reconfiguration is a technique used to change network topologies by changing the normally open and normally closed switches states. This technique is widely used to problems related to the excess of ohmic losses in distribution companies. Such losses represent a considerable cost in the distribution companies. The problem of network reconfiguration can be modeled as a combinatorial optimization problem, in which the combination of switches states that represent the configuration of the network with the lowest level of losses must be determined. To deal with these problems by network reconfiguration, several computational techniques have been proposed. Among these techniques, efficient data structures, such as the Node-Depth Encoding (NDE), enable the radial modeling of the distribution systems and the combined use of the NDE with optimization methods allow the reduction of the search space of the solutions. In order to optimize the processing capacity, this work proposes to deal with the loss minimization problem in Distribution Systems (DSs) by network reconfiguration using the Hardware Parallelized NDE (HP-NDE) proposed in (GOIS, 2011) to accelerate the network reconfiguration. Thus, a combinatorial problem is addressed in hardware accelerators, reducing significantly the computational cost due to the high degree of the parallelism in the process of search of the solution search. In this context, it was proposed the extension of the HP-NDE, from modifications in the communication bus of the original HP-NDE to send and receive more efficiently the data that represent the DSs. Moreover, the problem of loss reduction was mapped in a minimum spanning forest problem with degree constraint (dc-MSFP), by using an approximation that use a weights heuristic based on the information of the electrical magnitudes and topological characteristics of the network. From the extension of the HP-RNP and the mapping of the problem in a dc-MSFP, it was possible to obtain solutions of the good quality (close to optimal) in a time significantly reduced when compared to the other approaches.
48
Joshi, Parag P. "Performance characterization and reconfiguration of wireless sensor networks." Birmingham, Ala. : University of Alabama at Birmingham, 2007. https://www.mhsl.uab.edu/dt/2008r/joshi.pdf.
Full textAbstract:
Thesis (Ph. D.)--University of Alabama at Birmingham, 2007.<br>Additional advisors: Dale W. Callahan, Gary J. Grimes, Ian K. Knowles, B. Earl Wells. Description based on contents viewed Feb. 13, 2009; title from PDF t.p. Includes bibliographical references (p. 139-143).
49
Borges, Henrique Fernandes. "Otimização do processo de restabelecimento de energia em sistemas de distribuição de grande porte utilizando chaves automáticas." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-22102013-155524/.
Full textAbstract:
Nesta dissertação é apresentada uma nova metodologia para tratar o problema de restabelecimento de energia em Sistemas de Distribuição (SD) de grande porte, possibilitando a obtenção de planos de restabelecimento a partir exclusivamente de chaves automáticas após a ocorrência de faltas permanentes. Este procedimento é realizado através da Reconfiguração de Redes (RR), que consiste basicamente na alteração da topologia do sistema elétrico através da mudança de estados (aberto/fechado) das chaves seccionadoras. Para isso, vários pontos de carga do SD são agrupados em blocos separados por chaves, formando setores. Assim, a partir da RR é possível a troca de cargas entre alimentadores em caso de interrupção em algum ponto da rede. A metodologia aqui proposta divide o processo de restabelecimento de energia em duas etapas. Na primeira a troca de cargas entre alimentadores é realizada utilizando apenas chaves automáticas, e a segunda etapa utiliza-se qualquer tipo de chave, automática ou não. O problema de restabelecimento de energia em SDs de grande porte envolve múltiplos objetivos, e alguns deles são conflitantes, além disto, devido à grande quantidade de variáveis envolvidas nesse problema, ele está sujeito ao fenômeno de explosão combinatória. Dessa forma, metas-heurísticas têm sido propostas como alternativas para tratar o problema, e dentre essas, os Algoritmos Evolutivos (AEs) têm se mostrado a mais eficiente. Face ao exposto, neste trabalho de mestrado utiliza-se de um AE Multi-Objetivo, juntamente com a estrutura de dados denominada Representação Nó-Profundidade (RNP), que permite uma representação computacional eficiente da topologia elétrica dos SDs. Para validar a metodologia proposta foram realizadas simulações computacionais no SD real da cidade de Londrina-PR, em atual operação. Os resultados que serão apresentados nessa dissertação mostraram um ganho substancial em comparação com outra metodologia.<br>This dissertation presents a new methodology to address service restoration problem in Large Scale Distribution Systems (DS), that allow the obtaining of service restoration plans considering only automatic switches after the occurrence of interruption. This procedure is performed through the Network Reconfiguration (NR), which basically consists in changing the topology of the electrical system by changing states (open/closed) of the switches. For this, various load points DS are grouped into blocks separated by switches, forming sectors. Thus, from the NR is possible to exchange charges between feeders in case of interruption somewhere in the DS. The methodology proposed here divides the process of service restoration in two stages. The first exchange of charges between feeders is performed using only automatic switches, and the second stage uses any type of switches, automatic or not. The problem of service restoration in Large-Scale DS involves multiple objectives, some of which are conflicting, moreover, due to the large number of variables involved in this problem, it is subject to the combinatorial explosion phenomenon. Thus, meta-heuristics have been proposed as alternatives to address the problem, and among these, the Evolutionary Algorithms (EAs) have shown to be more efficient. Given the above, this work uses Multi-Objective Evolutionary Algorithms, along with the graph encoding called Node-Depth Representation, which allows an efficient computational representation of DS topology. To validate the proposed methodology were performed computer simulations in real DS city of Londrina, in actual operation. The results will be presented in this thesis showed a substantial gain compared to other methods.
50
MAZZA, ANDREA. "Innovative Approaches for Optimization of the Distribution System Operation." Doctoral thesis, Politecnico di Torino, 2015. http://hdl.handle.net/11583/2596760.
Full textAbstract:
The present work of thesis presents some innovative approaches aiming at analyzing and optimizing the distribution system.
In the first part (composed of the Chapters 1–4), some innovative methods developed for distribution network reconfiguration, both in single objective framework and in multi- objective framework, are presented and applied.
In particular, Chapter 1 shows the general problem of distribution network reconfigu- ration, while Chapter 2 presents the different types of Optimization Methods (OM), by focusing on their nature (deterministic or heuristic) and on the goal they have (single or multi-objective optimization).
Chapter 3 introduces the decision-making methods, which have been used for the multi- objective optimization problems (whose application examples are reported in Chapter 5).
Chapter 4 reports some innovative approach in the single objective optimization, by analyzing the possibility to apply intraday reconfiguration, by considering the cost of this operation with respect to the initial solution in which the actual configuration is maintained without any change.
Chapter 6 presents some tools developed within the European Project SiNGULAR as functions of the main tool DERMAT, aiming at handling the different input data pattern, the correlation among loads and generators, as well as the presence of correlated harmonic sources in the network.
Finally, in Appendix A the networks used during the doctoral work are shown, while Appendix B presents an overview of the general aspects and characteristics of the probability-based methods.