Arithmetic Mean Approach for Time

Minimizing Transportation Problem With

Mixed Constraints

A Dissertation
Submitted in the partial fulfillment of the requirements for the
Degree of
Master of science
In
Mathematics
Submitted
By
RIYA TIWARI
Prof. Shambhu Sharma Prof. Gunjan Agarwal
Supervisor Head of the Department

Department of Mathematics
Faculty of Science
Dayalbagh Educational Institute (Deemed University)
Dayalbagh, Agra-282005
2023

Certificate
1
This is to certify that the thesis entitled, “Arithmetic Mean Approach for Time
Minimization Transportation Problem with Mixed Constraints” being submitted by
Riya Tiwari to Dayalbagh Educational Institute (Deemed University) Dayalbagh, Agra,
for the award of the degree of Master of Science in Mathematics, is a record of bonafide
research carried out by her in the Department of Mathematics, faculty of Science of this
Institute.

Prof. Shambhu Sharma Prof. Gunjan Agarwal

(Supervisor) (Head of Department)

1
 Declaration

I solemnly affirm that the dissertation entitled,’ Time Minimizing solution procedures
for the Transportation problem with mixed constraints embodies an original piece of
work carried out by me and has not been submitted, either in part or full to this or any
other university/ institute for the award of any degree.

…………………….

Riya Tiwari

M.Sc. Mathematics

Department of Mathematics

Faculty of Science

1
 In the literature, there are several methods for finding an optimal 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. The proposed methods are easy to understand and to apply for finding
an initial basic feasible solution to transportation problems happening in real-life
situations. We will solve a numerical problem and analyze the more-for-
paradoxical situation then solve it for finding the optimal solution.

Acknowledgement
1
First of all, most humbly, I would like to pray the Almighty God, for giving me such a
spontaneous flow inner strength to bring out my research work successfully completed. I
shall always remain grateful to all these people who have made my dissertation possibly
done.

At the outset, I would like to express my utmost gratitude to Dr. Shambhu Sharma, the
eminent Professor, Department of Mathematics, Faculty of Science, D.E.I., my able guide
and sincere Supervisor, for advising and guiding me from the very early stage of this
research. His wide and experienced knowledge, insightful suggestions and constant
encouragement were the most essential elements for making this research possible. I
really owe him a lot for his continuous efforts.

I express my deep sense of gratitude to Professor Gunjan Agrawal, Head, Department of

Mathematics, Faculty of Science, Dayalbagh Educational Institute, Dayalbagh, Agra, for
giving me much enthusiasm and encouragement by providing me with all required
facilities without which the dissertation would have not been in a lucid and
comprehensive manner.

I am very grateful to all the respected professors of the department for their motivation
and support whenever required.

I would like to say thanks to all others who have directly or indirectly helped me in the
realization of this Dissertation and at the same time I express my apology for failing to
mention their names here.

December 2023 RIYA TIWARI

Table of Contents

1
Certificate

Declaration

Abstract

Acknowledgement

Table of Contents

List of Table

Chapter 1: Introduction
Background

Time Minimizing Transportation Problem

Time Minimizing Transportation Problem with Mixed Constraints

Mathematical Formulation of TMTP-MC

Applications and Objectives of the Study

A Brief Review of Literature

Chapter 2: The Proposed Arithmetic Mean Approach for Time

Minimizing Transportation Problem with Mixed Constraints
Introduction

Mathematical Formulation of TMTP-MC with Cell Allocation Chart

Proposed Algorithm

Numerical illustration

Chapter 3: A Shootout Method for Time Minimizing Transportation

Problem with Mixed Constraints
Introduction

Feasibility Conditions

Determination of Shooting Preconditions

Cell Allocation Rule and the Algorithm

1
 Numerical illustration

Conclusion

Chapter 4: Minimax Method for Time Minimizing Transportation

Problem with Mixed Constraints
Introduction

Basic Feasibility Conditions

The Algorithm

Numerical illustration

Conclusion

Comparative Study

Conclusion

References

Chapter 1: Introduction
Background
Transportation Problem (Classical Transportation Problem) (TP) is one of the most
important and popular applications of the linear programming (LP) problem. It refers to a

