© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.

org (E-ISSN 2348-1269, P- ISSN 2349-5138)

A STUDY ON APPLICATIONS OF
TRANSPORTATION PROBLEM TO MINIMIZE
COST IN VARIOUS PHARMACIES 1
K. Subhikshaa, 2Dr.R.Arumugam, 3M.Rajathi
1
PG student,
2,3
Assistant Professor,
1,2
Department of Mathematics,
3
Department of Education,
1,2,3
Periyar Maniammai Institute of Scicence and Technology (PMIST),
Thanjavur – 613 403, Tamilnadu, India.

Abstract: Nowadays, the dealing of products assumes a huge importance on the standard of living of each individual and collective
entity. The transportation problem is a distribution-type problem, the most goal of that is to come to a decision a way to transfer
merchandise from a variety of sending locations (also called origins) to numerous receiving locations (also called destinations)
with tokenise prices or most profit. Finding associate degree initial basic feasible solution is that the prime demand to get associate degree
optimum solution for the transportation problems. During this paper, NWCR, LCM, VAM and a new APPROACH technique is projected
to seek out an initial basic feasible solution by TORA tool from the real time data of different pharmacies for the transportation problems.

I. INTRODUCTION

Transportation theory can be in the name given to the study of optimal transportation and allocation of resources. The main
weakness of transportation was originally developed in 1941 by Alfred Joseph Hitchcock [1]. Throughout this document, Level 2
will provide a better solution for transportation problems. This deficiency has been studied for a long time and is explained by Abdur
Rashid et al. [2] Aminur Rahman Khan et al. [3] - [6], Hamdy A.T. [7], Kasana & Kumar [8], Kirca and Satir [9], M. Sharif Uddin et
al. [10], Mathirajan, M. and Meenakshi [11], Md Amirul Islam et al. [12] [13], Md. Ashraful et al. [14-16], Md Main Uddin et al.
[17] [18], Mohammedan Mesbahudin Ahmed et al. [19] - [21] and Pandian & Natarajan [22]. Once again, a series of highly
anticipated strategies for determining the extent to which the original feasible solution to the transportation problem was developed
and mentioned by the Northwest Corner Engineering Unit (NWCM) [7], Minimum Line Technique (RMM) [4] [22], Column
Engineering Minimum (CMM) [4] [22], Lowest Value Technique (LCM) [7], Vogel Approach Technique (VAM) [7] [22], Extreme
Difference Technique (EDM) [8], Differentiation of Highest Value Techniques (HCDM) ) [3] [4], monetary value techniques
(ACM) [2], TOCM-MMM approach [9], TOCM-VAM approach [11], TOCM-EDM approach [13], TOCM-hCDM approach [12],
TOCM-SUM approach [5] and the like. In this article, we usually focus on potential associate degree solutions as optimal solutions
to transportation problems. The main transportation problem was originally developed by Hitchcock in 1941 [2].

This material provides NWCR, LCM, VAM APPROACH techniques to find out important knowledge from various pharmacies
about transportation problems for the largest possible initial solution for improper handling of TORA devices. New algorithms are
also proposed to find initially basic solutions to transportation problems. A comparative study was also carried out by solving a large
number of transportation problems, showing that the proposed method gives better results than other heuristics available in the
literature.
II. METHODOLOGY OF TRANSPORTATION PROBLEMS:

(i) Balanced transportation problems; where total supply is equal to total demand.
(ii) Problems with unequal transportation; if the total supply does not equal the total demand

III. APPLICATION FOR TORA:

Temporary Routing Algorithm (TORA) is an algorithm for routing data through improvised wireless or cellular networks. It was
developed by Vincent Park and Scott Carson at the University of Maryland and the Navy Laboratory. In addition, TORA is menu-driven
and Windows-based, which makes it very user-friendly. To achieve this, the node must manage routing data on adjacent (one-hop) nodes.
The log has three main functions:
• Create a route
• Route support
• Delete route

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 507
© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.org (E-ISSN 2348-1269, P- ISSN 2349-5138)

FIGURE 1 TORA TOOL FOR FINDING THE OPTIMUM SOLUTION

The various Models in research which may be solved by the Temporary-Ordered Routing rule embrace applied math Graphical,
LPP: Transportation Models, whole number Programming, Queuing Models, CPM/PERT, theory of games, matrix operation, coinciding
Linear Equations etc. The practicality tools within the ‘Temporary-Ordered Routing Algorithm’ feature a schema browser, SQL
worksheet, PL/SQL editor, storage manager, rollback section monitor, instance manager, and SQL output viewer.

