Maximum modulus zero-suffix method for finding an optimal solution to fuzzy transportation problems

In this paper, we present the maximum modulus zero suffix method, a new algorithm for the fuzzy transportation problem. The zero-suffix technique’s implementation is known as the maximal modulus zero suffix method. An optimal solution may come from this implementation. Numerical examples are given here to demonstrate the viability of the suggested algorithm. Using two examples, a further comparison between the new algorithm and previous techniques (such as LCM, VAM, ZPM, ZSM, and IZSM) is developed. The result is also compared using LINGO 19.0 software to verify the optimization. The maximum modulus zero suffix method (MMZSM) is a useful and efficient approach that is superior to the existing methods, enables stress-free computation, is simple to comprehend, and provides an optimal solution to a crisp and fuzzy transportation problem.