1
class of linear programming problems that involves selection of most economical
shipping routes for transfer of a uniform commodity (goods) from a number of sources
(factories) 𝑆i , 𝑖 = 1,2,3 … 𝑛 to a number of destinations (warehouses) 𝐷j ,𝑗 = 1,2, 3,. . 𝑚.
The amount 𝑎i to be sent from each source, the amount 𝑏j to be received at each
destination, and the transporting cost 𝑐ij per unit shipped from any source to any
destination are specified. The transportation problem is to find the amount of
commodity 𝑥ij transported from 𝑖th source 𝑆i to 𝑗 th destination 𝐷j which minimizes over
all transporting cost satisfying demand and supply restrictions. In this problem objective
function is linear in decision variables 𝑥ij and all the source constraints and destination
constraints are of equality type. It is known as the balanced transportation problem if the
total supply capacity of all the sources is equal to total demand of all the destinations,
otherwise unbalanced.
In unbalanced transportation problem a dummy row for the case of demand greater than
supply and a dummy column for the case of supply greater than demand, are respectively
introduced to make the problem balanced. Initial basic feasible solution of classical
transportation problem is obtained by any one of the following methods namely,
Northwest Corner Method, Least Cost Method, Vogel’s Approximation Method and the
optimality of the solution is checked by MODI Method.
In practical life, it is seen that the supplying capacity of the supply points does not remain
constant all through due to the excess and shortage of manpower, machines, raw
materials etc., involved in production. In this situation sources impose some restrictions
on their supplying capacity like as at least or at most or equal to the fixed amount. Similar
restrictions occur for the demand of destinations also due to the variable amount of
consumption of commodity. Transportation problem with such restrictions on sources
and destinations are termed as transportation problem with mixed constraints.
In this problem some source constraints and destination constraints are of ‘equal to’ type,
some are of 'greater than or equal to’ type, some are of ‘less than or equal to’ type.
Transportation problem with such types of constraints is said to be transportation problem
with mixed constraints.
In real life, most of the transportation problem have mixed constraints, like job
scheduling, production inventory, production distribution, allocation problems, and
investment analysis.
Time minimizing transportation problem
The Bottleneck Transportation Problem (BTP) (classical bottleneck transportation
problem) or Time Minimizing Transportation Problem (TMTP) is defined as a Classical
Transportation Problem (TP) in which a time 𝑡ij,𝑖 = 1,2, … 𝑚; 𝑗 = 1,2, … 𝑛 is associated
with each shipping route rather than cost. The objective of the problem is to minimize the
1
maximum time of transporting all supplies to the destinations satisfying the demand and
supply conditions. Remaining assumptions on sources and destinations are same as that
of classical transportation problem.
The TMTP is encountered in connection with transportation of perishable stuff, various
medical treatment equipment, emergency provisions, fire services and military
equipment’s, where speed of delivery is highly essential than the transportation cost.
Such sort of issues is modeled as a time minimizing transportation problem.
Mathematically, the prime aim of TMTP is to find xij and tij, which
Minimize Z=max ⁡{i , j } {tij /xij>0}
Subject to constraints
n

∑ ❑xij = ai , i=1, 2...m

j=1

∑ ❑xij = bj , j=1, 2...n

i=1

xij ≥ 0
ai >0, ∀ i ∈I; bj >0 , ∀ j ∈J
Where,
I={1,2...m}=set of index of supply points
J={1,2...n}=set of index of demand points
tij=time required for transporting xij amount of commodity from ith supply point to jth
demand point

xij=amount of commodity transporting from ith supply point to jth demand point

ai=amount of commodity available at ith supply point

bj=amount of commodity available at jth demand point

m=number of supply point

n= number of demand point

𝑚 = Number of sources.
𝑛 = Number of destinations.
Oi = 𝑖th source
1
𝐷j= 𝑗th destination
Table 1.1: Time Transportation Table (TTT) for TMTP

Time minimizing transportation problem with mixed constraints

In real life, most of the time minimizing transportation problems appear with mixed
constraints due to changing economic and environmental conditions of producers and
distributors. Different sources and destinations impose different limitations (≥/=/≤) on
supply and demand respectively according to their availability and requirement. Time
minimizing transportation problem in which source constraints and destination
constraints are of mixed nature is said to be time minimizing transportation problem with
mixed constraints.
For example, in the case of transporting green groceries from the farm to the stores or
distributors, producers do not have precise knowledge of the available fruits and
vegetables for transportation in advance because of the changes in weather conditions,
availability of workers, and other uncertainty factors. Similarly, distributors also lack
precise knowledge of the market demand, as it may also vary over time.

