IEEE Style Citation: Lakhveer Kaur, Madhuchanda Rakshit, Sandeep Singh, “An Improvement in Maximum Difference Method to Find Initial Basic Feasible Solution for Transportation Problem,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.9, pp.533-535, 2018.
MLA Style Citation: Lakhveer Kaur, Madhuchanda Rakshit, Sandeep Singh "An Improvement in Maximum Difference Method to Find Initial Basic Feasible Solution for Transportation Problem." International Journal of Computer Sciences and Engineering 6.9 (2018): 533-535.
APA Style Citation: Lakhveer Kaur, Madhuchanda Rakshit, Sandeep Singh, (2018). An Improvement in Maximum Difference Method to Find Initial Basic Feasible Solution for Transportation Problem. International Journal of Computer Sciences and Engineering, 6(9), 533-535.
BibTex Style Citation:
@article{Kaur_2018,
author = {Lakhveer Kaur, Madhuchanda Rakshit, Sandeep Singh},
title = {An Improvement in Maximum Difference Method to Find Initial Basic Feasible Solution for Transportation Problem},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2018},
volume = {6},
Issue = {9},
month = {9},
year = {2018},
issn = {2347-2693},
pages = {533-535},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2904},
doi = {https://doi.org/10.26438/ijcse/v6i9.533535}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i9.533535}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2904
TI - An Improvement in Maximum Difference Method to Find Initial Basic Feasible Solution for Transportation Problem
T2 - International Journal of Computer Sciences and Engineering
AU - Lakhveer Kaur, Madhuchanda Rakshit, Sandeep Singh
PY - 2018
DA - 2018/09/30
PB - IJCSE, Indore, INDIA
SP - 533-535
IS - 9
VL - 6
SN - 2347-2693
ER -
VIEWS
PDF
XML
431
283 downloads
111 downloads
Abstract
It is very important to find initial solution of transportation problems to reach optimal solution. In this paper Maximum Difference Method (MDM) is improved to get best initial solution of transportation problems. Our improved method overcomes the limitations of MDM given by Smita Sood and keerti Jain. This modified approach most of times give better solution than MDM specially in case of tie and very close to the optimal solution. Also sometimes gives optimal solution.
[1] Balakrishnan N (1990) Mdified Vogels Approximation Method for the unbalanced transportation problem. Appl. Math. Lett. 3(2): 9- 11.
[2] Charnes A, Cooper WW (1954) The stepping-stone method for explaining linear programming calculations in transportation problems. Manag. Sci. 1(1): 49- 69.
[3] Dantzig GB (1963) Linear Programming and Extensions. Princeton, NJ:Princeton University Press.
[4] Goyal SK (1984) Improving VAM for unbalanced transportation problems. J. Oper. Res. Soc. 35(12): 1113- 1114
[5] Juman ZAMS, Hoque MA (2015) An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl Soft Comput. 34: 813-826.
[6] Kasana HS, Kumar KD (2004) Introductory Operations Research:Theory and Applications. Springer, Heidelberg.
[7] Khan AR (2011) A re-solution of transportation problem:an algorithmic approach. Jahangirnagar University of journal of Science. 34(2): 49- 62.
[8] Kirca O, Satir A (1990) A heuristic for obtaining an initial solution for transportation problem. J. Oper. Res. Soc. 41(9); 865- 871.
[9] Korukoglu S, Balli S (2011) An improved Vogels Approximation method for the transportation problem. Mathematical and Computational Applications. 16(2): 370- 381.
[10] Kulkarni SS (2012) On initial basic feasible solution for transportation problem-A new approach. J. Indian Acad. Math. 34(1): 19-25.
[11] Kulkarni SS, Datar HG (2010) On solution to modified unbalanced transportation problem. Bulletin of marathwada Mathematical Society. 11(2): 20- 26.
[12] Mathirajan M, Meenakshi B (2004) Experimental analysis of some variants of Vogels approximation method. Asia Pac J Oper Res. 21(4): 447- 462.
[13] Jude O, Ifeanyichukwu OB, Ihuoma IA, Akpos EP (2017) A new and efficient proposed approach to find initia l basic feasible solution of a transportation problem. American Journal of Applied Mathematics and Statistics 5(2): 54-61
[14] Pargar F, Javadian N, Ganji AP (2009) A heuristic for obtaining an initial solution for the transportation problem with experimental analysis. The 6th International Industrial Engineering Conference, Sharif University of Technology, Tehran, Iran.
[15] Ramakrishnan CS (1988) An improvement to Goyals modified VAM for the unbalanced transportation problems. J. Oper. Res. Soc. 39(6): 609- 610.
[16] Rashid A, Ahmad SS, Uddin MS (2013) Development of a new heuristic for improvement of initial basic feasible solution of a balanced transportation problem. Jahangirnagar University Journal of Mathematics and Mathematical Science. 28: 105-112.
[17] Reinfeld NV, Vogel WR (1958) Mathematical Programming. Englewood Cliffs. New Jersey:Prentice-Hall.
[18] Russell EJ (1969) Extension of Dantzigs algorithm to finding an initial near-optimal basis for transportation problem. Oper. Res. 17: 187-191.
[19] Shafaat A, Goyal SK (1988) Resolution of degeneracy in transportation problems. J. Oper. Res. Soc. 39(4): 411- 413.
[20] Shimshak DG, Kaslik JA, Barclay TD (1981) A modification of Vogels approximation through the use of heuristic. INFOR. 19: 259- 263.
[21] Sood S, Jain K. (2015) The Maximum Difference Method to find initial basic solution for Transportation Problem. Asian Journal of Managment Science. 03(07): 08-11.
VIEWS
PDF 
XML 