IV. DATA COLLECTION:

Data collection is the collection of information from certain sources. We collected data from three pharmacies of their products (S1, S2 &
S3), each transported to the hospital (H1, H2 & H3) and data from three pharmacies (Vinayaga Pharmacy, Thulasi Pharmacy, Saraswathi
Pharmacy) of products such as cotton, syringes and bandages. We have monitored total transportation costs for trips (weekly).

V. METHODS FOR INVESTIGATING TRANSPORTATION PROBLEMS:

To find the optimal optimal solution, use the NWCR (Northwest Angle) rule, vogel’s Approximation Method (VAM), and Lowest Cost
Method (LCM). We have also proposed a new approach to finding original basic solutions. A step-by-step guide can be found below.

5.1 Proposed New Approaches To Finding Possible Initial Solutions:

The proposed approach creates a distribution table to find solutions to transportation problems. Therefore, this method is called the
distribution table (ATM) method.
Step -1: Create a transportation table (TT) from the specified transportation problem.
Step -2: Make sure the TP is balanced or not. If not, make it balanced.
Step 3: Select the odd minimum price (MOC) of all TT cost cells. If the TT cell has no odd costs, divide all cells into 2 (two) until you
get at least one odd value in the cell.
Step 4: Design a new table, which should be called an allocation table (AT). Leave the IOC in the appropriate cost cell (as before) and
subtract the selected IOC from only each cost cell with an odd-value TT. Now all cell values in AT must be called distribution cell values
(ACV).
Step 5: Start with the distribution of supply and demand in the beginning. Set this bid / minimum bid for the odd ACV that was originally
on the AT that was formed in step 4. If the request is fulfilled, delete the column. If sent, delete the line.
Step 6: Now determine the minimum ACV and set the minimum supply / demand for the ACV selected in the AT.
Step 7: Repeat step 6 until supply and demand run out.
Step 8: Now transfer this distribution to the original TT.
Step 9: Finally, calculate the total TT transportation cost. This calculation is the sum of the values generated and the corresponding TT
value.

VI. ANALYSIS:

6.1 Vinayaga Pharmacy:

Vinayaga Pharmacy sells mainly 3 products, namely cotton, syringes and bandages, with weekly turnover of 43, 42 and 42 and 30. The
following table gives the unit price of the drug.

TABLE 1- VINAYAGA PHARMACY PRODUCT DETAILS

Hospitals
H1 H2 H3
Vinayaga S1 3 5 8 43
pharmacy S2 2 7 9 42
S3 4 2 10 42
50 47 30

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 508
© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.org (E-ISSN 2348-1269, P- ISSN 2349-5138)
TABLE 2 -NWC-RULE

43 3 5 8
7 2 35 7 9
4 12 2 30 10

Total transportation cost = 43 3  7  2  35 7  12 2  3010  712 (NWC-Rule)

TABLE 3 - LCM METHOD

8 5 5 30
8
3
42 7 9
2
4 42 10
2

Total transportation cost = 8 3  5 5  30 8  42 2  42 2  457(LCM)

TABLE 4 - VAM METHOD:

8 3 5 5 30 8

42 2 7 9
4 42 2 10

Total transportation cost = 8 3  5 5  30 8  42 2  42 2  457(VAM)

TABLE 5 - NEW APPROACH TO SOLVE TP:

8 3 5 5 30 8

42 2 7 9
4 42 2 10

Total transportation cost = 8 3  5 5  30 8  42 2  42 2  457

6.2 Thulasi Pharmacy:

Thulasi Pharmacy sells mainly 3 products, namely cotton, syringes and bandages, with a weekly sales capacity of 57, 70 and 62
respectively. Pharmacy provides 3 hospitals in H1, H2 and H3 with weekly needs of 65, 72 and 52. The following table shows the unit
cost of the drug.

TABLE 5 - THULASI PHARMACY PRODUCT DETAILS

Hospitals
H1 H2 H3
Thulasi S1 5 3 7 57
pharmacy S2 7 6 5 70
S3 9 10 4 62
65 72 52

NWCR -Rule: Total transportation cost is, 57  5  8 7  62 2  1010  52 4  1021
57  3  55 7  15 6  10 9  52 4  944
LCM: Total transportation cost is,
VAM method: Total transportation cost is: 57  3  55 7  15 6  10 9  52 4  944
New approach to solve TP:
Total transportation cost is, 57  5  8  7  10 6  10 62  52 5  1281

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 509
© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.org (E-ISSN 2348-1269, P- ISSN 2349-5138)
6.3 Saraswathi Pharmacy:

