Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
From MaRDI portal
Publication:958456
DOI10.1016/j.cor.2008.01.006zbMath1160.90631OpenAlexW2104338908MaRDI QIDQ958456
Ann Melissa Campbell, Barrett W. Thomas
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.01.006
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic models in economics (91B70) Combinatorial optimization (90C27)
Related Items (10)
The vehicle-routing problem with time windows and driver-specific times ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ The probabilistic orienteering problem ⋮ The probabilistic minimum dominating set problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ The orienteering problem with stochastic travel and service times ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ Challenges and Advances in A Priori Routing ⋮ An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays ⋮ Home service routing and appointment scheduling with stochastic service times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Using aggregation to optimize long-term production planning at an underground mine
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Models and exact solutions for a class of stochastic location-routing problems
- A note on the effect of neighborhood structure in simulated annealing
- The stochastic vehicle routing problem revisited
- The vehicle scheduling problem with intermittent customer demands
- Stochastic vehicle routing
- Further results on the probabilistic traveling salesman problem
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Aggregation for the probabilistic traveling salesman problem
- Stochastic Vehicle Routing Problem with Restocking
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Discrete-Time Finite Horizon Approximation of Infinite Horizon Optimization Problems with Steady-State Invariance
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Worst-case incremental analysis for a class ofp-facility location problems
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Computational Approaches to Stochastic Vehicle Routing Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
- 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
- A Priori Optimization
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
