Spelling suggestions: "subject:"[een] NETWORK FLOW"" "subject:"[enn] NETWORK FLOW""
51 |
Um algoritmo de otimização determinístico para o estudo e planejamento da operação de sistemas hidrotérmicos de potência / An deterministic algorithm for the study and planning of hydrothermal power system operationJulia Sechi Nazareno 25 April 2005 (has links)
Este trabalho apresenta um algoritmo determinístico para o planejamento da operação de sistemas hidrotérmicos de potência com representação individualizada das usinas hidroelétricas. Este problema caracteriza-se por ser não-linear, não diferenciável e de grande porte. O modelo de otimização foi baseado em algoritmos de fluxo em rede não-linear e foi utilizado o método do gradiente reduzido para se encontrar a direção ótima e o método da razão áurea para a busca do tamanho do passo ótimo. A estrutura da rede hidráulica formada pelas equações de balanço de água foi explorada através da definição da base na matriz defluência básica. Testes no programa foram realizados em diversos sistemas compostos por usinas reais pertencentes ao sistema sudeste brasileiro. Esses estudos foram realizados visando apresentar os princípios básicos que regem a operação ótima dos reservatórios e validar o algoritmo implementado. / This work presents a deterministic algorithm for the operational planning of hydrothermal power systems where each plant is represented individually. This problem is characterized by non-linear, non-diferenciable and large scale. The optimization model was based in non-linear network flow algorithm and it was used the reduced gradient method to find the optimal direction and the golden ratio method to find the best step size. The structure of hydraulic network formed by the water balance equation was exploited through the definition of the base in the basic flow matrix. Many tests were done with some system composed by real plants located on brazilian southeast. This studies was done to show the basics principles that rule the optimal operation of reservoirs and to validate the algorithm implemented.
|
52 |
Proposta de modelo para priorização de investimentos em infraestrutura de transporte de cargas: abordagem multicritério para problemas de fluxos em rede. / A proposed model for prioritizing investments in freight transport infrastructure: multi-criteria approach for network flow problems.Samir Kazan 23 September 2013 (has links)
A relevância da infraestrutura de transporte para incrementos em produtividade, induzindo ao desenvolvimento socioeconômico de determinada região é amplamente reconhecida. O Brasil, no entanto, apresenta sérias deficiências em relação à sua infraestrutura de transporte, oriundas de seu desenvolvimento histórico e da redução de níveis de investimentos públicos no setor nas últimas décadas. Estas deficiências traduzem-se em grande concentração no modal rodoviário para o transporte de cargas, menos eficiente do que os modais ferroviário e hidroviário, resultando em reduzida competitividade das organizações nacionais. Neste contexto, objetivou-se no presente trabalho a proposição de um modelo para avaliação e seleção de investimentos em infraestrutura de transporte de cargas, considerando-se seu caráter multidimensional. Para isso, foi proposta metodologia integrando os conceitos de análise de decisão multicritério e de programação matemática, representados pela teoria de utilidade multiatributo (Multi-Attribute Utility Theory - MAUT) e por problema de otimização de fluxos em rede (Minimum Cost Network Flow Problem - MCNFP), respectivamente. No desenvolvimento do modelo foram contemplados critérios de avaliação referentes às dimensões de análise financeira, operacional e ambiental. Posteriormente, foi considerada a aplicação de versões do modelo proposto com diferentes números de períodos de análise em caso ilustrativo, representativo da rede de transporte disponível e planejada da região Norte do Brasil. A aplicação das diversas versões do modelo proposto, de forma geral, apresentou resultados compatíveis com as teorias relacionadas à avaliação deste problema de decisão, incluindo indução à multimodalidade. Algumas versões do modelo apresentaram violações em algumas de suas restrições. Estes resultados adversos não foram plenamente eliminados, devido a limitações das ferramentas adotadas para aplicação. No entanto, foi possível a correção manual destas violações, resultando em soluções viáveis que, apesar de não serem consideradas ótimas, são mais completas do que soluções obtidas por meio de metodologias unidimensionais de análise. Por fim, foram apresentadas recomendações para condução de trabalhos futuros visando eliminação dos resultados adversos do modelo proposto e complementação de sua análise. / The role of transport infrastructure in productivity increases leading to regional social-economic development is widely recognized. Brazil, however, has serious deficiencies in its transport infrastructure, rooted in the country\'s historical development and in the recent decades\' reduction of public investment in the sector. These deficiencies can be observed in Brazil\'s strong focus on roads for cargo transportation, which besides being less efficient than rail and waterways, results in reduced competitiveness of national enterprises. In this context, the aim of this work was to propose a model for evaluating and selecting investments in freight\'s transportation infrastructure, considering its multidimensional character. It was proposed a methodology integrating the concepts of multi-criteria decision analysis and mathematical programming, represented by the Multi-Attribute Utility Theory (MAUT) along with the Minimum Cost Network Flow Problem (MCNFP). The developed model included financial, operational and environmental analysis evaluation criteria. Subsequently, this study applied the proposed model into a case study of the transportation network, available and planned, of the Northern region of Brazil. Overall, the application of various versions of the proposed model yielded results consistent with related evaluation and decision making theories, including induction of multimodality. Some versions of the model presented some violations of its restrictions. These adverse results were not fully eliminated due to the limitations of the application tools utilized. It was possible, however, to manually correct these violations and obtain viable solutions that, while cannot be considered optimal, are more complete than those obtained by single dimension analysis. Finally, recommendations were made for future studies aiming at eliminating the proposed model\'s adverse outcomes, and complementing its analysis.
|
53 |
Recherche de flots stables dans des réseaux de transport multi-agents / Search of stable waves in multi-agent transport networksChaabane, Nadia 19 January 2016 (has links)
Nous considérons dans ce travail, des problèmes d’optimisation dans des graphes de flot multi-agent. Trois types d’agents sont considérés : les agents producteurs, transporteurs et usagers et différentes variétés de topologies de réseaux sont abordées. Chaque agent transporteur contrôle la capacité d’un ensemble de routes élémentaires (arcs), ayant chacun une capacité qui peut être augmenté jusqu’à une valeur maximale moyennant un coût fixe. Les autres agents (i.e., usagers/producteurs) sont intéressés par la maximisation du flot qu’ils reçoivent. Dans ce but, ces derniers offrent une récompense aux agents transporteurs, cette récompense est proportionnelle à la valeur du flot reçu. Ce contexte multi-agent particulier est appelé jeu expansion de réseau multi-agent. La stratégie d’un agent transporteur consiste à décider de la capacité de ses arcs sachant qu’un coût supplémentaire est encouru pour toute expansion unitaire de capacité. Il reçoit en contrepartie une part de la récompense. Il est intéressé par la maximisation de son profit et se comporte en conséquence. En outre, la stratégie d’un agent producteur/usager consiste à décider de la politique de partage de sa récompense afin de maximiser le flot qu’il reçoit. Le flot total réalisé dépend finalement des stratégies de tous les agents. Dans ces jeux d’expansion de réseau multi-agent, nous nous intéressons à caractériser des stratégies stables (i.e., Equilibre de Nash) selon diverses hypothèses. En se basant sur cette caractérisation, différents cas sont définis et étudiés. L’analyse de la complexité de quelques problèmes de décision est présentée dans ce manuscrit. Nous nous intéressons particulièrement au problème de recherche d’un équilibre de Nash qui maximise la valeur du flot total circulant dans le réseau. Nous montrons que ce problème est NP-difficile au sens fort et nous montrons comment une telle stratégie peut être caractérisée par des chemins spécifiques dans des graphes résiduels. Nous proposons également un programme linéaire à variables mixtes (PLM) qui résout le problème dans le cas d’un seul agent producteur/usager et un ensemble d’agents transporteurs. Des résultats expérimentaux sont fournis pour prouver l’efficacité de notre approche. / In this work, multi-agent network flow problems are addressed. Three types of agentsare considered, namely the producer, transportation and customer agents and various network topologies are tackled. Every transportation agent controls the capacities of a set of elementary routes (arcs), each one having a capacity that can be increased up to a certain point at a given cost. The other agents (i.e., customers/producers) are interesting in maximizing their flow of products. For that aim, we assume that they offer to the transportation agents a reward that is proportional to the realized flow value. This particular multi-agent framework is referred to as a multi-agent network expansion game. The transportation agent’s strategy consists in deciding upon the capacity of its arcs, an extra-cost being incurred for any capacity expansion. It receives in return a part of the total reward. It is interested in the maximization of its profit and behaves accordingly. Beside that, the producers/customers’ strategies consist in deciding the sharing policy for their reward for maximizing their own flow of products. The total network flow value eventually depends on all agents’ strategies. We take interest in characterizing and finding particular stable strategies (i.e., Nash Equilibria) that are of interest for this game under various assumptions. Based on this characterization, several cases are defined and studied. The analysis of the complexity of some decision problems is made. We particularly focus on the problem of finding a Nash Equilibrium that maximizes the value of the total flow. We prove that this problem is NP-hard in the strong sense and show how such a strategy can be characterized considering paths in specific reduced agent-networks. We also provide a mixed integer linear programming (MILP) formulation that solves the problem in the case of a single producer/customer agent and a set of transportation agents. Computational experiments are provided to prove the effectiveness of our approach
|
54 |
Možnosti identifikace botnetové robotické aktivitiy / On possible approaches to detecting robotic activity of botnetsPrajer, Richard January 2016 (has links)
This thesis explores possible approaches to detecting robotic activity of botnets on network. Initially, the detection based on full packet analysis in consideration of DNS, HTTP and IRC communication, is described. However, this detection is found inapplicable for technical and ethical reasons. Then it focuses on the analysis based on network flow metadata, compiling them to be processable in machine learning. It creates detection models using different machine learning methods, to compare them with each other. Bayes net method is found to be acceptable for detecting robotic activity of botnets. The Bayesian model is only able to identify the botnet that already executes the commands sent by its C&C server. "Sleeping" botnets are not reliably detectable by this model.
|
55 |
Optimalizace a algoritmy pro úlohy dopravního inženýrství / Optimization and algorithms for traffic engineering problemsFajmon, Michal January 2020 (has links)
This master's thesis deals with optimization of traffic networks. There are discussed modeling methods for traffic and simplifications used in these models. Introductory part is focused on mathematical theory used to buid presented model. Main focus of this thesis was creation and optimization of the model which describes real world traffic network with traffic lights. Model was tested on both artificial and real data gathered in city Zlín. It was necessary to create generator which can produce suitable input data for model.
|
56 |
Vizualizace modelování rizik v logistice / Visualisation for risk models in logisticsHamšík, Filip January 2016 (has links)
This thesis focuses on development of web application for the visualization of waste transportation according to calculated data from optimization methods in GAMS application. Visualization shows the nodes and edges on Google Maps where it is possible to show more detailed information including diagrams and tables. The application provides filtering edges by their type, highlighting edges with dynamic setting, several different ways for user access and other features. Based on developed application there will be presented some recommendations applicable in future using of the model.
|
57 |
Optimal Multi-Commodity Network Flow of Electric Vehicles with Charge ConstraintsGomér Torp, Carl Kristian, Melander, Simon January 2023 (has links)
The focus of this thesis is to find, visualize and analyze the optimal flow of autonomous electric vehicles with charge constraints in urban traffic with respect to energy consumption. The traffic has been formulated as a static multi-commodity network flow problem, for which two different models have been implemented to handle the charge constraints. The first model uses a recursive algorithm to find the optimal solution fulfilling the charge constraints, while the second model discretizes the commodities’ battery to predetermined battery levels. An implementation of both methods is provided through simulations on scenarios of three different sizes. The results show that both methods are capable of representing the traffic flow with charge constraints, with limitations given by the size of the problem. In particular, the recursive model has the advantage of considering the charge as a continuous quantity. On the other hand the discretization of battery levels allows to handle charge constraint setups with higher complexity, that is when longer detours are needed to fulfill the charge constraints.
|
58 |
Ambiente multim?todos para otimiza??o de opera??es em sistemas de distribui??o de energia el?trica generalizados / Multi-method environment for optimization of operations in generalized electricity distribution systemsBlengini Neto, Adolfo 16 February 2017 (has links)
Submitted by SBI Biblioteca Digital (sbi.bibliotecadigital@puc-campinas.edu.br) on 2017-03-23T14:50:03Z
No. of bitstreams: 1
ADOLFO BLENGINI NETO.pdf: 3955942 bytes, checksum: 45ddc01c026b2c6b88359672fba01257 (MD5) / Made available in DSpace on 2017-03-23T14:50:03Z (GMT). No. of bitstreams: 1
ADOLFO BLENGINI NETO.pdf: 3955942 bytes, checksum: 45ddc01c026b2c6b88359672fba01257 (MD5)
Previous issue date: 2017-02-16 / Pontif?cia Universidade Cat?lica de Campinas ? PUC Campinas / This study proposes the development of an environment for optimization of the operations of electrical distribution systems. The environment is proposed for the modern electrical distribution networks considering the possibility of inclusion of distributed generation and mesh topology. The environment is divided into three modules. The first module consists of standardizing the input and organization data of the network in memory using techniques of object-oriented software engineering. This approach simplifies the processes of nodal analysis of the circuits, improves the performance of the solution and allows reusing the objects and operations in other implementations. The second module is responsible for analyzing and represents network characteristics: topology, load model and distributed generation points. The third consists of the BFS, FW and OCF methods to perform the current flow calculation and allows the user to choose the desired algorithm, being able to present the currents and voltages in each iteration. The choice of different methods in the optimization environment allows the use of the most adherent method to the different network topologies, the types of load, the flexibility in the use of capacity constraints of the elements of the network and the inclusion of generation limits and voltage limits. In order to verify the adhesion and the efficiency of the environment, simulations were carried out on balanced three-phase circuits of primary distribution of 11, 33 and 400 buses with different load models, radial or mesh topology, with and without distributed generation. / Esta pesquisa prop?e-se ao desenvolvimento de um ambiente para otimiza??o da opera??o de sistemas de distribui??o de energia. O ambiente ? aderente ?s modernas redes de distribui??o de energia por considerar a possibilidade de inclus?o de gera??o distribu?da e topologia em malha. O ambiente est? dividido em tr?s m?dulos. O primeiro m?dulo consiste na padroniza??o dos dados de entrada e organiza??o da rede em mem?ria no formato de grafo utilizando t?cnicas de engenharia de software orientada a objetos. Este enfoque simplifica os processos de an?lises nodais dos circuitos, melhora o desempenho da solu??o e permite reaproveitar os objetos e opera??es em outras implementa??es. O segundo m?dulo ? respons?vel pela an?lise e representa??o das caracter?sticas da rede: topologia, modelo de cargas e pontos de gera??o distribu?da. O terceiro consiste dos m?todos BFS, FW e OCF para a execu??o do c?lculo do fluxo de corrente e d? a op??o ao usu?rio de escolha do enfoque desejado, podendo apresentar as correntes e tens?es em cada itera??o. A op??o de escolha de diferentes m?todos no ambiente de otimiza??o possibilita o uso do m?todo mais aderentes ?s diferentes topologias de rede, aos tipos modelos de carga, a flexibilidade no uso de restri??es de capacidade dos elementos da rede e a inclus?o de limites de gera??o e limites de tens?o.
Com a finalidade de comprovar a ader?ncia e efici?ncia do ambiente foram realizadas simula??es em circuitos trif?sicos equilibrados de distribui??o prim?ria com 11, 33 e 400 barras com modelos de carga constante, topologia radial, anel, com e sem gera??o distribu?da.
|
59 |
An optimisation approach to improve the throughput in wireless mesh networks through network coding / van der Merwe C.Van der Merwe, Corna January 2011 (has links)
In this study, the effect of implementing Network Coding on the aggregated throughput in Wireless
Mesh Networks, was examined. Wireless Mesh Networks (WMNs) are multiple hop wireless networks,
where routing through any node is possible. The implication of this characteristic, is that messages
flow across the points where it would have been terminated in conventional wireless networks. User
nodes in conventional wireless networks only transmit and receive messages from an Access Point
(AP), and discard any messages not intended for them.
The result is an increase in the volume of network traffic through the links of WMNs. Additionally,
the dense collection of multiple RF signals propagating through a shared wireless medium, contributes
to the situation where the links become saturated at levels below their capacity. The need exists to
examine methods that will improve the utilisation of the shared wireless medium in WMNs.
Network Coding is a coding and decoding technique at the network level of the OSI stack, aimed to
improve the boundaries of saturated links. The technique implies that the bandwidth is simultaneously
shared amongst separate message flows, by combining these flows at common intermediate nodes.
The number of transmissions needed to convey information through the network, is decreased by
Network Coding. The result is in an improvement of the aggregated throughput.
The research approach followed in this dissertation, includes the development of a model that
investigates the aggregated throughput performance of WMNs. The scenario of the model, followed a
typical example of indoors WMN implementations. Therefore, the physical environment representation
of the network elements, included an indoors log–distance path loss channel model, to account for the
different effects such as: power absorption through walls; and shadowing.
Network functionality in the model was represented through a network flow programming problem.
The problem was concerned with determining the optimal amount of flow represented through the
links of the WMN, subject to constraints pertaining to the link capacities and mass balance at each
node. The functional requirements of the model stated that multiple concurrent sessions were to
be represented. This condition implied that the network flow problem had to be a multi–commodity
network flow problem.
Additionally, the model requirements stated that each session of flow should remain on a single path.
This condition implied that the network flow problem had to be an integer programming problem.
Therefore, the network flow programming problem of the model was considered mathematically
equivalent to a multi–commodity integer programming problem. The complexity of multi–commodity
integer programming problems is NP–hard. A heuristic solving method, Simulated Annealing, was implemented to solve the goal function represented by the network flow programming problem of the model.
The findings from this research provide evidence that the implementation of Network Coding in
WMNs, nearly doubles the level of the calculated aggregated throughput values. The magnitude of
this throughput increase, can be further improved by additional manipulation of the network traffic
dispersion. This is achieved by utilising link–state methods, rather than distance vector methods, to
establish paths for the sessions of flow, present in the WMNs. / Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2012.
|
60 |
An optimisation approach to improve the throughput in wireless mesh networks through network coding / van der Merwe C.Van der Merwe, Corna January 2011 (has links)
In this study, the effect of implementing Network Coding on the aggregated throughput in Wireless
Mesh Networks, was examined. Wireless Mesh Networks (WMNs) are multiple hop wireless networks,
where routing through any node is possible. The implication of this characteristic, is that messages
flow across the points where it would have been terminated in conventional wireless networks. User
nodes in conventional wireless networks only transmit and receive messages from an Access Point
(AP), and discard any messages not intended for them.
The result is an increase in the volume of network traffic through the links of WMNs. Additionally,
the dense collection of multiple RF signals propagating through a shared wireless medium, contributes
to the situation where the links become saturated at levels below their capacity. The need exists to
examine methods that will improve the utilisation of the shared wireless medium in WMNs.
Network Coding is a coding and decoding technique at the network level of the OSI stack, aimed to
improve the boundaries of saturated links. The technique implies that the bandwidth is simultaneously
shared amongst separate message flows, by combining these flows at common intermediate nodes.
The number of transmissions needed to convey information through the network, is decreased by
Network Coding. The result is in an improvement of the aggregated throughput.
The research approach followed in this dissertation, includes the development of a model that
investigates the aggregated throughput performance of WMNs. The scenario of the model, followed a
typical example of indoors WMN implementations. Therefore, the physical environment representation
of the network elements, included an indoors log–distance path loss channel model, to account for the
different effects such as: power absorption through walls; and shadowing.
Network functionality in the model was represented through a network flow programming problem.
The problem was concerned with determining the optimal amount of flow represented through the
links of the WMN, subject to constraints pertaining to the link capacities and mass balance at each
node. The functional requirements of the model stated that multiple concurrent sessions were to
be represented. This condition implied that the network flow problem had to be a multi–commodity
network flow problem.
Additionally, the model requirements stated that each session of flow should remain on a single path.
This condition implied that the network flow problem had to be an integer programming problem.
Therefore, the network flow programming problem of the model was considered mathematically
equivalent to a multi–commodity integer programming problem. The complexity of multi–commodity
integer programming problems is NP–hard. A heuristic solving method, Simulated Annealing, was implemented to solve the goal function represented by the network flow programming problem of the model.
The findings from this research provide evidence that the implementation of Network Coding in
WMNs, nearly doubles the level of the calculated aggregated throughput values. The magnitude of
this throughput increase, can be further improved by additional manipulation of the network traffic
dispersion. This is achieved by utilising link–state methods, rather than distance vector methods, to
establish paths for the sessions of flow, present in the WMNs. / Thesis (M.Ing. (Computer and Electronical Engineering))--North-West University, Potchefstroom Campus, 2012.
|
Page generated in 0.0275 seconds