Sequential Approach Towards The Optimal Solution of Transportation Problem

Susanta Kumar Mohanta1


1Department of Mathematics, Government College Sundargarh, Odisha, India.

Abstract: In the course of time several methods and algorithms has been developed to solve transportation problems for more specific variations of its formulation. These approaches do not always find the true optimal solution. Instead, they will often consistently find good solutions to the problems. These good solutions are typically considered to be good enough simply because they are the best that can be found in a reasonable amount of time. Therefore, optimization often takes the role of finding the best solution possible in a reasonable amount of time. The proposed sequential approach is studied using modified Egerv\'{a}ry Theorem with numerical examples and comparative study on its algorithmic complexity. This methods gives a true optimal solution to the transportation problem with reasonable short time.
Keywords: Algorithmic complexity, Favorable matching, Perfect matching.


Cite this article as: Susanta Kumar Mohanta, Sequential Approach Towards The Optimal Solution of Transportation Problem, Int. J. Math. And Appl., vol. 9, no. 4, 2021, pp. 13-24.

References
  1. A. Gibbons, \textit{Algorithmic Graph Theory}, Cambridge University Press, Cambridge UK, (1987).
  2. B. Jackson, \textit{Graph Theory and Application}, Qeen Mary University of London, UK, http://www.Maths.qmul.ac.uk/bill/MAS210/ch6.pdf.
  3. H. A. Taha, \textit{Operations Research-An Introduction}, Prentice Hall, Fifth Revised Edition, (1997).
  4. J. Munkres, \textit{Algorithms for the Assignment and Transportation Problems}, Journal of the Society for Industrial and Applied Mathematics, 5(1)(1957), 32-38.
  5. R. L. Rardin, \textit{Optimization in operations research}, Prentice Hall, (1998).
  6. R. Wilson and J. Watkins, \textit{Graphs an Introductory Approach}, Wiley Publications, New York, (1990).
  7. S. K. Mohanta, \textit{An Optimal Solution for Transportation Problems: Direct Approach}, Project Report Submitted to $35^{th}$ Orientation Programme from 31-01-2018 to 27-02-2018, UGC-HRDC, Sambalpur University, Burla, Odisha-768019, India, 35(2018), 1-22.
  8. S. K. Mohanta and P. K. Das, \textit{Extension of Egervary Theorem on Optimal Solution of Assignment Problem: Logical Approach}, Nonlinear Functional Analysis and Application, 25(3)(2020), 545-562.

Back