Solution of a Transportation Problem using Bipartite Graph

Solution of a Transportation Problem using Bipartite Graph

ekanayake_e.m.u.s.b

Contact

Ekanayake E.M.U.S.B

Contact

Daundasekara W. B.

Contact

Perera S.P.C

Contact

Rajarata University of Sri Lanka

Solution of a Transportation Problem using Bipartite Graph

Article Fingerprint

ReserarchID

Y82OH

Solution of a Transportation Problem using Bipartite Graph Banner

AI TAKEAWAY

Connecting with the Eternal Ground

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.

References

28 Cites in Article

Reference Format

P Adhikari,G Thapa (2000). A Note on Feasibility and Optimality of Transportation Problem.
S Akpana,T Ugbeb,J Usenc,O Ajahd (2015). A Modified Vogel Approximation Method for Solving Balanced Transportation Problems.
M Ahmed,A Khan,S Uddin,F Ahme (2016). A New Approach to Solve Transportation Problems.
Mollah Ahmed,Aminur Khan,Faruque Ahmed,Md. Uddin (2016). Incessant Allocation Method for Solving Transportation Problems.
D Atkinson,P Vaidya (1995). Using geometry to solve the transportation problem in the plane.
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.
G Dantzig (1963). Linear programming and extensions.
N Deshmukh (2012). An Effective Methodology for Solving Transportation Problem.
L Ford,D Fulkerson (1956). Solving the Transportation Problem.
S Goyal (1984). Improving VAM for unbalanced transportation problems.
A Hamdy (2007). Operations Research: An Introduction.
Frank Hitchcock (1941). The Distribution of a Product from Several Sources to Numerous Localities.
Eghbal Hosseini (2017). Three new methods to find initial basic feasible solution of transportation problems.
T Imam,G Elsharawy,M Gomah,I Samy (2009). Solving Haplotype Assembly Problem Using Harmony Search.
Kenan Karagul,Yusuf Sahin (2020). A novel approximation method to obtain initial basic feasible solution of transportation problem.
A Kaufmann (1973). Introduction a la Theorie des sons-ensembles flous.
T Koopmans (1949). Optimum Utiliztion of Transportation System.
Serdar Korukoğlu,Serkan Ballı (2011). An Improved Vogel's Approximation Method for the Transportation Problem.
S Kulkarni,H Datar (2010). On Solution To Modified Unbalanced Transportation Problem.
V Manisha,M Sarode (2017). Application of a Dual Simplex method to Transportation Problem to minimize the cost.
J Phillips,P Agarwal (2006). On bipartite matching under the rms distance.
N Reinfeld,W Vogel (1958). Mathematical Programming.
Santhi (2019). Topological solution of a Transportation problem using Topologized Graph.
Hesham Alhumade,Hiba Nauman,Erij Elkamel,Aiping Yu,Ali Elkamel (2005). CORROSION PROTECTION OF STAINLESS STEEL TYPE 304 USING GRAPHENE COMPOSITES.
K Varadarajan,P Agarwal (1999). Approximation algorithms for bipartite and non-bipartite matching in the plane.
S Vimala,S Kalpana (2017). Topologized Bipartite Graph.
S Vimala,S Kalpana (2017). Final Report on the Safety Assessment of Ceteareth-2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, -14, -15, -16, -17 -18, -20, -22, -23, -24, -25, -27, -28, -29, -30, -33, -34 -40, -50, -55, -60, -80, and -100.
G Monge (1781). Mémoire sur la théorie des déblaiset des remblais.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

ekanayake_e.m.u.s.b. 2021. \u201cSolution of a Transportation Problem using Bipartite Graph\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 21 (GJSFR Volume 21 Issue F1).

More Citation Formats

Select Citation Style:

Download Citation

GJSFR Volume 21 Issue F1

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords

Not Found

Classification

GJSFR-F Classification MSC 2010: 00A79

Submission ReceivedDecember 21, 2020
Peer Review Double Blind
Handling Editor
Accepted January 18, 2021
Published January 28, 2021

Version of record

v1.2

Issue date

February 12, 2021

Language

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Views: 2074

Total Downloads: 1025

2026 Trends

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]