In this paper an improved Hungarian method is introduced for solving fuzzy assignment problem. When we apply Hungarian method to solve fuzzy assignment problem, if the minimum number of lines crossing the fuzzy zeros are not equal to the order of the fuzzy cost matrix, this method can be used to get the optimal solution with less computational work. This method reduces the computational work of getting the optimal solution. Further this method can also be applied for finding the Hamiltonian circuit with minimum fuzzy cost in the fuzzy traveling salesman problem. Some numerical examples are furnished to understand the algorithm. © 2020, Research Publication. All rights reserved.