A Tactical Strategy in Transportation Problems Using Statistical Process

  • Authors

    • P. Sumathi
    • C. V. Sathiya Bama
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.21043
  • Transportation Problem, Optimal Solution, Initial Basic Feasible Solution, Average.
  • In this paper, a new algorithm is projected for finding initial basic feasible solution (IBFS) using average and also compared various methods of transportation problems. The proposed approach is also discussed with various numerical problems.

     

     

  • References

    1. [1] S.M. Abul Kalam, Azad, Md. Bellel Hossain, Md. Mizanur Rahman, An Algorithmic Approach to solve Transportation Problems with the average total opportunity cost method, International Journal of Scientific and Research Publications, 7(2) (2017).

      [2] M.M. Ahmed, M.A. Islam, M. Katun, S. Yesmin, M.S. Uddin, New Procedure of finding an initial basic feasible solution of time minimizing Transportation Problems, Open Journal of Applied Sciences (2015).

      [3] Aminur Rahman Khan, Adrian Vilcu, Nahid Sultana, Syed Sabbhir Ahmed, Determination of Initial Basic Feasible Solution of a Transportation problem, TOCM-SUM Approach (2015).

      [4] A. Charnes, W.W. Cooper, A. Henderson, An Introduction to linear programming, John Wiley & sons, New York (1953).

      [5] G.B. Dantzig, Application of the simplex method to a transportation problem, Activity Analysis of production and allocation, in Koopmans, T.C., Ed., John Wiley and sons, New York (1951), 359-373.

      [6] F.L. Hitchcock, The distribution of a product from several sources to numerous localities, Journal of mathematics and physics (1941).

      [7] A.T. Hamdy, Operations Research, An Introduction, 8th Edition, Pearson Prentice Hall, Upper Saddle River (2007).

      [8] Kanti Swarup, P.K. Gupta, Man Mohan, Introduction to Management Science, Sultan chand and sons, New Delhi (2017).

      [9] H.S. Kasana, K.D. Kumar, Introductory Operations Research: Theory and Applications, Springer International Edition, New Delhi (2005).

      [10] A. Karpagam, P. Sumathi, Innovative method for solving fuzzy linear programming problems with symmetric trapezoidal fuzzy numbers, International Journal of Latest Research in Science and Technology, 3(6) (2014), 95-98.

      [11] A. Karpagam, P. Sumathi, New approach to solve fuzzy linear programming problems by ranking function, Bonfring International Journal of Data Mining, 4(4) (2014), 22-25.

      [12] O. Kirca, A. Stair, A Heuristic for Obtaining an Initial Solution for the Transportation Problem, Journal of the Operational Research Society (1900).

      [13] Md. Mizanur Rahman, Md. Bellel Hossain, Md. Mosharraf Hossain, A New Approach for minimization of Transportation Time: An Algorithmic Approach, Imperial journal of interdisciplinary Research (IJIR), 2(7) (2016).

      [14] Mollah Mesbahuddin Ahmed, Aminur Rahman Khan, Md. Sharif Uddin, Farque Ahmed, A new approach to solve transportation problem, Jahangirnagar University, Scientific Research Publishing Inc. (2016).

      [15] M. Mathirajan, B. Meenakshi, Experimental Analysis of some variants of Vogel's Approximation Method, Asia-Pacific Journal of Operational Research (2004).

      [16] Neetu M. Sharma, Ashok P. Bhadane, An Alternative method to North West Corner method for solving transportation problem, International Journal for Research in Engineering Application & Management (IJREAM), 1(12) (2016).

      [17] S. Paulraj, P. Sumathi, A Comparative study of redundant constraints identification methods in linear programming problems, Mathematical Problems in Engineering, (2010), Article ID 723402, 16 pages.

      [18] S. Paulraj, P. Sumathi, A new approach for selecting constraint in linear programming problems to identify the redundant constraints, International Journal of Scientific and Engineering Research, 3(3) (2012).

      [19] N.V. Reinfield, W.R. Vogel, Mathematical Programming, Prentice hall, Englewood cli_s (1958).

      [20] P. Sumathi, S. Paulraj, Identification of redundant constraints in large scale linear programming problems with minimal computational effort, Applied Mathematical Sciences, 7(80) (2013), 3963-3974.

      [21] P. Sumathi,A New tactic for finding irrelevant constraints in linear programming problems, International Journal of Scientific and Engineering Research, 6(3) (2015), 66-69.

      [22] P. Sumathi, A New approach to solve linear programming problems with intercept values, Journal of Information and Optimization Sciences, 7(4) (2016), 95-510.

      [23] P. Sumathi, A. Gangadhara, New technique to detect redundant constraints in large scale linear programming problems, International Journal of Scientific and Engineering Research, 3(6) (2014), 236-238.

      [24] P. Sumathi, A. Gangadhara, Selection of constraints with a new approach in scale linear programming problems, Applied Mathematical Sciences, 8(27) (2014), 1311-1321.

      [25] P. Sumathi, V. Preethy, A New Approach in Assignment Prob- lems, International Journal of Pure and Applied Mathematics, 113(13) (2017), 122-131.

  • Downloads

  • How to Cite

    Sumathi, P., & V. Sathiya Bama, C. (2018). A Tactical Strategy in Transportation Problems Using Statistical Process. International Journal of Engineering & Technology, 7(4.10), 473-475. https://doi.org/10.14419/ijet.v7i4.10.21043