Pages that link to "Item:Q1027533"
From MaRDI portal
The following pages link to An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533):
Displayed 10 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order (Q319511) (← links)
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem (Q5497420) (← links)