scholarly journals Decision making of transportation plan, a bilevel transportation problem approach

2005 ◽  
Vol 1 (3) ◽  
pp. 305-314 ◽  
Author(s):  
G.S. Liu ◽  
◽  
J.Z. Zhang ◽  
Keyword(s):  
Decision Making ◽  
Transportation Problem ◽  
Bilevel Transportation ◽  
Transportation Plan

A new algorithm for solving uncapacitated transportation problem with interval-defined demands and suppliers capacities

2021 ◽  
pp. 1-13
Author(s):  
Zeinul Abdeen M. Silmi Juman ◽  
Mahmoud Masoud ◽  
Mohammed Elhenawy ◽  
Hanif Bhuiyan ◽  
Md Mostafizur Rahman Komol ◽  
...  
Keyword(s):  
Decision Making ◽  
Transportation Problem ◽  
Global Economy ◽  
Heuristic Method ◽  
Polynomial Time Algorithm ◽  
Product Distribution ◽  
Decision Makers ◽  
Transportation Costs ◽  
Worst Case ◽  
Correct Estimation

The uncapacitated transportation problem (UTP) deals with minimizing the transportation costs related to the delivery of a homogeneous product from multi-suppliers to multi-consumers. The application of the UTP can be extended to other areas of operations research, including inventory control, personnel assignment, signature matching, product distribution with uncertainty, multi-period production and inventory planning, employment scheduling, and cash management. Such a UTP with interval-defined demands and suppliers capacities (UTPIDS) is investigated in this paper. In UTPIDS, the demands and suppliers capacities may not be known exactly but vary within an interval due to variation in the economic conditions of the global economy. Following the variation, the minimal total cost of the transportation can also be varied within an interval and thus, the cost bounds can be obtained. Here, although the lower bound solution can be attained methodologically, the correct estimation of the worst case realization (the exact upper bound) on the minimal total transportation cost of the UTPIDS is an NP-hard problem. So, the decision-makers seek for minimizing the transportation costs and they are interested in the estimation of the worst case realization on these minimal costs for better decision making especially, for proper investment and return. In literature very few approaches are available to find this estimation of the worst case realization with some shortcomings. First, we demonstrate that the available heuristic methods fail to obtain the correct estimation of the worst case realization always. In this situation, development of a better heuristic method to find the better near optimal estimation of the worst case realization on the minimal total costs of the UTPIDS is desirable. Then this paper provides a new polynomial time algorithm that runs in O (N2) time (N, higher of the numbers of source and destination nodes) for better estimation. A comparative assessment on solutions of available benchmark instances, some randomly generated numerical example problems and a real-world application shows promising performance of the current technique. So, our new finding would definitely be benefited to practitioners, academics and decision makers who deal with such type of decision making instances.

scholarly journals Bilevel transportation problem in neutrosophic environment

2022 ◽  
Vol 41 (1) ◽  
Author(s):  
Aakanksha Singh ◽  
Ritu Arora ◽  
Shalini Arora
Keyword(s):  
Transportation Problem ◽  
Bilevel Transportation

scholarly journals Fuzzy programming for multi-choice bilevel transportation problem

2021 ◽  
Vol 31 (3) ◽  
Author(s):  
Ritu Arora ◽  
Kavita Gupta
Keyword(s):  
Transportation Problem ◽  
Hotel Industry ◽  
Fuzzy Programming ◽  
Decision Makers ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Demand And Supply ◽  
Bilevel Transportation ◽  
Mixed Integer Programming Problem ◽  
Solution Methodology

Multi-choice programming problems arise due to diverse needs of people. In this paper, multi-choice optimisation is applied to bilevel transportation problem. This problem deals with transportation at both the levels, upper as well as lower. There are multiple choices for demand and supply parameters. The multi-choice parameters at the respective levels are converted into polynomials which transmute the defined problem into a mixed integer programming problem. The objective of the paper is to determine a solution methodology for the transformed problem. The significance of the formulated model is exhibited through an example by applying it to a hotel industry. The fuzzy programing approach is employed to obtain the satisfactory solution for the decision makers at the two levels. A comparative analysis is presented in the paper by solving bilevel multi-choice transportation problem with goal programming mode as well as by the linear transformation technique proposed in the paper by Khalil et al. The example is solved using computing software.

scholarly journals A Note on Feasibility and Optimality of Transportation Problem

2014 ◽  
Vol 10 (1) ◽  
pp. 59-68 ◽  
Author(s):  
Purnima Adhikari ◽  
Gyan Bahadur Thapa
Keyword(s):  
Decision Making ◽  
Operations Research ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Business Management ◽  
Optimal Solution ◽  
Basic Feasible Solution ◽  
Primal Dual ◽  
Dual Case ◽  
Decision Making Tool

 Transportation problem is one of the predominant areas of operations research, widely used as a decision making tool in engineering, business management and many other fields. In this paper, we present a brief literature review of transportation problem with its mathematical models in balanced and unbalanced cases. We report the basic feasible solution and hence the methods to attain optimal solution of the balanced transportation problem. Finally, we describe the primal-dual case of the problem with counter examples. DOI: http://dx.doi.org/10.3126/jie.v10i1.10879Journal of the Institute of Engineering, Vol. 10, No. 1, 2014, pp. 59–68

Sign in / Sign up

Export Citation Format

Share Document