Affiliations: [a] Department of Mathematics, Gojanschool of Business and Technology, Chennai, Tamilnadu, India
| [b] Department of Applied Science (Mathematics), PSG College of Technology, Coimbatore, Tamilnadu, India
| [c] Department of Mathematics, Rajalakshmi Engineering College, Chennai, Tamilnadu, India
Correspondence:
[*]
Corresponding author. M. Joseph Robinson, Department of Mathematics, Gojanschool of Business and Technology, Chennai, Tamilnadu, India. E-mail: Josephrobinson.m@gmail.com.
Abstract: Neutrosophic Set (NS) allows us to handle uncertainty and indeterminacy of the data. Several researchers have investigated the Transportation Problems (TP) with various forms of input data. This paper emphasizes a dynamic optimal solution framework for TPs in a neutrosophic setting. This paper investigates a Neutrosophic Transportation Problem (NTP) in which supply, demand, and transportation cost are considered as Single-Valued Neutrosophic Trapezoidal Numbers (SVNTrNs). The weighted possibilistic mean value of their truth, indeterminacy, and facility membership function are calculated. Then, NTP is modelled as a parametric Linear Programming Problem (LPP) and solved. Further, the drawbacks of the existing approaches and advantages of the developed method are discussed. Finally, the real-time problem and numerical illustrations are presented and compared to existing solutions. This study helps the Decision-Makers (DMs) in budgeting their transportation expenses through strategic distribution.
Keywords: Single valued neutrosophic trapezoidal number, transportation problem, linear programming problem, weighted possibilistic mean
