Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
From MaRDI portal
Publication:336343
DOI10.1016/j.cor.2012.12.015zbMath1348.90648OpenAlexW2039492305MaRDI QIDQ336343
Roberto Montemanni, Dennis Weyland, Luca Maria Gambardella
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.12.015
Related Items
The probabilistic orienteering problem, A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations, On the computational complexity of the probabilistic traveling salesman problem with deadlines, A Tabu search algorithm for the probabilistic orienteering problem, A two-stage approach for task and resource management in multimedia cloud environment, Adaptive scheduling algorithm for media-optimized traffic management in software defined networks
Cites Work
- Unnamed Item
- The capacitated vehicle routing problem with stochastic demands and time windows
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Solving the probabilistic TSP with ant colony optimization
- Further results on the probabilistic traveling salesman problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Aggregation for the probabilistic traveling salesman problem
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The Stochastic Vehicle Routing Problem for Minimum Unmet Demand
- Vehicle Routing with Time Windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
