| Article ID: | iaor20052366 |
| Country: | China |
| Volume: | 24 |
| Issue: | 1 |
| Start Page Number: | 74 |
| End Page Number: | 76 |
| Publication Date: | Mar 2004 |
| Journal: | Mathematical Theory and Applications |
| Authors: | Zhang Feilian, Pei Yun |
| Keywords: | heuristics |
This paper presents a Heuristic Algorithm Convex Hull and Constriction Algorithm to solve a TSP. First, an initial rounding route of convex hull is selected. Secondly, check all points inside the convex hull and insert them in the rounding route according to the increasing value of some parameter one by one. In this way, we get a rounding route with all points, viz. a feasible solution of TSP.