Computational Approaches to Stochastic Vehicle Routing Problems
From MaRDI portal
Publication:4888170
DOI10.1287/trsc.29.4.342zbMath0853.90037OpenAlexW2100605418MaRDI QIDQ4888170
Michael Peterson, Philippe Chervi, Dimitris J. Bertsimas
Publication date: 6 January 1997
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.29.4.342
stochastic vehicle routingprobabilistic traveling salesmancomputational test resultsgraph-based a priori heuristics
Applications of mathematical programming (90C90) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Related Items
Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ The Vehicle Routing Problem with Stochastic Demands and Split Deliveries ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem ⋮ A fuzzy-based customer classification method for demand-responsive logistical distribution operations. ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands ⋮ Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem ⋮ A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ Challenges and Advances in A Priori Routing ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ Solving the vehicle routing problem with stochastic demands using the cross-entropy method ⋮ Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms ⋮ Solving the probabilistic TSP with ant colony optimization ⋮ Hybrid metaheuristics for the vehicle routing problem with stochastic demands ⋮ AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem ⋮ Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
