ARITHMETIC MEAN APPROACH FOR

TIME MINIMIZING
TRANSPORTATION PROBLEM WITH
MIXED CONSTRAINTS

presented by:
RIYA TIWARI
MSC. MATHS
2204597
under the supervision of
PROF. SHAMBHU SHARMA
 INTRODUCTION
• In the literature, there are several methods for finding an initial basic feasible solution
to time minimizing transportation problem with equality constraints. But a very
unfortunate number of researchers proposed an algorithm for minimizing time in a
transportation problem with mixed constraints.
• In this dissertation, a new approach is proposed for solving minimizing time in a
transportation problem with mixed constraints. We have proposed an algorithm to
find an optimal shipping time for TMTP-MC by finding the average time for each
row and column and select the cell that containing minimum time corresponding to
row or column having largest average time. One by one we have calculate the fresh
largest average time for the remaining matrix and continue the process until all
supply and demand are satisfied.
• A shootout algorithm has been developed to find out the optimal solution of
TMTP- MC. The algorithm is free from required IBFS. This shooting procedure
yields an optimal solution directly, without touching intermediate solutions. The
cells of the transportation table with decreasing order of time are avoided
for allocation one by one until feasibility is maintained. The algorithm of the
proposed method converges in a finite number of steps and this method is not a
generalization of any existing methods for TMTP. Moreover, the algorithm works
for both TMTP-MC and TMTP.
Proposed Work
• To approach for a better solution we try to formulate an algorithm in time minimization
transportation problem with mixed constraints.

• One of our objective is to work on a real life problem based on proposed method and
shootout method.

• Comparative study of all the existing methods of TMTP-MC.

Work done
• The solution obtained by using the proposed algorithm,

The total transportation time required:

T = max{t11, t22, t33, t35}= max {8, 8, 8, 9 }= 9 units
• By using the shootout algorithm, the solution obtained is

The optimal transportation time :

T = max{ t11, t22, t33, t35 }=max {8, 8, 8, 9 }= 9 units
• The solution obtained by minimax method is

The total time of transportation :

T= max{t11,t12,t24,t25,t33,t35}= max{8,6,6,6,8,9}= 9
Conclusion...
• In the proposed algorithm source and demands are represented by the combination of less
equal, greater equal or equal to type constraints. To illustrate the proposed algorithm one
numerical example is solved. Our proposed methods provide initial basic feasible solution
in a simple and efficient manner, so the proposed approach is very easy to understand and
to apply. The solution obtained by this method is near to optimal ,sometimes an optimal
solution .
THANK YOU