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

DOI10.1016/J.COR.2012.12.015zbMATH Open1348.90648OpenAlexW2039492305MaRDI QIDQ336343FDOQ336343

Authors: Dennis Weyland, Roberto Montemanni, 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

Recommendations

• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• On the computational complexity of the probabilistic traveling salesman problem with deadlines
• Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Further results on the probabilistic traveling salesman problem

zbMATH Keywords

Monte Carlo samplinglocal searchstochastic vehicle routingrandom restart local search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The capacitated vehicle routing problem with stochastic demands and 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
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method
• Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• 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
• 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
• Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• The \(ACO/F-Race\) algorithm for combinatorial optimization under uncertainty
• 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
• Estimation-based metaheuristics for the probabilistic traveling salesman problem

Cited In (9)

• 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
• Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
• A tabu search algorithm for the probabilistic orienteering problem
• A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• On the computational complexity of the probabilistic traveling salesman problem with deadlines
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem

This page was built for publication: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336343)