NEW APPROACH FOR SOLVING FUZZY TRIANGULAR ASSIGNMENT BY ROW MINIMA METHOD

The Fuzzy Assignment Problem (FAP) is a classic combinatorial optimization problem that has received a lot of attention. FAP has a wide range of uses. We suggest a new algorithm that combines to solve the FAP in this paper. Each column is maximized during the optimization process, and the best choice with the lowest cost is selected. The proposed method follows a standard methodology, is simple to execute, and takes less effort to compute. An order to obtain the best solution, the assignment problem is specifically solved here. We looked at how well trapezoidal fuzzy numbers performed. Then, to convert crisp numbers, we use the robust ranking method for trapezoidal fuzzy numbers. The optimality of the result provided by this new method is clarified by a numerical example.