A new heurisic for the period traveling salesman problem

A new heurisic for the period traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor19951677
Country: United Kingdom
Volume: 22
Issue: 5
Start Page Number: 553
End Page Number: 565
Publication Date: May 1995
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: travelling salesman
Abstract:

In this paper, a new heuristic for the period traveling salesman problem is presented. The present heuristic is fast and simple and has improved upon previous best-known solutions. In addition, the authors have generated a variety of challenging, new test problems. The new heuristic is shown to perform well on these new problems.

Reviews

Required fields are marked *. Your email address will not be published.