Abstract:In this paper, we consider the situations when transportation problems with and without budgetary constraints where demand and budget are imprecise. We have proposed interval-point method for finding an optimal solution for transportation problems. We compared this method with zero suffix method. For better understanding, the solution procedure is illustrated with a numerical example.

The transportation problem is a special type of linear programming problem, which deals with transport commodities from sources to destinations. In many real life situations, the commodity does vary in some characteristics according to its source and the final commodity mixture reaching at destinations, may then be required to have known specifications. In order to reduce information costs and also to construct a real model, the use of interval and fuzzy transportation problems are more appropriate. In an interval transportation problem, information about the range of variation of some (or all) of the parameters is available, which allows to specify a model with intervals. The transportation problem (TP) is a special class of linear programming problem, which deals with commodities from sources to destinations. In literature, a good amount of research has available to obtain an optimal solution for balanced transportation problems. But in real life situations, the decision maker faces an unbalanced transportation problem in which total supply is less than the total demand. Kishore and Jayswal [2] introduced a method, called fuzzy approach, to solve unbalanced transportation problem with budgetary constraints. Peerayuth Charnsethikul and Saeree Sverasreni [4] discussed a method for solving the constrained bottleneck transportation problem under budgetary condition. Pandian and Natarajan [3] introduced the zero point method for finding an optimal solution to a classical transportation problem. Lin and Cheng [8] gave a genetic algorithm for solving a transportation network under a budget Constraint. Senapati and Tapan Kumar [5] investigated fuzzy multi-index transportation problem with budgetary restriction. Khanna et al. [6] introduced an algorithm for solving transportation flow under budgetary constraints. Tiwari et al. [7] investigated how the preemptive priority structure can be used in fuzzy goal programming problems. Weighted goal programming for unbalanced single objective transportation problem with budgetary constraint has been discussed by Kishore and Jayswal [1].

In this paper, we have proposed interval-point method for finding an optimal solution for transportation problems with and without budgetary constraints. We compared this method with zero suffix method. For better understanding, the solution procedure is illustrated with a numerical example.

2. Preliminaries

We need the following definitions of the basic arithmetic operators and partial ordering on closed bounded intervals which can be found in [4].

Let D = { , a b and a and b are in R} denote the set of all closed bounded intervals on the real line R.

Definition 1: Let and be in D. Then,

;

, where and

Consider the following transportation problem with budgetary constraints:

(A) Find the values of x_{ij}, i = 1,2,…m; j = =1,2,…n such that the following conditions are satisfied:

(1)

(2)

, i=1,2,…m and j=1,2,…n (4)

Where c_{ij} is the cost of shipping one unit from supply point i to the demand point j;

a_{i} is the supply at supply point i; is the imprecise demand at demand point j;

x_{ij} is the number of units shipped from supply point i to demand point j and [z_{1},z_{2}] is the imprecise budget.

The transportation problem related to the problem (p) is given below:

(IP) Minimize

Subject to

, i = 1,2,…m and j = 1,2,…n and integers.

Now, we need the following condition which finds a relation between optimal solutions of an interval transportation problem and a pair of induced transportation problems.

If the set { for all i and j} is an optimal solution of the upper bound transportation problem (UP) of (IP) where

(UP) Minimize

_{ }subject to

, i= 1,2,…m and j = 1,2,…n and are integers

And the set { for all i and j} is an optimal solution of the lower bound transportation problem (LP) of the problem (IP) where

(LP) Minimize _{}

Subject to

, i=1,2,…m and j=1,2,…n and are integers,

Then the set of intervals { , for all i and j} is an optimal solution of the problem (IP) provided _{ , }for all i and j.

3. Interval-Point Method

We, now propose a new method namely, interval-point method for finding an optimal solution to the problem (P). The interval-point method proceeds as follows:

Step 1: Construct an interval transportation problem (IP).

Step 2: Check whether it is balanced or unbalanced. If it is balanced go to step 4 otherwise go to next step.

Step 3: Convert the unbalanced transportation problem in to balanced transportation problem.

Step 4:Construct the upper bound transportation problem (UP) of the problem (IP) and solve the problem (UP) by the zero point method [6]. Let {y, for all i and j} be an optimal solution to the problem (UP).

Step 5: Construct the lower bound transportation problem (LP) of the given the problem (IP) and solve the problem (LP) with the upper bound constraints , for all i and j by the zero point method [6]. Let { for all i and j} be the optimal solution to the problem (LP) with , for all i and j.

Step 6: The optimal solution to the problem (IP) is {[ ], for all i and j} by the optimal objective values of the problem (IP) is

Step 7: Let be the given budget cost for transportation cost of the given UTPBC. Now, we are write Z as in the form, for some , . This implies

Here, we considered two cases,

Case 1: Values of Z is known i.e. fixed or given.

Case 2: Value of Z is not known.

Step 8: Compute the values of decision variables

,

where µ is as in step 7(including Case I and II).

Step 9: The optimal solution to the given UTPBC is

for the given budget is Z.

4. Numerical Example

The interval-point method for solving transportation problem with budgetary constraints is illustrated by the following example:

There are four warehouses i.e. source from where the food grains are supplied to three different destinations i.e. demand stations. C_{ij}’s are the cost coefficients expressed in rupee per metric ton and a_{i}’s, l_{j}’s and u_{j}’s are expressed in lakhs of metric ton. The transportation matrix is given in the following table:

