Pages that link to "Item:Q3635037"

The following pages link to A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands (Q3635037):

Displaying 48 items.

• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
• A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
• Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• Approximate policy optimization and adaptive control in regression models (Q853656) (← links)
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
• Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
• Analysis of a rollout approach to sequencing problems with stochastic routing applications (Q1415519) (← 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)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← links)
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
• Managing mobile production-inventory systems influenced by a modulation process (Q2241563) (← links)
• Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints (Q2285897) (← links)
• Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• Reference policies for non-myopic sequential network design and timing problems (Q2358056) (← links)
• A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
• The efficacy of exclusive territory assignments to delivery vehicle drivers (Q2383103) (← 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)
• Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← 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)
• Acceptance and dispatching policies for a distribution problem (Q2783799) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs (Q3635181) (← links)
• AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS (Q3636500) (← links)
• Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits (Q5301117) (← 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)
• A vehicle routing problem with multiple service agreements (Q6066197) (← 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)
• Routing Courier Delivery Services with Urgent Demand (Q6160118) (← links)
• A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning (Q6599068) (← links)