Saraswati Pharmacy sells mainly 3 products, namely cotton, syringes and bandages, with a weekly sales capacity of 60, 70 and 80
respectively. Pharmacy provides 3 hospitals in H1, H2 and H3 with weekly needs of 50, 80 and 80. The following table shows the unit
cost of the drug.

Hospitals
H1 H2 H3
Saraswathi S1 6 8 4 60
pharmacy S2 4 9 8 70
S3 1 2 6 80
50 80 80

NWCR-Method: Total Transportation Cost = 1490

LCM Method: Total Transportation Cost = 1060
VAM Method: Total Transportation Cost = 760
New Approach: Total Transportation Cost = 960

By applying TORA tool we can find the IBFS and Optimum solutions from comparing the results to minimize the total
transportation cost.

FIGURE 1 TORA TOOL RESULT FOR VINAYAGA PHARMACY

FIGURE 2 TORA TOOL RESULT FOR VINAYAGA PHARMACY USING NWCR

FIGURE 3 TORA TOOL RESULT FOR VINAYAGA PHARMACY USING LCM

FIGURE 4 TORA TOOL RESULT FOR VINAYAGA PHARMACY USING VAM

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 510
© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.org (E-ISSN 2348-1269, P- ISSN 2349-5138)

FIGURE 5 TORA TOOL RESULT FOR THE OPTIMUM SOLUTION USING MODI METHOD

COMPARISON AND DISCUSSION:

With comparison on TORA tool we get same results. By using this tool we can solve the transportation problems easily. We can able to
find NWCR, LCM, VAM methods & Optimum solutions.

NEW Optimum
NWC LCM VAM APPROACH Solution
R (TORA)

Vinayaga 712 457 457 457 457

Saraswathi 1490 1060 760 960 760
Thulasi 1021 944 944 1281 944

FIGURE 6 OPTIMUM SOLUTIONS OF VARIOUS TRANSPORTATION PROBLEMS USING TORA TOOL

1500

1000 Vinayaga

saraswathi
500
thulasi

0
NWCR LCM VAM NEW APPROACH optimum

FIGURE 7 BAR CHART OF THE OPTIMUM SOLUTION OF VARIOUS TRANSPORTATIONS

When comparing the data with various pharmacy of transportation cost from the above figure 6 and 7, the lowest cost is “Vinayaga
pharmacy” (457), in all types of transportation problems.

VII. CONCLUSION:

Transport different quantities of the same homogeneous product to different destinations, so that the total transportation costs are
minimal. The calculation results provide the minimum total transportation costs and the values of the optimality decision variables. When
solving LP problems with computer packages, the optimal solution provides valuable information. In this document, we find that three
different drugstore products for different purposes have different transportation costs. Transportation problems help us determine the
minimum transportation costs. By comparing these results with the TORA tool, we can easily determine the minimum total transportation
costs. Finally, we came to the conclusion that the Vinayaga pharmacy was the BEST of the two other pharmacies in Saraswati and Tulasi.

VIII. ACKNOWLEDEGEMENT:

This research work was partially supported by staff members in the Vinayaga Pharmacy, Tulasi Pharmacy, Saraswathi
Pharmacy,Thanjavur. We thank our colleagues from Periyar Maniammai Institute of Science & Technology who provided the wonderful
support to complete the entire research paper in a good manner.

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 511
© 2019 IJRAR June 2019, Volume 6, Issue 2 www.ijrar.org (E-ISSN 2348-1269, P- ISSN 2349-5138)
REFERENCES:

