Hardness results for the probabilistic traveling salesman problem with deadlines

Authors:
Dennis Weyland;Roberto Montemanni;Luca Maria Gambardella
Affiliations:
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, IDSIA, Switzerland;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, IDSIA, Switzerland;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, IDSIA, Switzerland
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 13
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Vehicle routing with time windows

Operations Research
Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows

Management Science
A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

Operations Research
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions

SIAM Journal on Computing
Aggregation for the probabilistic traveling salesman problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Computational complexity of stochastic programming problems

Mathematical Programming: Series A and B
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Computers and Operations Research
Probabilistic Traveling Salesman Problem with Deadlines

Transportation Science
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem

Computer Aided Systems Theory - EUROCAST 2009
Estimation-based metaheuristics for the probabilistic traveling salesman problem

Computers and Operations Research
Introduction to Stochastic Programming

Introduction to Stochastic Programming

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.