ISSN 0976-5727 (Print) ISSN 2319-8133 (Online) Journal of Computer and Mathematical Sciences, Vol.9(9), 1179-1186 September 2018 (An International Research Journal), www.compmath-journal.org 1179 Solving Fuzzy Transportation Problem Using Modified Best Candidate Method * D. Stephen Dinagar 1 and * R. Keerthivasan 2 1 Associate Professor, PG and Research Department of Mathematics, T.B.M.L. College, Porayar - 609307, INDIA. 1 Research scholar, PG and Research Department of Mathematics, T.B.M.L. College, Porayar - 609307, INDIA. email: dsdina@rediffmail.com, keerthivasan.max@gmail.com (Received on: August 24, 2018) ABSTRACT In this work a new notion namely Modified Best Candidate Method (MBCM) is proposed to minimize the combination of the solutions by choosing the best candidate to reach the optimal solution in any type of transportation problems. In this method Interval Valued Triangular Fuzzy Number have been employed with their arithmetic operations to get the optimal solution. Numerical illustrations are also included to verify the proposed notion. AMS Mathematics Subject Classification (2010): 90C08, 90C90. Keywords: Interval Valued Triangular Fuzzy Number, Vogel’s Approximation Method, Best Candidate Method. 1. INTRODUCTION Transportation Problem is a special case of Linear Programming Problem in which goods are transported from a set of sources to destinations with respect to the supply and demand respectively, such that the total cost of transportation is minimized. In general, Transportation Problems are solved with the assumptions that the transportation costs and values of supplies and demands are specified in a precise way i.e., in crisp environment. Zimmermann 11 developed zimmermann’s fuzzy linear programming into several fuzzy optimization methods for solving the transportation problems. Iserman 5 introduced algorithm