[1] G. Monge. Mémoire urban center la théorie des déblais et des remblais. Histoire Diamond State l’Académie Royale Diamond
States Sciences de Paris, avec les Mémoires Diamond State Mathématique et Diamond StatePhysique pour
la mêmeannée,pages666–704,1781
[2] Alfred Hitchcock, F.L. (1941) The Distribution of a Product from many Sources to varied Localities. Journal
of arithmetic andPhysics,20,224-230. .
[3] Babu, M.A., Das, U.K., Khan, A.R. and Uddin, M.S. (2014) a straightforward Experimental Analysis on Transportation
Problem: a replacement Approach to portion Zero provide or Demand for All Transportation rule. International Journal of
Engineering analysis&Applications(IJERA),4,418-422.
[4] Rashid, A., Ahmed, S.S. and Uddin, Md.S. (2013) Development of a replacement Heuristic for Improvement of Initial
Basic possible answer of a Balanced Transportation drawback. Jahangirnagar University Journal of arithmetic and Mathematical
Sciences, 28, 105-112.
[5] Khan, A.R. (2011) A Re-Solution of the Transportation Problem: associate degree algorithmic Approach. Jahangirnagar
University Journal of Science, 34, 49-62.
[6] Khan, A.R. (2012) Analysis and Re-Solution of the Transportation Problem: A Linear Programming Approach M.Phil.Thesis,
Department of arithmetic, Jahangirnagar University.
[7] Khan, A.R., Vilcu, A., Sultana, N. and Ahmed, S.S. (2015) Determination of Initial Basic possible answer of Transportation
Problem: A TOCM-SUM Approach. BuletinulInstitutuluiPolitehnic Din Iasi, Romania, SecţiaAutomaticasiCalculatoare, Tomul
LXI(LXV),Fasc.1,39-49.
[8] Khan, A.R., Banerjee, A., Sultana, N. and Islam, M.N. (2015) answer Analysis of a Transportation drawback: AComparative
Study of various Algorithms. Accepted forPublication within the Bulletin of the engineering school of Iasi, Romania, Section
Textile. Leathership.
[9] Hamdy, A.T. (2007) Operations Research: associate degree Introduction. eighth Edition, Pearson Hall, higher Saddle stream.
[10] Kasana, H.S. and Kumar, K.D. (2005) Introductory Operations Research: Theory and Applications.Springer International
Edition, New Delhi.
[11] Kirca, O. and Satir, A. (1990) A Heuristic for getting associate degree Initial answer for the Transportation Problem. Journal of
the Operational analysis Society, 41, 865-871.
[12] Uddin, M.S., Anam, S., Rashid, A. and Khan, A.R. (2011) step-down of Transportation price by Developing associate
degree economical Network Model. Jahangirnagar Journal of arithmetic & Mathematical Sciences, 26, 123-130.
[13] Mathirajan, M. and Meenakshi, B. (2004) Experimental Analysis of Some Variants of
Vogel’sApproximation technique.Asia-PacificJournalofOperational analysis,21,447-462.
[14] Islam, M.A., Khan, A.R., Uddin, M.S. and Malek, M.A. (2012) Determination of Basic possible answer of Transportation
Problem: a replacement Approach. Jahangirnagar University Journal of Science, 35, 101-108.
[15] Islam, M.A., Haque, M. and Uddin, M.S. (2012) Extremum distinction Formula on Total chance price: A Transportation
Cost step-down Technique. Prime University Journal of Multidisciplinary Quest, 6, 125-130
[16] Babu, M.A., Helal, M.A., Hasan, M.S. and Das, U.K. (2013) Lowest Allocation technique (LAM): a
replacement Approach to get possible answer of Transportation Model. International Journal of Scientific and
Engineering analysis, 4, 1344-1348.
[17] Charnes, A., Cooper, W.W. and Henderson, A. (1953) associate degree Introduction to Linear Programming. John Wiley & Sons,
New York.
[18] Babu, M.A., Helal, M.A., Hasan, M.S. and Das, U.K.(2014) implicit price technique (ICM): another Approach to seek
out the possible answer of Transportation Problem. international Journal of ScienceFrontier Research-
F: arithmetic and call Sciences, 14, 5-13.
[19] Uddin, M.M., Rahaman, M.A., Ahmed, F., Uddin, M.S. and Kabir, M.R. (2013) step-down of Transportation price on the
premise of your time Allocation: associate degree algorithmic Approach. Jahangirnagar Journal of arithmetic & Mathematical
Sciences, 28, 47-53.
[20] Uddin, M.M., Khan, A.R., Roy, S.K. and Uddin, M.S. (2015) a replacement Approach for finding Unbalanced
Transportation drawback because of further provide. Bulletin of the engineering school of Iasi, Romania, Section Textile,
Leathership .(In Press).
[21] Ahmed, M.M., Tanvir, A.S.M., Sultana, S., Mahmud, S. and Uddin, M.S. (2014) An Effective to resolve Transportation
Problems: a value step-down Approach. Annals of Pure and applied 6,199-206.
[22] Ahmed,M.M.(2014) algorithmic Approach toresolve Transportation Problems: step-down of price M.Phil. Thesis, Dept.
of arithmetic, Jahangirnagar University, Savar.
[23] Rajathi. M and Arumugam. R, Applications of mobile learning in the higher educational institutions through
statisticalapproach, International journal of Recent Technology and Engineering (IJRTE). ISSN: 2277-3878, Vol-8
Issue 1, 1432- 1439, May 2019

IJRAR19K5544 International Journal of Research and Analytical Reviews (IJRAR) www.ijrar.org 512