Mathematical Formulation for TMTP-MC:

The mathematical formulation of TMTP-MC is to find 𝑥ij and 𝑡ij which
Minimize Z=max ⁡{i , j } {tij /xij>0}
Subject to constraints
n

∑ ❑xij ≥ ai, i∈ α 1
j=1

1
 n

∑ ❑xij = ai, i∈ α 2
j=1

∑ ❑xij ≤ ai, i∈ α 3
j=1

∑ ❑xij ≥ bj, j∈ β 1
i=1

∑ ❑xij = bj, j∈ β 2
i=1

∑ ❑xij ≤ bj, j∈ β 3
i=1

xij 0
ai >0, ∀ i ∈I; bj >0 , ∀ j∈ J

Where,
I=α 1 ∪ α 2 ∪ α 3 ={1,2...m}=set of index of supply points
J= β 1 ∪ β 2 ∪ β3={1,2...n}=set of index of demand points
tij=time required for transporting xij amount of commodity from ith supply point to jth
demand point

xij=amount of commodity transporting from ith supply point to jth demand point

ai=amount of commodity available at ith supply point

bj=amount of commodity available at jth demand point

m=number of supply point

n= number of demand point

𝑚 = Number of sources.
𝑛 = Number of destinations.
Oi = 𝑖th source

𝐷j= 𝑗th destination

Table 1.2: Time Transportation Table (TTT) for TMTP-MC

1
The objective of the problem undertaken is to minimize the time of transportation which
remains independent of the amount of commodities to be transported.
It is assumed that
➢ The carriers have sufficient capacity to carry goods from an origin to a destination in
a single trip.
➢ They start simultaneously from their respective origin.

Applications and Objectives of the Study

The TMTP-MC related problems have a great importance from practical standpoint and
are encountered in such situations:
(i) Transportation of perishable goods- In the transportation of perishable food
items such as fresh fruits, vegetables, milk, etc., duration of delivery is highly essential.
As any time lag in transportation may result in much larger loss than any cost advantage
attained by transporting it at lower cost.
(ii) Transportation of military equipment's- In military transportation, at the time
of emergency, military armaments or weapons are required to be delivered from their
military bases to battlefronts, where time of transportation is of prime consideration.
(iii) Transportation of emergency relief goods- At the time when natural calamities
like earthquakes, floods, tsunami, etc., strike, emergency relief goods are required to be
transported in minimum time. As a brief delay may cause massive loss of lives.

1
(iv) Transportation of medical supplies- In hospital transportation, ambulances,
medicines, blood (or blood products) and other medical supplies are needed to be timely
delievered.
objectives:
 To approach for obtain an optimal solution, we try to formulate an algorithm for
TMTP-MC by an alternate way(Arithmetic Mean).

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

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

A Brief Review of Literature:

The Transportation problem was first formulated mathematically by F.L. Hitchcock in
1941[1] and discussed in detail by the Nobel Laureate T.C. Koopmans in 1947 paper.
The linear programming formulation of the transportation problem and associated
solution procedure were first given by G.B. Dantzig in 1951.
Time Minimization Transportation Problem was originally contributed by Hammer 1969
[2] has given a method for finding those solution of a transportation problem which
minimize the total time necessary for transporting goods from the suppliers to the
consumers. Several extensions of the model are presented.
Garfinkel and Rao 1971 [3] has developed two algorithms for solving the bottleneck
transportation problem with equality constraints. One of them is a primal approach in the
sense that improving feasible solutions are obtained at each iteration. The other is a
“threshold” algorithm which is found to be far superior computationally.
Sharma and Swarup 1977 [4] developed a procedure for time minimization in TP and
consists of a finite number of iterations and is based on moving from a basic feasible
solution to another till the last solution is arrived at.
The concept of mixed constraints in TP originated from the study of Appa (1973) [5],
Brigden (1974) [6] and is considered as its generalized case. But no study was conducted
on TMTP-MC, except in Agarwal and Sharma (2014, 2018).

