Pages that link to "Item:Q5301117"

The following pages link to Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits (Q5301117):

Displaying 23 items.

• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• Analysis of a rollout approach to sequencing problems with stochastic routing applications (Q1415519) (← 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)
• Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← links)
• Rollout-based routing strategies with embedded prediction: a fish trawling application (Q2108157) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing (Q2183325) (← links)
• The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands (Q2629676) (← links)
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
• A Dynamic Traveling Salesman Problem with Stochastic Arc Costs (Q2942707) (← links)
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands (Q3635037) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands (Q6047879) (← links)
• Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach (Q6109553) (← links)
• Dynamic priority rules for combining on-demand passenger transportation and transportation of goods (Q6112779) (← links)