An Enumeration Technique for Transshipment Problem in Neutrosophic Environment

Neutrosophic sets, which are the generalization of fuzzy, and intuitionistic fuzzy sets, have been introduced to express uncertain, incomplete, and indeterminacy knowledge regarding a real-world problem. This paper is intended for the first time to introduce a transshipment problem mathematically in a neutrosophic environment. The neutrosophic transshipment problem is a special type of neutrosophic transportation problem in which available commodities regularly travel from one origin to other origins/destinations before arriving at their final destination. This article provides a technique for solving transshipment problems in a neutrosophic environment. A fully neutrosophic transshipment problem is considered in this article and the parameters (transshipment cost, supply and demand) are expressed in trapezoidal neutrosophic numbers. The possibility mean ranking function is used in the proposed technique. The proposed technique gives a direct optimal solution. The proposed technique is simple to implement and can be used to find the neutrosophic optimal solution to real-world transshipment problems. A numerical example is provided to demonstrate the efficacy of the proposed technique in the neutrosophic environment. © 2022