1
Agarwal and Sharma 2014 [7] considered TMTP-MC problem which minimizes the
maximum time of duration to accomplish the requirements of n demand points using the
capacity of m supply points. An open loop method has been developed for improving the
initial basic feasible solution by shifting the basic cells to other basic cells or non- basic
cells having less time.
Ahmed et al. 2015 [8] had developed a transportation algorithm to obtain a better initial
basic feasible solution in time minimizing transportation problem.
Agrawal and Sharma (2018) [9] have considered a minimax method for TMTP-MC. The
solution obtained by this method is near to optimal sometimes Un optimal solution.
Agrawal and Sharma 2020[10] have developed a shootout method to determine an
optimal transportation time in time minimizing transportation problem with mixed
constraints by avoiding the cells associated with greatest time for allocation. In the path
of getting the minimum time of transportation, cells are avoided one by one in decreasing
sells are allocated to find the optimal solution. The greatest time of positive allocated
cells gives the optimal time. A shoot out algorithm has been developed and it is
demonstrated with some numerical illustration.
Recently, Agrawal and Sharma 2022[11] have developed a method to determine to
identify and resolve the existence of paradoxical situation in the TMTP-MC using right
hand side parametric formulation. Using this approach, the paradoxical solution can be
found first, followed by an optimal solution.
The remainder of this dissertation is organized as: in chapter 2, the proposed arithmetic
mean approach is discussed to solve the problem. In chapter 3, The shootout method is
used to solve real life problem. In chapter 4, another method is Minimax method is
discussed to solve a problem. At the end of all the chapters, we do a comparative study to
see if our proposed method gives an optimal solution or not and end the dissertation with
a conclusion.

Chapter 2: The Proposed Arithmetic Mean Approach

for Time Minimizing Transportation Problem with
Mixed Constraints

Introduction

1
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. In this we have to move with an idea as to
find an optimal shipping time for TMTP-MC by finding the average time for each row
and column and put them in front of the row on the right and below the corresponding
column respectively in the time minimizing transportation table and select the cell that
containing minimum time corresponding to row or column having largest average time.
In the selected cell we will give the allocation. One by one we will be calculating the
fresh largest average time for the remaining matrix and continue the process until all
supply and demand are satisfied.
The proposed methods are easy to understand and to apply for finding an solution to
transportation problems happening in real-life situations.
However now we describe some real situations about transportation. To sending disaster
relief in aftermath of suddenly happened Hurricane, Earthquake, Tsunami or Flood. Any
collaps, or a daring rescue mission, for any medical emergency such as Dengue,
Chikungunya, Typhoid, or any other disease that spreading in epidemic form to tackle
this situation sufficient medicine/diet or ambulance service could move as early as
possible, weapons used in military operations, where in times of emergency, in the
transportation of unpreserved goods such as fresh fruits and vegetables, etc. Same types
of many other examples are exits around us where the speed of delivery is more
important than the transportation cost.

Mathematical Formulation with Cell Allocation:

The LPP model time minimization transportation problem with mixed constraints is
Minimize Z= max ⁡{i , j }{tij /xij>0}
Subject to constraints
n

∑ ❑xij ≥ ai, i ∈ α1
j=1

1
 n

∑ ❑ xij = ai, i ∈ α2
j=1

∑ ❑ xij ≤ ai, i ∈ α3
j=1

∑ ❑xij ≥ bj, j ∈ β1
i=1

∑ ❑xij = bj, j ∈ β2
i=1

∑ ❑xij ≤ bj, j ∈ β3
i=1

xij ≥ 0
ai >0, ∀ i ∈I; bj >0 , ∀ j ∈J

Where,
I=α 1 ∪ α 2 ∪ α 3 ={1,2...m}=set of index of supply points
J= β 1 ∪ β 2 ∪ β3={1,2...n}=set of index of demand points

The cell allocation chart:

The Proposed Algorithm:

1
Step-1: Construct the time transportation table for the given problem. This involves
setting up a table with rows representing sources (supply) and columns representing
destinations (demand), with associated costs or quantities.
Step-2: Find the average time for each row and column and put them in front of the row
on the right and below the corresponding column respectively.
Step-:3: Select the cell containing minimum time corresponding to largest average time.
Step-4: Use a chart or predefined rules to assign supply and demand units to the selected
cell based on capacity or demand.
Step-5: Allocate units according to a predefined chart or rule, focusing on cells with the
lowest time in the row or column selected in step 3. Resolve ties by selecting the cell with
the minimum time. Because our main objective is to find out the minimum time. Allocate
as our proposed chart and adjust supply and demand and cross off the necessary
row/column.
Step-6: Calculate fresh average time for the remaining submatrix as in Step 2 and
allocate and complete the procedure of Steps 3, 4 and 5. Continue the process until all
rows and columns are satisfied.
Step-7: If all supply and demand are exhausted, then go to step-9, otherwise step-8.
Step-8: Distribute any remaining supply or demand to cells that meet the constraints
(supply and demand) and select cells with the minimum time. If constraints cannot be
met, leave non-allocated units as such. Remaining (if necessary) on allocated supply
/demand unit shift: Where supply and demand constraints satisfies. Choose in which cell
is minimum for minimize time.
Otherwise, non-allocated unit should not allocate.

