We present a new symmetric
traveling salesman problem tour construction heuristic. Two sequential matchings yield a set of cycles over the given point set;
these are then stitched to form a tour. Our method outperforms all previous
tour construction methods, but is dominated by several tour improvement
heuristics.