A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows