Abstract
In this article we put forward a simple algorithm for the rapid approximate solution of the single terminal traveling salesman problem. The focus of application of the algorithm is an environment wherein the cost of computation is an important component of the total cost of generating and using a solution. A comparison of several heuristic algorithms is made using three classical problems. The cost of computing and using these solutions is shown to be dependent on the scale of measurement of the problem. Our algorithm is shown to be least costly when computation cost dominates the total cost. The results also give some indications as to when more accurate algorithms should be used.
Sign-in/Register to access full text options 
Free) 
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 call
