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

@article{Ohlmann2007ACH,
  title={A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows},
  author={Jeffrey W. Ohlmann and Barrett W. Thomas},
  journal={INFORMS Journal on Computing},
  year={2007},
  volume={19},
  pages={80-90}
}
This paper describes a variant of simulated annealing incorporating a variable penalty method to solve the traveling salesman problem with time windows (TSPTW). Augmenting temperature from traditional simulated annealing with the concept of pressure (analogous to the value of the penalty multiplier), compressed annealing relaxes the time window constraints by integrating a penalty method within a stochastic search procedure. Computational results validate the value of a variable penalty method… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS