An Efficient Neutrosophic Technique for Uncertain Multi Objective Transportation Problem

Abstract

It can be difficult to figure out how to satisfy customers’ ever rising demands and keep up one’s market competitiveness while containing controllable costs. Inefficiencies in the supply chain network are thus discovered by our investigation. Finding the best allocation order for products from diverse sources going to numerous destinations is the primary objective. Moreover, The information that is readily available is typically not clear-cut in real-world circumstances. So, it gives rise to the uncertain transportation problem. With the aim of helping the decision maker to have the suitable transportation plan with real suitation, in this paper, a solution procedure for multi objective transportation problem involving uncertainvariables has been studied under neutrosophic environment. A chance constraint model is constructed foruncertain multi objective transportation problem and then a neutrosophic compromise approach is used toobtain the pareto optimal solution for the problem. As neutrosophic sets are built with truth, indeterminacyand falsity membership functions, they are capable to help the decision maker in this complex transportation model. A numerical example has been reported to demonstrate the efficiency of the proposed approach towardsthe best compromise solution and a comparison study has been made with the existing methods. K

Keywords

• multi objective transportation problem
• chance constraint programming
• neutrosophic set theory