Pages that link to "Item:Q375990"
From MaRDI portal
The following pages link to A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990):
Displaying 20 items.
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
- A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
- The doubly open park-and-loop routing problem (Q2147024) (← links)
- Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption (Q2361135) (← links)
- A multi-period TSP with stochastic regular and urgent demands (Q2456410) (← links)
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
- An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning (Q6599068) (← links)
- The workforce scheduling and routing problem with park-and-loop (Q6663965) (← links)
