A New Optimal Complete Matching of Edges with Minimum Cost by Ranking Method for Solving -Type -2 Fuzzy Linear Sum Assignment Problem
DOI:
https://doi.org/10.48047/Keywords:
— - trapezoidal fuzzy number; -type-1 trapezoidal fuzzy number ( ) ; –type-2 trapezoidal fuzzy number ( ); bipartite graph; alternating path; ranking method.Abstract
In this paper, we discuss minimum and maximum membership values of - type-1 trapezoidal fuzzy number (
), lower and upper membership functions of - type- 2 trapezoidal fuzzy number ( ) and find a new optimal complete
matching of edges with minimum reduced cost by using ranking method for solving -Type-2 trapezoidal fuzzy linear sum assignment
problem ( ). Sometimes, we obtain multiple matched columns or single matched column and get corresponding optimal
solution. If we get multiple matched columns and get corresponding partial optimal solution, then we proceed to each step in bipartite edges
through interchange unassigned matching to new matching edges and corresponding dual variable’s solution is updated from a shortest
alternating path to get new optimal complete matching edges with minimum reduced cost.
