Abstract
The following paper introduces a methodology to calculate the least cost for a directed network through Travelling salesman problem. Dynamic programming method is used to find the minimum Cost. The recursion formula is used. The edge weights of the networks are being taken in terms of Triangular, Trapezoidal and Pentagonal Neutrosophic set. Score function for the Triangular, Trapezoidal and Pentagonal Neutrosophic sets are being defined for deneutrosophication. The least cost is estimated using all the above said Neutrosophic sets and the result is compared
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
