Abstract
Travelling Salesman Problem (TSP) is a famous Problem in operational research. many problems in real life can be reduced to this kind of Problem. In practical problems, sometimes exact data cannot be obtained due to many conditions, yielding only a general range. In this case, this paper presents an uncertain TSP problem with grey numbers, and constructs a dynamic programming model for the uncertain TSP problem with grey numbers. Then, combined with the dynamic programming method, an algorithm for solving the uncertain TSP problem with grey number is given by using the grey number possibility degree and the ranking method. Finally, use case calculations to verify the correctness of the algorithm.
Sign-in/Register to access full text options 
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.
