A Minimum Demand and Minimum Supply Method to Solve Neutrosophic Pentagonal Transportation Problems
摘要
In real-world scenarios, transportation presents a significant challenge. This paper delves into the problem of transportation within a neutrosophic environment. The primary aim is to determine the minimal transportation cost for certain goods when the supply, demand, and transportation costs are expressed as pentagonal neutrosophic fuzzy numbers. To achieve this, we convert pentagonal neutrosophic fuzzy numbers into crisp numbers using a ranking function. Additionally, we introduce a method for identifying minimum demand and supply to obtain an optimal solution, which we then compare to existing methods. Lastly, we provide numerical examples to showcase the effectiveness of our proposed approach.