The Probabilistic Traveling Salesman Problem with Deadlines (PTSPD) is a Stochastic Vehicle Routing Problem considering time dependencies. Even the evaluation of the objective function is considered to be a computationally demanding task. So far there is no evaluation method known that guarantees a polynomial runtime, but on the other hand there are also no hardness results regarding the PTSPD objective function. In our work we show that the evaluation of the objective function of the PTSPD, even for Euclidean instances, is #P-hard. In fact, we even show that computing the probabilities, with which deadlines are violated is #P-hard. Based on this result we additionally show that the decision variant of the Euclidean PTSPD, the optimization variant of the Euclidean PTSPD and delta evaluation in reasonable local search neighborhoods is #P-hard.
Hardness results for the probabilistic traveling salesman problem with deadlines / Weyland, Dennis; Montemanni, Roberto; Gambardella Luca, Maria. - (2012), pp. 392-403. (Intervento presentato al convegno International Symposium on Combinatorial Optimization tenutosi a Athens nel April 2012) [10.1007/978-3-642-32147-4_35].
Hardness results for the probabilistic traveling salesman problem with deadlines
Montemanni Roberto;
2012
Abstract
The Probabilistic Traveling Salesman Problem with Deadlines (PTSPD) is a Stochastic Vehicle Routing Problem considering time dependencies. Even the evaluation of the objective function is considered to be a computationally demanding task. So far there is no evaluation method known that guarantees a polynomial runtime, but on the other hand there are also no hardness results regarding the PTSPD objective function. In our work we show that the evaluation of the objective function of the PTSPD, even for Euclidean instances, is #P-hard. In fact, we even show that computing the probabilities, with which deadlines are violated is #P-hard. Based on this result we additionally show that the decision variant of the Euclidean PTSPD, the optimization variant of the Euclidean PTSPD and delta evaluation in reasonable local search neighborhoods is #P-hard.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
