Computational Approaches to Stochastic Vehicle Routing Problems
From MaRDI portal
Recommendations
Cited in
(37)- 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
- Heuristics for the stochastic Eulerian tour problem
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations.
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- A real delivery problem dealt with Monte Carlo techniques
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Solving the probabilistic TSP with ant colony optimization
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
- Vehicle routing on road networks: how good is Euclidean approximation?
- Challenges and Advances in A Priori Routing
- AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS
- scientific article; zbMATH DE number 4051377 (Why is no real title available?)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- scientific article; zbMATH DE number 912373 (Why is no real title available?)
- Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands
- Hierarchical vehicle routing problems
- A Vehicle Routing Problem with Stochastic Demand
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- An improved model for estimating optimal VRP solution values
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- A hybrid scatter search for the probabilistic traveling salesman problem
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- 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
- 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
- Computational aspects of the optimal transit path problem
This page was built for publication: Computational Approaches to Stochastic Vehicle Routing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888170)