D_{1}

D_{2}

D_{3}

S..

O_{1}

5

8

3

≤ 10

O_{2}

7

4

5

≤4

O_{3}

2

6

9

≤4

O_{4}

4

6

6

≤12

D..

[6,12]

[7,14]

[7,14]

Determine an optimal distribution plan to transport the items from the source points to the destination points for the budget Rs.100. Now, the interval transportation problem (IP) to the given problem is given below:

D_{1}

D_{2}

D_{3}

Supply

O_{1}

[5,5]

[8,8]

[3,3]

[10,10]

O_{2}

[7,7]

[4,4]

[5,5]

[4,4]

O_{3}

[2,2]

[6,6]

[9,9]

[4,4]

O_{4}

[4,4]

[6,6]

[6,6]

[12,12]

D

[6,12]

[7,14]

[7,14]

Now, the upper bound problem of (IP), (UP) of the problem (IP) is given below:

D_{1}

D_{2}

D_{3}

Supply

O_{1}

5

8

3

10

O_{2}

7

4

5

4

O_{3}

2

6

9

4

O_{4}

4

6

6

12

Demand

12

14

14

Now, using the zero point method, the optimal solution to the problem (UB) is: _{ }= 10, =4, _{ }= 4, _{ }= 8, and = 4.

Now, the lower bound problem of interval transportation problem with the upper bounded (LB) constraints is:

D_{1}

D_{2}

D_{3}

Supply

O_{1}

5

8

3

10

O_{2}

7

4

5

4

O_{3}

2

6

9

4

O_{4}

4

6

6

12

D..

6

7

7

With , i= 1, 2,…,m and j = 1,2,…n.

Now, using the zero point method, the optimal solution to the problem (LB) is

_{ }= 7, =4, _{ }= 4, _{ }= 2, and = 3.

Now, as in the step 3., we consider the optimal solution to the problem (IP) is [x°_{13},y°_{13}] = [7,10], [x°_{22}, y°_{22}] = [4,4], [x°_{31}, y°_{31}] = [4,4], [x°_{41},y°_{41}] = [2,8] and [x°_{42},y°_{42}] = [3,4] and also, the minimum interval transportation cost is [71,110].

Now, as in step 4, we have the total transportation cost as Z = 71 + 39 µ where Z is given budget. This implies that

Now, as in step 5 and the step 6, we have

x_{22}=4; x_{31}=4;

Case 1:

Given Z = 100. Then, the optimal solution to the given TPBC for Z = 100 are:

Now we compared the above method with zero suffix method [2], the optimal solution to the problem (UB) is: _{ }= 10, =4, _{ }= 4, _{ }= 8 , and = 4. and the optimal solution to the problem (LB) is: _{ }= 7, =4, _{ }= 4, _{ }= 2, and = 3.

Remaining process is same as the above.

5. Conclusion

In this paper, we have considered the transportation problem with and without budgetary constraints cases. The proposed without budgetary constraints method is useful for finding an optimal solution for decreasing or reducing the cost and finding a compromise solution. It is very easy to understand and easy to compute. Also, enables the decision makers to optimize the economical activities and make the correct managerial decisions depending on their financial position. The proposed method enables the decision makers to evaluate the economical activities and make self satisfied managerial decisions when they are handling a variety of transportation problems with budgetary constraints. We compared this method with zero suffix method. We found that, by both these methods we got the same result. When transportation problem with and without budgetary constraints situation occurred then our proposed method may be more useful.

References:

Charnsethikul Peerayuth and Sverasreni Saeree, (2007) The constrained bottleneck transportation problem. Journal of Mathematics and Statistics, 3:24-27.

Fegade M.R., Jadhav V. A. and Muley A. A., (2011) Solution of multi-objective transportation problem using zero suffix and separation method, International eJournal of Mathematics and Engineering, 118:1091-1098.

Khanna Saroj, Bakhshi H.C. and Puri M.C. (1983) Maximizing transportation flow under budgetary constraints, NZOR, 11:41-50.

Kishore N. and Jayswal Anurag, (2001) Prioritized goal programming formulation of an unbalanced transportation problem with budgetary constraints, Industrial Engineering Journal,9:16-19.

Kishore N. and Jayswal Anurag, (2002) Prioritized goal programming formulation of an unbalanced transportation problem with budgetary constraints: A fuzzy approach. Opsearch, 39:151-160.

Lin Yi-Kuei and Yeh Cheng-Ta, (2011) Maximizing network reliability for stochastic transportation networks under a budget constraint by using a genetic algorithm. International Journal of Innovative Computing, Information and Control, 7:7033- 7050.

Pandian P. and Natarajan G., (2010) A new method for finding an optimal solution for transportation problems. International J. of Math. Sci. and Engg. Appls., 4:59-65.

Senapati Samiran and Samanta Tapan Kumar, (2012) Optimal distribution of commodities under Budgetary restriction: a fuzzy approach. International Journal of Advanced Engineering Research and Studies, 1:208-211.

Tiwari R.N., Dharmar S. and Rao J. R. (1986) Priority structure in fuzzy Goal Programming. Fuzzy Sets and Systems, 19:251-259.

Copyrights statperson consultancy www

Copyrights
�
statperson consultancy www.statperson.com
2013. All Rights Reserved.