Related papers: Phase field approximations of branched transportat…
The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new…
Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…
Optimal mass transport is described by an approximation of transport cost via semi-discrete costs. The notions of optimal partition and optimal strong partition are given as well. We also suggest an algorithm for computation of Optimal…
In this paper, a thermal-dynamical consistent model for mass transfer across permeable moving interfaces is proposed by using the energy variation method. We consider a restricted diffusion problem where the flux across the interface…
In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of special structure. We observe that the…
We study an optimization problem related to the approximation of given data by a linear combination of transformed modes. In the simplest case, the optimization problem reduces to a minimization problem well-studied in the context of proper…
Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this…
Modeling traffic distribution and extracting optimal flows in multilayer networks is of utmost importance to design efficient multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and…
Realistic two-phase flow problems of interest often involve high $Re$ flows with high density ratios. Accurate and robust simulation of such problems requires special treatments. In this work, we present a consistent, energy-conserving…
We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks. We derive analytical formulas for the average current and flow as a function of n. We show that for…
We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book…
Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed…
Authors describe a two-stage traffic assignment model. It contains of two blocks. The first block consists of model for calculating correspondence (demand) matrix, whereas the second block is a traffic assignment model. The first model…
A general Continuum Approximation (CA) model is proposed for optimizing transit network designs (TND) in grid cities under spatially heterogeneous demand. While conventional studies often assume rigid geometric line configurations (e.g.,…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
We discuss methods of Optimal Transportation Theory and its relations to problems in quantum mechanics. This essentially means that the cost function is some Hamiltonian $H(q,p)$ on a phase space (symplectic manifold), and the marginal…
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…
Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this…