Related papers: Transport multi-paths with capacity constraints
Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study…
In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets…
We consider an undirected graph $G = (VG, EG)$ with a set $T \subseteq VG$ of terminals, and with nonnegative integer capacities $c(v)$ and costs $a(v)$ of nodes $v\in VG$. A path in $G$ is a \emph{$T$-path} if its ends are distinct…
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…
Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the…
Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…
We consider optimal transportation of measures on metric and topological spaces in the case where the cost function and marginal distributions depend on a parameter with values in a metric space. The Hausdorff distance between the sets of…
Finding optimal trajectories for multiple traffic demands in a congested network is a challenging task. Optimal transport theory is a principled approach that has been used successfully to study various transportation problems. Its usage is…
In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we present efficient, novel, algorithmic techniques for computing…
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vertices represent positions and edges define the topology.…
We study optimal transport between probability measures supported on the same finite metric space, where the ground cost is a distance induced by a weighted connected graph. Building on recent work showing that the resulting Kantorovich…
We analyze analytically the effect of congestion costs within a physically relevant, yet exactly solvable network model featuring central hubs. These costs lead to a competition between centralized and decentralized transport pathways. In…
The structure of pipe networks minimizing the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can be built with a given total pipe volume (or pipe lateral surface area), the network which…
Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…
This paper deals with a variant of the optimal transportation problem. Given f $\in$ L 1 (R d , [0, 1]) and a cost function c $\in$ C(R d x R d) of the form c(x, y) = k(y -- x), we minimise $\int$ c d$\gamma$ among transport plans $\gamma$…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…
Congestion pricing has become an effective instrument for traffic demand management on road networks. This paper proposes an optimal control approach for congestion pricing for day-to-day timescale that incorporates demand uncertainty and…
In this paper we revisit a class of optimal transport problems associated to non-autonomous linear control systems. Building on properties of the cost functions on $\mathbb{R}^{d}\times\mathbb{R}^{d}$ derived from suitable variational…
We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…
Resource constrained shortest path problems are usually solved thanks to a smart enumeration of all the non-dominated paths. Recent improvements of these enumeration algorithms rely on the use of bounds on path resources to discard partial…