Pages that link to "Item:Q4888170"
From MaRDI portal
The following pages link to Computational Approaches to Stochastic Vehicle Routing Problems (Q4888170):
Displayed 25 items.
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms (Q707147) (← links)
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← links)
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations. (Q1413870) (← links)
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
- Solving the probabilistic TSP with ant colony optimization (Q1774631) (← links)
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem (Q2432887) (← links)
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
- Challenges and Advances in A Priori Routing (Q3564352) (← links)
- AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS (Q3636500) (← links)
- Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands (Q5130499) (← links)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)