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 ...

this paper is focused on the tactical design of steel supply chain (ssc). a general mathematical model is proposed to integrate production and transportation planning in multi-commodity ssc. the main purpose is to prepare a countrywide production and distribution plan in an ssc with three layers consisting of iron ore mines as suppliers, steel companies as producers, and subsidiary steel compan...

In classical transport models, it is always assumed that parameters such as the distance from each supply node to each demand node or the cost of transferring goods from one node to another, as well as quantities such as supply and demand are definite and definite amounts. But in real matters, considering these assumptions is not logical. On the other hand, there may be a real problem in mathem...

In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...

We extend the classical transportation problem from linear optimization and introduce several competing forwarders. This results in a noncooperative game which is commonly known as generalized Nash equilibrium problem. We show the existence of Nash equilibria and present numerical methods for their efficient computation. Furthermore, we discuss several equilibrium selection concepts that are ap...

The senior transportation problem (STP) is an optimization problem in which a fixed fleet of volunteer-operated, heterogeneous vehicles from multiple depots must satisfy as many elderly door-to-door transportation requests as possible within a fixed time horizon. All requests consist of a oneto-one pickup and delivery with time windows. Moreover, as the clients are seniors, a maximum ride time ...

We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is (min(m; logC)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modi cation of the greedy algorithm and that has a halfopt-competitive ratio of O(1).

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 its capacity and the total price of the incoming flow on a sink must not exceed its budget. This problem is closely related to the generalized flow problem. We...