Characterization of the Optimal Solution of the Convex Generalized Nonlinear Transportation Problem

Author(s):  
Stefan M. Stefanov
2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.


10.26524/cm46 ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 40-48
Author(s):  
Ravi J ◽  
Dickson S ◽  
Sathya K

Author(s):  
Amit Kumar ◽  
Amarpreet Kaur

There are several methods, in literature, for finding the fuzzy optimal solution of fully fuzzy transportation problems (transportation problems in which all the parameters are represented by fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings, two new methods (based on fuzzy linear programming formulation and classical transportation methods) are proposed to find the fuzzy optimal solution of unbalanced fuzzy transportation problems by representing all the parameters as trapezoidal fuzzy numbers. The advantages of the proposed methods over existing methods are also discussed. To illustrate the proposed methods a fuzzy transportation problem (FTP) is solved by using the proposed methods and the obtained results are discussed. The proposed methods are easy to understand and to apply for finding the fuzzy optimal solution of fuzzy transportation problems occurring in real life situations.


Author(s):  
Sankar Kumar Roy ◽  
Deshabrata Roy Mahapatra

In this chapter, the authors propose a new approach to analyze the Solid Transportation Problem (STP). This new approach considers the multi-choice programming into the cost coefficients of objective function and stochastic programming, which is incorporated in three constraints, namely sources, destinations, and capacities constraints, followed by Cauchy's distribution for solid transportation problem. The multi-choice programming and stochastic programming are combined into a solid transportation problem, and this new problem is called Multi-Choice Stochastic Solid Transportation Problem (MCSSTP). The solution concepts behind the MCSSTP are based on a new transformation technique that will select an appropriate choice from a set of multi-choice, which optimize the objective function. The stochastic constraints of STP converts into deterministic constraints by stochastic programming approach. Finally, the authors construct a non-linear programming problem for MCSSTP, and by solving it, they derive an optimal solution of the specified problem. A realistic example on STP is considered to illustrate the methodology.


2018 ◽  
Vol 15 (01) ◽  
pp. 95-112 ◽  
Author(s):  
Abhishekh ◽  
A. K. Nishad

To the extent of our knowledge, there is no method in fuzzy environment to solving the fully LR-intuitionistic fuzzy transportation problems (LR-IFTPs) in which all the parameters are represented by LR-intuitionistic fuzzy numbers (LR-IFNs). In this paper, a novel ranking function is proposed to finding an optimal solution of fully LR-intuitionistic fuzzy transportation problem by using the distance minimizer of two LR-IFNs. It is shown that the proposed ranking method for LR-intuitionistic fuzzy numbers satisfies the general axioms of ranking functions. Further, we have applied ranking approach to solve an LR-intuitionistic fuzzy transportation problem in which all the parameters (supply, cost and demand) are transformed into LR-intuitionistic fuzzy numbers. The proposed method is illustrated with a numerical example to show the solution procedure and to demonstrate the efficiency of the proposed method by comparison with some existing ranking methods available in the literature.


Author(s):  
Omar Besbes ◽  
Francisco Castro ◽  
Ilan Lobel

We consider the pricing problem faced by a revenue-maximizing platform matching price-sensitive customers to flexible supply units within a geographic area. This can be interpreted as the problem faced in the short term by a ride-hailing platform. We propose a two-dimensional framework in which a platform selects prices for different locations and drivers respond by choosing where to relocate, in equilibrium, based on prices, travel costs, and driver congestion levels. The platform’s problem is an infinite-dimensional optimization problem with equilibrium constraints. We elucidate structural properties of supply equilibria and the corresponding utilities that emerge and establish a form of spatial decomposition, which allows us to localize the analysis to regions of movement. In turn, uncovering an appropriate knapsack structure to the platform’s problem, we establish a crisp local characterization of the optimal prices and the corresponding supply response. In the optimal solution, the platform applies different treatments to different locations. In some locations, prices are set so that supply and demand are perfectly matched; overcongestion is induced in other locations, and some less profitable locations are indirectly priced out. To obtain insights on the global structure of an optimal solution, we derive in quasi-closed form the optimal solution for a family of models characterized by a demand shock. The optimal solution, although better balancing supply and demand around the shock, quite interestingly also ends up inducing movement away from it. This paper was accepted by David Simchi-Levi, optimization.


Sign in / Sign up

Export Citation Format

Share Document