Determination of Initial Basic Feasible Solution for Transportation Problems by: “Supply–Demand Reparation Method” and “Continuous Allocation Method”

  • Balasubramani PrajwalEmail author
  • J. Manasa
  • Radha Gupta
Part of the Asset Analytics book series (ASAN)


Transportation problems are special classes of linear programming problems which constitute major part of logistics management. Two new divergent approaches to find initial basic feasible solution for transportation problem (TP) are presented in this paper. The first method supply–demand reparation method (SDRM) uses the supply and demand entities for a problem as the key to find the allocations, rather than the generic transportation cost matrix. The logic of bridging the supply–demand parameters is the driving principle of this method. The second method “continuous allocation method (CAM)” is sequential approach to solve transportation problems which is presented in this paper. The method relies on meeting the supply and demand requirements via a sequential allocation of quantities in the transportation matrix. The logic used is of satisfying each entity in the TP one after another. The proposed methods are used to solve numerous classes of problems and are compared with classical existing approach Vogel’s Approximation Method (VAM). Further, “ANOVA” test reveals that both the methods SDRM and CAM are efficient in finding initial basic feasible solution (IBFS).




  1. 1.
    Ravindran P, Solberg J (2012) Operations research principles and practice, 2nd edn. Wiley India, pp 74–76Google Scholar
  2. 2.
    Taha HA (2002) Operations research—an introduction, 6th edn, vol 165Google Scholar
  3. 3.
    Dantzig GB (1963) Linear programming and extensions, Princeton University pressGoogle Scholar
  4. 4.
    Charnes A, Cooper WL (1954) The stepping-stone method for explaining linear programming calculations in transportation problems. Manag Sci 1(1):49–69CrossRefGoogle Scholar
  5. 5.
    Gass SI On solving the transportation problem. J Oper Res Soc 41(4):291–297Google Scholar
  6. 6.
    Goyal SK A note on a heuristic for obtaining an initial solution for the transportation problem. J Oper Res Soc 42(9):819–821Google Scholar
  7. 7.
    Mathirajan M, Meenakshi B (2007) Experimental analysis of some variants of VAM. Asia Pacific J Oper Res 21:447–462CrossRefGoogle Scholar
  8. 8.
    Sharma JK (2013) Operations research theory and applications, 3rd edn. Macmillan PublisherGoogle Scholar
  9. 9.
    Seethalakshmyl A, Srinivasan N An improved algorithm to obtain initial basic feasible solution for transportation problem. Int J Sci Res 2319–7064Google Scholar
  10. 10.
    Kothari CR, Garg G (2015) Research methodology-methods and techniques, 3rd edn. New Age International Publishers, pp 261–269Google Scholar
  11. 11.
    Das UK, Ashraful Babu Md, Khan AR, Helal MdA, Uddin MdS (2014) Logical development of vogel’s approximation method (LD-VAM)-an approach to find basic feasible solution of transportation problem. Int J Sci Technol Res 3. ISSN 2277–8616Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.IIAEM, Jain UniversityBangaloreIndia
  2. 2.Department of Basic Sciences, School of Engineering and TechnologyJain UniversityBangaloreIndia
  3. 3.Department of MathematicsDayananda Sagar College of EngineeringBangaloreIndia

Personalised recommendations