Neutrosophy-based transportation problem and its solution approach

This study designs a transportation problem (Tp-problem) by taking the transportation cost, availabilities, demands and quantity of goods to be transported as single valued trapezoidal neutrosophic number (svtn-number). Then experts can include their hesitancy in decision making independently in an uncertain climate. The proposed form of Tp-problem is solved in four distinct methods, and optimality test of their initial outcomes are performed. The respective algorithms are developed with the help of existing crisp notions. A parameter-based linear ranking function of svtn-number is drawn here. This parameter of ranking function helps to incorporate the relevant characters involved indirectly in a Tp-problem beside the provided constraints in its solution approach. The way of treatment of uncertainty and the incorporation of relevant character in a Tp-problem designed here make its outcome more realistic and acceptable to the experts. The efficiencies of proposed concepts are tested in real ground. The optimal values are analysed to opt the better method applicable for that problem.