Solution of a Transportation Problem using Bipartite Graph
transportation problem, bipartite graph, balanced and unbalanced, VAM and MODI methods
Abstract
The transportation problem is also one of the important problems in the field of optimization in which the goal is to minimize the total transportation cost of distributing to a specific number of sources to a specific number of destinations. Different techniques have been developed in the literature for solving the transportation problem. Specific methodologies concentrated on finding an initial basic feasible solution and the other to find the optimal solution. This manuscript analyses method of the optimal solution for the transportation problem utilizing a Bipartite graph. This procedure contains topological spaces, graphs, and transportation problems. Initially, it converts the transportation problem into a graphical demonstration then transforms into a new graphical image. Afterward using the proposed algorithmic rule we've obtained the optimal cost of transporting quantities from providing vertices to supply vertices.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
URL: https://www.journalofscience.org/index.php/GJSFR/article/view/2890
References
Purnima Adhikari, Gyan Thapa (2000) A Note on Feasibility and Optimality of Transportation Problem. 10(1), 59-68. https://doi.org/10.3126/jie.v10i1.10879
S. Akpana, T. Ugbeb, J. Usenc, O. Ajahd (2015) A Modified Vogel Approximation Method for Solving Balanced Transportation Problems". 14(3), 289-302.
K. Aljanabi, A. Jasim (2015) An Approach for solving Transportation Problem Using Modified Kruskal's Algorithm. 2.
M. Ahmed, A. Khan, S. Uddin, F. Ahme (2016) A New Approach to Solve Transportation Problems. 5, 22-30.
M. Ahmed, A. Khan, F. Ahmed, Md Uddin (2016) Incessant Allocation Method for Solving Transportation Problems. 6, 236-244.
D. Atkinson, P. Vaidya (1995) Using geometry to solve the transportation problem in the plane. 13(5), 442-461. https://doi.org/10.1007/bf01190848
A. Charnes, W. Cooper, A. Henderson (1953) An introduction to linear programming. By A. Charnes, W. W. Cooper, and A. Henderson, John Wiley & Sons, Inc., 1953, 74 pp. 1.
G. Dantzig (1963) Linear programming and extensions.
N. Deshmukh (2012) An Innovative Method For Solving Transportation Problem". 2, 86-91.
L. Ford, D. Fulkerson (1956) Solving the transportation Problem.
S. Goyal (1984) Improving VAM for unbalanced transportation problems. 35, 1113-1114.
A. Hamdy (2007) Operations Research: An Introduction.
F. Hitchcock (1941) The Distribution of a Product from Several Sources to Numerous Localities. 20, 224-230.
E. Hosseini (2017) Three New Methods to Find Initial Basic Feasible Solution of Transportation Problems. 11(37), 1803-1814.
T. Imam, G. Elsharawy, M. Gomah, I. Samy (2009) Solving Transportation Problem", Using Object-Oriented Model. Int. J. comput. Sci. Netw. 9(2), 353-361.
K. Karagul, Y. Sahin A novel approximation method to obtain initial basic feasible solution of transportation problem.
A. Kaufmann (1973) Introduction a la Theorie des sons-ensembles flous. 1, 41-189.
T. Koopmans (1949) Optimum Utiliztion of Transportation System", Econometrica. 17.
S. Korukoglu, S. Bali (2011) A improve Vogel Approximation Method for the transformation Problem. 16(2), 370-381.
S. Kulkarni, H. Datar (2010) On Solution To Modified Unbalanced Transportation Problem. 11(2), 20-26.
V. Manisha, M. Sarode (2017) Application of a Dual Simplex method to Transportation Problem to minimize the cost. 2(7).
G. Monge (1781) Mémoire sur la théorie des déblaiset des remblais. 666-704.
J. Phillips, P. Agarwal (2006) On bipartite matching under the rms distance.
N. Reinfeld, W. Vogel (1958) Reinfeld, N.V.; and Vogel, W.R.( 1958).Mathematical Programming.
Santhi (2019) Topological solution of a Transportation problem using Topologized Graph. VI, 30-38.
A. Vella (2005) Fundamentally topological perspective on graph theory.
K. Varadarajan, P. Agarwal (1999) Approximation algorithms for bipartite and non-bipartite matching in the plane. 805-814.
S. Vimala, S. Kalpana (2017) S Kalpana.. Matching and Coloring in Topologied Bipartite Graph, International Journal of Innovative reserach in Science. 6.
S. Vimala, S. Kalpana (2017) S. Kalpana. Topologied Bipartite Graph, Asian Research Journal of Mathematics. 4(1), 1-10.
Published
2021-01-25
Issue
Section
License
Copyright (c) 2021 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.