The Probabilistic Traveling Salesman Problem with Deadlines (PTSPD) is a Stochastic Vehicle Routing Problem with a computationally demanding objective function. Currently heuristics using an approximation of the objective function based on Monte Carlo Sampling are the state-of-the-art methods for the PTSPD. We show that those heuristics can be significantly improved by using statistical tests in combination with the sampling-based evaluation of solutions for the pairwise comparison of solutions. © 2012 Springer-Verlag.
CITATION STYLE
Weyland, D., Montemanni, R., & Gambardella, L. M. (2012). Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6927 LNCS, pp. 448–455). https://doi.org/10.1007/978-3-642-27549-4_57
Mendeley helps you to discover research relevant for your work.