Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

@article{Campbell2009RuntimeRT,
  title={Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines},
  author={Ann Melissa Campbell and Barrett W. Thomas},
  journal={Computers & OR},
  year={2009},
  volume={36},
  pages={1231-1248}
}
The probabilistic traveling salesman problem with deadlines (PTSPD) is an extension of the well-known probabilistic traveling salesman problem in which, in addition to stochastic presence, customers must also be visited before a known deadline. For realistically sized instances, the problem is impossible to solve exactly, and local search methods struggle due to the time required to evaluate the objective function. Because computing the deadline violations is the most time consuming part of the… CONTINUE READING