An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels, draining and irrigation systems. Here, we extend the study of ramified optimal transportation between probability measures from Euclidean spaces to a geodesic ...

in the literature hardly any attention is paid to solving a fuzzy fixed charge transportation problem. in this paper, we consider the fully fixed-charge transportation problem and try to find both the lower and upper bounds on the fuzzy optimal value of such a problem in which all of the parameters are triangular fuzzy numbers. to illustrate the proposed method, a numerical example is ‎presented.‎

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

A new method using the principle of zero point method [10] is proposed for finding an optimal solution of solid transportation problems. The proposed method yields an optimal solution of the given solid transportation problem directly . It is very easy to understand and apply which can serve managers by providing the optimal solution to a variety of distribution problems involving three items. ...

Preventing crimes or terrorist attacks in urban areas is challenging. Law enforcement officers need to respond quickly to catch the attacker on his escape route, which is subject to time-dependent traffic conditions on transportation networks. The attacker can strategically choose his escape path and driving speed to avoid being captured. Existing work on security resource allocation has not co...

We study the Monge transportation problem when the cost is the action associated to a Lagrangian function on a compact manifold. We show that the transportation can be interpolated by a Lipschitz lamination. We describe several direct variational problems the minimizers of which are these Lipschitz laminations. We prove the existence of an optimal transport map when the transported measure is a...

Explicit procedures are provided in the three cases above, the principal one being that the problem has an hidden structure of linear preorder with universally measurable graph. Yann Brenier (Nice). A modified least action principle allowing mass concentrations for the early universe reconstruction problem. Abstract. We discuss the reconstruction problem for the early universe, following Peeble...

Benamou and Brenier formulation of Monge transportation problem [3] has proven to be of great interest in image processing to compute warpings and distances between pair of images [1]. In some applications, however, the built-in minimization of kinetic energy does not give satisfactory results. In particular cases where some specific regions represent physical objects, it does not make sense, a...