Step-9: Identify the largest time corresponding to basic cells (cells with allocated units)
to evaluate the efficiency of the solution.

Numerical Illustration:

1
For any medical emergency such as COVID. Delhi City Corporation Mayor (North and
South) open five emergency medicine collection booths or warehouse in four corners in
Delhi city. They collect medicine from three reputed pharmaceutical companies such as
A, B and C pharma situated outside Delhi. A has a production capacity of at most 80
units, B has a production capacity of at least 120 units and C Pharma has a production
capacity of exactly 140 units. Likewise, collection booth-1 having capacity of demands
exact 40 units, booth-2 having capacity of demands at least 40 units, booth-3 having
capacity of demands exact 60 units, booth-4 having capacity of demands at most 80 units
and booth-5 having capacity of demands at least 80 units.
A 3 × 5 time minimizing transportation table

Step 1: formulate the given problem

Step 2: find the average of each row and column

Then step by step completed the procedure and get the table below:

Therefore, the solution of give problem is

1
 x = 40, x = e, x = 120, x = 60 and x = 80
11 14 22 33 35

and the corresponding time of the cells are

t11=8, t22 = 8, t33 =8, t35 = 9
therefore, the total transportation time required
T=max{ t11, t22, t22,, t35 }={8,8,8,9}=9 hrs

So, the total transported unit is 300 and required maximum time 9.

1
Chapter 3: A Shootout Method for Time Minimizing
Transportation Problem with Mixed Constraints

Introduction

This chapter focuses on determining an optimum transportation time for TMTP-MC by

avoiding the cells associated with greatest time for allocation. In the direction of getting
the minimum time of transportation, cells are avoided one by one in decreasing order of
time as long as the problem sustains feasibility. Thereafter, remaining cells are allocated
to find the optimal solution. The greatest transportation time of positively allocated cells
is the optimal transportation time.
For the existence of a feasible solution of CMTP-MC, Brigden [24] developed the
necessary and sufficient conditions, which are designed in certain cases. The problems
are tested for feasibility through these conditions. But such conditions are not discussed
for TMTP-MC, as the problem is newly formulated.
To the best of our knowledge, blocking approach is nowhere available in literature for
TMTP-MC. The basic requirement to obtain an optimal solution for TMTP-MC by
shootout method is to develop the necessary and sufficient conditions for the existence of
its feasible solution. The present chapter fulfills this requirement. The conditions to avoid
a cell are only its feasibility conditions in the absence of that cell. These conditions are
termed as the shooting preconditions, which are also developed in the form of SSP
(Supply Shooting Preconditions) and DSP (Demand Shooting Preconditions). Before
shooting a cell, these preconditions are checked.
The cells are shot, one by one, in decreasing order of time, till the shooting preconditions
remain satisfied. In between the shooting process, if there exists only one live (the one
that is not shot) cell in any row or column, they are assigned iteratively, according to the
generated allocation rule. This process stops at the stage where at least one of the SSP
and DSP fails. After that, assignment of remaining cells is carried out, keeping the rim
requirements satisfied. The maximum shipment time corresponding to basic cells is then
declared as the optimal shipment time.

1
Feasibility Conditions:
Note that the flow of transportation in every feasible solution of TMTP-MC is at least
❑ ❑

Max { ∑ ❑ai , ∑ ❑bj }

i ∈ α 1 ∪ α2 j ∈ β1 ∪ β2

