The Probabilistic Traveling Salesman Problem with Deadlines (PTSPD) is a Stochastic Vehicle Routing Problem with a computationally demanding objective function. In this work we propose an approximation for that objective function based on Monte Carlo Sampling and using the novel approach of quasi-parallel evaluation of samples. We perform comprehensive computational studies that reveal the efficiency of this approximation. Additionally, we examine different Local Search Algorithms and present a Random Restart Local Search Algorithm for solving the PTSPD together with an extensive computational study on a large set of benchmark instances.
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling / Weyland, Dennis; Montemanni, Roberto; Gambardella Luca, Maria. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 40:7(2013), pp. 1661-1670.
Data di pubblicazione: | 2013 |
Titolo: | Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling |
Autore/i: | Weyland, Dennis; Montemanni, Roberto; Gambardella Luca, Maria |
Autore/i UNIMORE: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.cor.2012.12.015 |
Rivista: | |
Volume: | 40 |
Fascicolo: | 7 |
Pagina iniziale: | 1661 |
Pagina finale: | 1670 |
Codice identificativo ISI: | WOS:000318131900001 |
Codice identificativo Scopus: | 2-s2.0-84875921863 |
Citazione: | Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling / Weyland, Dennis; Montemanni, Roberto; Gambardella Luca, Maria. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 40:7(2013), pp. 1661-1670. |
Tipologia | Articolo su rivista |
File in questo prodotto:

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris