Search results for "Flow network"
showing 7 items of 17 documents
Two-Player Noncooperative Games over a Freight Transportation Network''
2004
A game between two players acting on the same road transportation network is considered in this paper. The first player aims at minimizing the transportation costs, whereas the second player aims at maximizing her profit (or, in general, her utility) that is proportional to the flow passing through the arcs under her control. We introduce bilevel linear programming formulations for this problem. We derive conditions of existence and properties of the equilibrium points and propose an algorithm finding a local optimal solution. Finally, we present an application of the model to a real system involving trucks travelling through Europe from a Middle Eastern country.
Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand
2010
We consider continuous-time robust network flows with capacity constraints and unknown but bounded time-varying demand. The problem of interest is to design a control strategy off-line with no knowledge of the demand realization. Such a control strategy regulates the flow on-line as a function of the realized demand. We address both the case of systems without and with buffers. The main novelty in this work is that we consider a convex cost which is a function of the long-run average-flow and average-demand. We distinguish a worst-case scenario where the demand is the worst-one from a deterministic scenario where the demand has a neutral behavior. The resulting strategies are called min-max…
Clustering-Based Protocol Classification via Dimensionality Reduction
2015
We propose a unique framework that is based upon diffusion processes and other methodologies for finding meaningful geometric descriptions in high-dimensional datasets. We will show that the eigenfunctions of the generated underlying Markov matrices can be used to construct diffusion processes that generate efficient representations of complex geometric structures for high-dimensional data analysis. This is done by non-linear transformations that identify geometric patterns in these huge datasets that find the connections among them while projecting them onto low dimensional spaces. Our methods automatically classify and recognize network protocols. The main core of the proposed methodology…
Finding all optimal solutions to the network flow problem
1986
The problem examined in this paper is as follows: Given a feasible optimum basic solution (f.o.b.s) of the minimum cost network flow problem, find all the f.o.b.s of this problem. The existence of alternative f.o.b.s is characterized by means of elementary circuits of zero cost and length greater than two in the incremental graph associated to the given f.o.b.s. It is shown that any alternative f.o.b.s. can be obtained from the original one by circulating flow through elementary circuits belonging to a succession of incremental graphs. This result leads to the construction of an efficient algorithm to obtain all f.o.b.s. of the network flow problem.
Heuristics for the Mixed Rural Postman Problem
2000
Abstract The Rural Postman Problem on a mixed graph (MRPP) consists of finding a minimum cost tour which traverses, at least once, the arcs and edges of a given subset of the arcs and edges of the graph. This problem is known to be NP-hard. This paper presents two heuristic approaches to solve it. An approximate algorithm based on the resolution of some flow and matching problems and a tabu search implementation is presented. The tabu search algorithm seeks high-quality tours by means of a switching mechanism in an intensification phase and two levels of diversification. Computational results are presented to assess the merits of the method. Scope and purpose Routing Problems arise in sever…
A Memetic Algorithm for Binary Image Reconstruction
2008
This paper deals with a memetic algorithm for the reconstruction of binary images, by using their projections along four directions. The algorithm generates by network flows a set of initial images according to two of the input projections and lets them evolve toward a solution that can be optimal or close to the optimum. Switch and compactness operators improve the quality of the reconstructed images which belong to a given generation, while the selection of the best image addresses the evolution to an optimal output.
A Network-Based Framework for Mobile Threat Detection
2018
Mobile malware attacks increased three folds in the past few years and continued to expand with the growing number of mobile users. Adversary uses a variety of evasion techniques to avoid detection by traditional systems, which increase the diversity of malicious applications. Thus, there is a need for an intelligent system that copes with this issue. This paper proposes a machine learning (ML) based framework to counter rapid evolution of mobile threats. This model is based on flow-based features, that will work on the network side. This model is designed with adversarial input in mind. The model uses 40 timebased network flow features, extracted from the real-time traffic of malicious and…