Title: An algorithm for approximate lower limit of grey TSP
Abstract: Travelling Salesman Problem is a well known problem in operations research. TSP is short for The Travelling Salesman Problem. The general idea is that a peddler travels from one town, through many towns once, only once, and then returns to the original town, asking how to choose the route that will make the journey the shortest. In daily life, many problems can be reduced to this kind of problem. In fact, due to some conditions, the exact distance between the two towns can not be determined. By introducing the theory and concept of Grey for TSP, the grey TSP problem is produced. In this paper, the grey element is introduced into the Travelling Salesman Problem, and based on the grey traveling salesman model, a method of calculating the approximate lower limit of the Travelling Salesman Problem is given by reasoning proof.
Publication Year: 2021
Publication Date: 2021-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot