scholarly journals Multi-choice stochastic transportation problem involving weibull distribution

Author(s):  
Deshabrata Roy Mahapatra

A solution procedure for multi-choice stochastic transportation problem is presented herewith some stochastic constraints containing parameters as supply and demand of Weibull distributionand cost coecients of objective function have multi-choice in nature of real life situation. At rst, allstochastic constraints are transformed into deterministic constraints by using the stochastic approach.A transformation technique is introduced for manipulation of multi-choice cost coecients of objectivefunction into equivalent deterministic form in terms of binary variables with additional restrictions.The auxiliary and additional constraints involving binary variables depend upon the set of consecutiveterms of cost coecients of the objective function whose sum is equal or nearer to the aspiration levels.Finally, a numerical example is presented to illustrate the solution procedure of the specied proposedmodel.

2020 ◽  
Vol 54 (4) ◽  
pp. 1119-1132
Author(s):  
Deshabrata Roy Mahapatra ◽  
Shibaji Panda ◽  
Shib Sankar Sana

The objective of the proposed article is to minimize the transportation costs of foods and medicines from different source points to different hospitals by applying stochastic mathematical programming model to a transportation problem in a multi-choice environment containing the parameters in all constraints which follow the Logistic distribution and cost coefficients of objective function are also multiplicative terms of binary variables. Using the stochastic programming approach, the stochastic constraints are converted into an equivalent deterministic one. A transformation technique is introduced to manipulate cost coefficients of objective function involving multi-choice or goals for binary variables with auxiliary constraints. The auxiliary constraints depends upon the consecutive terms of multi-choice type cost coefficient of aspiration levels. A numerical example is presented to illustrate the whole idea.


Author(s):  
Ahmed Hamoud ◽  
Kirtiwant Ghadle ◽  
Priyanka Pathade

<p>In the present article, a mixed type transportation problem is considered. Most of the transportation problems in real life situation have mixed type transportation problem this type of transportation problem cannot be solved by usual methods. Here we attempt a new concept of Best Candidate Method (BCM) to obtain the optimal solution. To determine the compromise solution of balanced mixed fuzzy transportation problem and unbalanced mixed fuzzy transportation problem of trapezoidal and trivial fuzzy numbers with new BCM solution procedure has been applied. The method is illustrated by the numerical examples.</p>


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.


2012 ◽  
Vol 22 (1) ◽  
pp. 115-129 ◽  
Author(s):  
Madhuri Jain ◽  
P.K. Saksena

This paper is aimed at studying the Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function (TMTP-FBOF). TMTP-FBOF is related to a Lexicographic Fractional Time Minimizing Transportation Problem (LFTMTP), which will be solved by a lexicographic primal code. An algorithm is also developed to determine an initial efficient basic solution to this TMTP-FBOF. The developed TMTP-FBOF Algorithm is supported by a real life example of Military Transportation Problem of Indian Army.


2020 ◽  
Vol 30 (1) ◽  
Author(s):  
Sharmistha Halder (Jana) ◽  
Biswapati Jana

An innovative, real-life solid transportation problem is explained in a non-linear form. As in real life, the total transportation cost depends on the procurement process or type of the items and the distance of transportation. Besides, an impurity constraint is considered here. The proposed model is formed with fuzzy imprecise nature. Such an interesting model is optimised through two different fuzzy programming techniques and fractional programming methods, using LINGO-14.0 tools followed by the generalized gradient method. Finally, the model is discussed concerning these two different methods.


2014 ◽  
Vol 5 (3) ◽  
pp. 1-26 ◽  
Author(s):  
Sankar Kumar Roy ◽  
Deshabrata Roy Mahapatra

This paper proposes 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 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 which will select an appropriate choice from a set of multi-choice which optimizes the objective function. The stochastic constraints of STP convert into deterministic constraints by stochastic programming approach. Finally, the authors have constructed a non-linear programming problem for MCSSTP and have derived an optimal solution of the specified problem. A realistic example on STP is considered to illustrate the methodology.


2017 ◽  
Vol 09 (06) ◽  
pp. 1750076 ◽  
Author(s):  
Gurupada Maity ◽  
Sankar Kumar Roy

This paper explores the study of fuzzy transportation problem (FTP) using multi-choice goal-programming approach. Generally, the decision variable in transportation problem (TP) is considered as real variable, but here the decision variable in each node is chosen from a set of multi-choice fuzzy numbers. Here, we formulate a mathematical model of FTP considering fuzzy goal to the objective function. Thereafter, the solution procedure of the proposed model is developed through multi-choice goal programming approach. The proposed approach is not only improved the applicability of goal programming in real world situations but also provided useful insight about the solution of a new class of TP. A real-life numerical experiment is incorporated to analyze the feasibility and usefulness of this paper. The conclusions about our proposed work including future studies are discussed last.


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.


2019 ◽  
Vol 29 (3) ◽  
pp. 337-358 ◽  
Author(s):  
Mitali Acharya ◽  
Adane Gessesse ◽  
Rajashree Mishra ◽  
Srikumar Acharya

In this paper, we considered a multi-objective stochastic transportation problem where the supply and demand parameters follow extreme value distribution having three-parameters. The proposed mathematical model for stochastic transportation problem cannot be solved directly by mathematical approaches. Therefore, we converted it to an equivalent deterministic multi-objective mathematical programming problem. For solving the deterministic multi-objective mathematical programming problem, we used an ?-constraint method. A case study is provided to illustrate the methodology.


Sign in / Sign up

Export Citation Format

Share Document