Brigden (1974) has formulated the necessary and sufficient conditions for the existence
of a feasible solution to the cost minimizing transportation problem with mixed
constraints (CMTP-MC) in some cases. Similarly, we have framed the necessary and
sufficient conditions for the existence of a feasible solution to the above TMTP-MC. We
know that for a problem to be feasible, it is essential that all the supplies should be
consumed by the respective demand values, and vice versa. In TMTP-MC, the
restrictions on rim requirements are different, so all the necessary supplies (or demand
should be less than or equal to all the demand (or supply) values.
Clearly, the sum of lower bound (LB) of all supplies should be less than or equal to the
sum of upper bound (UB) of all demands.

m n
i:e:, ∑ LB ( ai ) ≤ ∑ UB ( b j )
i=1 j=1

Similarly, the sum of lower bound of all demands should be less than or equal to the sum
of upper bound of all supplies

n m
i:e:, ∑ LB ( b j ) ≤ ∑ UB ( ai )
j=1 i=1

The above-mentioned conditions ensure that the problem is feasible and will yield a
feasible solution. The lower bound and upper bound on rim requirements of TMTP-MC
respectively are defined as follows:

1
Determination of Shooting Preconditions:
Theorem 1:The feasibility conditions of a feasible TMTP-MC in the absence of (r,s) cell
❑ ❑

are LB ( a r ) ≤ ∑ UB ( b j ) and LB ( b s ) ≤ ∑ UB ( ai ) where , I'={ i :i∈ I , ( i, s ) is a dead cell }

j ∈J−J − { s} i ∈I −I − {r }
' '

and J'={ j: j∈ J , ( r , j ) is a dead cell }

Proof. In time transportation table, rth supply and sth demand gets directly affected in the
absence of (r,s) cell, in the sense of fulfilling the rim requirements. For a feasible TMTP-
MC, the necessary and sufficient conditions must hold. Thus, the r th supplying capacity
gets fully consumed only if
❑
LB ( a r ) ≤ ∑ UB ( b j ) where, r∈I
j ∈J

For the sth demand capacity gets fulfilled only if

❑
LB ( b s ) ≤ ∑ UB ( ai ) where, s∈I
i ∈I

Since (r,s) cell is absent, the rth supply is not permitted to be absorbed by the sth demand.
In order to accommodate the rth supply through different (other than the sth) demand
points, it is necessary that
❑
LB ( a r ) ≤ ∑ UB ( b j )
j ∈J− { s}

Similarly, the sth demand is also not allowed to be fulfilled by the rth supply. To fulfill the
sth demand through the supply points other than the rth supply point, it is necessary
that
❑
LB ( b s ) ≤ ∑ UB ( a i )
i ∈I − {r }

1
Thus, in the absence of any dead cells in time transportation table, feasibility c onditions,
referred to as shooting preconditions are stated in (4) and (5). But after the first iteration,
some cells are live while the others become dead and the dead cells directly influence the
shooting preconditions. Let us suppose the rth row and/or the sth column contains some
dead cell(s) and the sets of indices of those dead cells are defined as I'={i:i∈I,(i,s) is a
dead cell} and J'={j:j∈J,(r,j) is a dead cell}, then shooting preconditions will be transform
as follows:
❑ ❑
LB ( a r ) ≤ ∑ UB ( b j ) and LB ( b s ) ≤ ∑ UB ( ai )
j ∈J−J − { s} i ∈I −I − {r }
' '

The two shooting preconditions obtained in are called as supply shooting preconditions
(SSP) and demand shooting precondition (DSP) respectively for TMTP-MC. This proves
the theorem.
It is known that, in TMTP,α 1=α 3=β 1=β 3=φ , where φ denotes the empty set.
Also, LB(ai) =UB(ai) =ai for i∈ α 2 and LB(bj) =UB(bj) =bj for j∈ β 2
Therefore, shooting preconditions SSP and DSP for TMTP become
❑
ar ≤ ∑ bj
i ∈J −J − {s }
'

and
❑
bs≤ ∑ ai
i ∈I −I − {r }
'

In the shooting process, if a single unassigned live cell exists in a row (or a column),then
the minimum capacity of corresponding supply (or demand) must be achieved only
through that cell. Therefore, in general, a single live cell cannot be shot out. But it may
also be shot out, in a particular case, as shown in Theorem 2.
Theorem 2: The only unassigned live cell of any row (or a column) of ‘≤ 'ype can be
shootout if it holds just DSP (or SSP).
Proof. It is known that a cell can be shot if it satisfies both SSP and DSP. Now let us
consider (r,p) to be the only unassigned live cell in the r th row of ‘≤’ type. The SSP for
❑ ❑

cell (r,p) is LB ( a r ) ≤ ∑ UB ( b j ) i.e; LB ( a r ) ≤ ∑ UB ( b j )

j ∈J−J − { p }
'
j ∈φ

