We report here two recent developments in the theory of optimal transportation. The first is a proof for the existence of optimal mappings to the Monge mass transportation problem [16]. The other is an application of optimal transportation in geometric optics [19]. The optimal transportation problem, in general, deals with the redistribution of materials in the most economical way. The original...

In this paper we give the solution methods for a multicriterial transportation problem of a nonlinear type. We would like to note that the problems of this type do not have any classical solution algorithms. The article consists of two parts dealing with 2 and 3 objectives respectively, one being non-linear of “bottleneck” type, and the rest being linear ones. Definitions of efficient and extre...

Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cutting-plane methods and Branch and Bound Techniques are obvious. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C...

Received: January 6, 2011 Accepted: January 24, 2011 doi:10.5539/jmr.v3n2p66 The research is supported by Zhejiang Provincial Education Department research projects (Y201016421) Abstract Monge-Kantorovich transportation problem in a bounded region of Euclidean space is transferred into a partial differential equations group. And then the explicit formula of the optimal coupling is achieved. The...

This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...

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 solid transportation problem is an important extension of the traditional transportation problem. Solid transportation problem with uncertain variables as its parameters is called uncertain solid transportation problem. In this paper, the expected-constrained programming for an uncertain solid transportation problem is given based on uncertainty theory. According to inverse uncertainty dist...