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

Jeffrey W. Ohlmann, Barrett W. Thomas. A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing, 19(1):80-90, 2007. [doi]

Abstract

Abstract is missing.