Given a set of nodes, where each pair of nodes is connected by several paths and each path shows a stochastic travel cost with unknown probability distribution, the multi-path Traveling Salesman Problem with stochastic travel costs aims at finding an expected minimum Hamiltonian tour connecting all nodes. Under a mild assumption on the unknown probability distribution, a deterministic approximation of the stochastic problem is given. The comparison of such approximation with a Monte Carlo simulation shows both the accuracy and the efficiency of the deterministic approximation, with a mean percentage gap around 2% and a reduction of the computational times of two orders of magnitude.
The multi-path Traveling Salesman Problem with stochastic travel costs / Tadei, R.; Perboli, G.; Perfetti, F.. - In: EURO JOURNAL ON TRANSPORTATION AND LOGISTIC. - ISSN 2192-4376. - 6:1(2017), pp. 3-23.
Titolo: | The multi-path Traveling Salesman Problem with stochastic travel costs |
Autori: | |
Data di pubblicazione: | 2017 |
Rivista: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/s13676-014-0056-2 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
2017-EJTR-The multi-path Traveling Salesman Problem uncertainty.pdf | Final version of the paper | 2a Post-print versione editoriale / Version of Record | ![]() | Visibile a tuttiVisualizza/Apri |
http://hdl.handle.net/11583/2859024