since J'=J-{p}. It is observed that there is no demand point to accommodate the supplying
capacity of the rth supply point. But for r 2 a3, the lower bound being 0, no demand point
1
is needed to assimilate zero units of rth supply point. That is, SSP is satisfied for cell
(r, p) and will shoot only if DSP is satisfied. Similarly, the only unallocated live cell (q,s)
of the sth column of ‘≤’ type will be shot only if SSP is satisfied. Hence the theorem.
After failure of at least one of the shooting preconditions (SSP or DSP), the shooting
process terminates. The live cells are then assigned to meet the conditions of feasibility
and the optimum transportation time will be the maximum time among all the shipment
time associated with the live cells.
Cell allocation and The Algorithm:
Limited number of live cells are available to accomplish the requirements of demand and
supply. Random assignment does not satisfy the necessary flow of transportation, as total
absorbing capacity of all the live cells in any row, corresponding to ‘=’ and ‘≤’ type
demand, is limited yet enough to accommodate row capacity. But in case, if the demands
corresponding to those cells are fulfilled by live cells of some other row(s), then the
concerned supply becomes non-adjustable sometimes, which results in failure to attain a
feasible solution. Sometimes, similar situations occur for the adjustment of demands also.
To overcome this situation, we need to search out such cells to allot them first.
For that purpose, we select uth row(s), whose all-unassigned live cells (u, j) are of j th
column, j ∈ β 2 ∪ β3 . In a similar way, we select v th column (s), whose all-unassigned live
cells (i, v) are of i th row, i∈ α 2 ∪α 3. The live cells of selected rows and columns are
assigned one by one, as per the preference of supply-demand pair given in Table. Later
on, assign the remaining live cells analogously.
Ties in selection of live cells to assign are broken by selecting a row/column having
minimum number of live cells in it.
Note that the cells allocated with ε units are treated as basic cells with zero allocations.

Cell allocation table:

1
The Algorithm:

Step 0: Construct the time transportation table for the given problem.
Step 1: Check for the existence of the only unallocated live cell in any row/column
associated with ‘≥’ or =’ sign. If it exists, assign it using the cell allocation rule in Table
and update the transportation table.
Step 2: Search target cell (r,s) consisting transportation time trs = max tij /xij =o}
Step 3: Find I'={i:i∈I,(i,s) is a dead cell} and {j:j∈J,(r,j) is a dead cell }
Step 4: Check the shooting preconditions (SSP and DSP) for target cell
❑ ❑

i.e; LB ( a r ) ≤ ∑ UB ( b j ) LB ( b s ) ≤ ∑ UB ( ai )
j ∈J−J − { s} i ∈I −I − {r }
' '

If these conditions hold, then shoot that cell and go back to Step 1. Else, move
to Step 5.
Step 5: Select row(s)/column(s) of which all unassigned live cells are located in j th
column/i th row where, j ∈ β 1 ∪ β3 / i∈ α 2 ∪α 3.If such row/column exist, then detect
associated live cells of category I and go to Step 6, otherwise proceed to Step 7.
Step 6: Assign category I cells in accordance with the rule given in Table .

1
Step 7: Using Table , allocate the remaining category II cells.
Step 8: Determine the optimum transportation time as T= max{ tij / xij > 0}.
Note that the number of iterations is the number of cycles from Step 1 to Step
4 of the algorithm.
In the problem of finite size m× n, only one cell is being shot at each iteration. The
number of least allocated cells is max{ m, n} and that at most is mn: Therefore, the
number of shooting (dead) cells(the number of iterations) will be at most mn - max{ m,
n} and at least 0. This shows that the algorithm converges into a finite number of
iterations.

Numerical Illustration:
For any medical emergency such as COVID. Delhi City Corporation Mayor (North and
South) open five emergency medicine collection booths or warehouse in four corners in
Delhi city. They collect medicine from three reputed pharmaceutical companies such as
A, B and C pharma situated outside Delhi. A has a production capacity of at most 80
units, B has a production capacity of at least 120 units and C Pharma has a production
capacity of exactly 140 units. Likewise, collection booth-1 having capacity of demands
exact 40 units, booth-2 having capacity of demands at least 40 units, booth-3 having
capacity of demands exact 60 units, booth-4 having capacity of demands at most 80 units
and booth-5 having capacity of demands at least 80 units.
Table 1: A 3×5 transportation table for mixed constraint:

Step 0-1: There is no single unassigned live cell in any row or column of Table1 .
Step 2: In the table, the maximum time of transportation is t 34 =13. So the target cell is
(3, 4).
Step 3: All the cells are live at initial stage, therefore I'=φ and J'=φ .

1
Step 4: By the shooting preconditions (SSP and DSP) for target cell (3, 4), we have
i.e., 140 < 40 + M + 60 + M and, 0 < 80 + M.
Since M is large enough and is on RHS, it satisfies both SSP and DSP. So, shoot the cell
(3, 4), which is shown as a shaded cell.
By successively executing the steps 1 to 4, cells (3, 1), (3, 2), (1, 5), (2, 3) and (2, 1) are
shot in the given order, as shown in Table 3by the shaded cells.
(1, 1) is the only unassigned live cell of 1st column. Since it is a single cell, allocate it
with min(80, 40) i.e., 40 units in accordance with cell allocation table, and update the
supply of 1st row and demand of 1st column to get updated. Now, the maximum time of
transportation in table 2 is t 35=9, so the target cell is (3, 5). There are dead cells in the
corresponding row and column of the target cell and the indices of dead cells in 3rd row
and 5th column are 1, 2, 4 and 1, respectively. So, I' ={1} and J'={1,2,4}.
Then by shooting preconditions, we have i.e., 140 ≮ 60, that clearly discards SSP.
Thus, it is not possible to shoot the cell (3, 5) and the shooting process terminates.
Table 3:

Step 5: In Table 3, we have just 3rd column of which all unassigned live cells viz. (1, 3)
and (3, 3) are located in row having supply of ‘=’ and ‘≤’ type. That is, (1, 3) and
(3, 3) are category I cells and rest are category II cells.
Step 6: Following the order given in cell allocation table, we prefer cell (3, 3) to receive
min(60, 140) = 60 units.
Step 7: Using cell allocation table , fulfill the remaining category II cells by assigning 80
units to cell (3, 5), 120 units to (2, 2) and e units to cell (1, 4) which yield
x = 40, x = e, x = 120, x = 60 and x = 80
11 14 22 33 35

Step 8: The optimum time of transportation is

T=max{ t11, t22, t22,, t35 }={8,8,8,9}=9 hrs

Conclusion:
1
In this chapter, 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 algorithm of this method converges in a finite number of steps and
this method is not a generalization of any existing methods for TMTP.

Chapter 4: Minimax Method for Time Minimizing

Transportation Problem with Mixed Constraints

Introduction
In this chapter , a new method named, ‘A Minimax Method’ is known for getting
an basic feasible solution is a key to reach an optimal solution. As the name
‘minimax’ suggests, assignments are made to the minimum time of a row/column
containing maximum time of transportation table. It is known that all the basic
feasible solutions of the problem with equality type rim requirements are also a
basic feasible solution of mixed type requirements. Thus the focus of the method
is to find IBFS for the problem with equality type rim requirements. To obtain the
minimum transportation time, we relate the mixed type constraints of the problem
with equality constraints as shown below:

Minimize=max {t ij ; x ij > 0 }
i, j

Subject to constraints,
❑
∑ ❑ x ij=a i ,i∈ α 1 ∪ α 2 ∪ α 3
j=J

❑
∑ ❑ x ij=b j ,j∈ β 1 ∪ β 2 ∪ β 3
i=I

xij > 0

1
 ai >0, ∀ i ∈I; bj >0 , ∀ j ∈J
This related TMTP be either balanced or unbalanced. If unbalanced, a dummy row

( ) ( ) is introduced in table.
m n n m

∑ ai < ∑ b j or a dummy column ∑ b j < ∑ ai

i=1 j=1 j=1 i=1

I =I ∪ { m+1 } , J =J , t m+1 , j=0

' '
In case of dummy row, we introduce and
n m
a m+1=∑ b j−∑ ai , while for a dummy column, I ' =I , J ' =J ∪ { n+1 } , t i , n+1=0 and
j=1 i=1
m n
a n+1=∑ ai−∑ b j .
i=1 j=1

Otherwise ,for I'=I and J' =J for balanced one.

Transportation Table with dummy row

Transportation Table with dummy column

1
Basic Feasibility Conditions:

1
The solution obtained is the basic feasible solution of (P*). In the basic feasible solution
of (P*), some dummy cells may be basic cells. In the presence of such basic cells, the
solution of (P*) may not be the solution of (P). To search the solution of (P), we shift the
assignment of such dummy cell of other cell of its row/column.
Suppose xij =