Pages that link to "Item:Q1027533"

The following pages link to An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533):

Displaying 43 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)
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands (Q325450) (← 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)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← 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)
• 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)
• Real-time management of transportation disruptions in forestry (Q1652295) (← links)
• Robust optimisation approach for vehicle routing problems with uncertainty (Q1666879) (← links)
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
• A two-stage method for UCAV TF/TA path planning based on approximate dynamic programming (Q1720366) (← links)
• An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty (Q1723627) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← links)
• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
• Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← 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)
• An online stochastic algorithm for a dynamic nurse scheduling problem (Q2183326) (← links)
• Reference policies for non-myopic sequential network design and timing problems (Q2358056) (← links)
• Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands (Q2629676) (← links)
• Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization (Q2670514) (← 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)
• Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications (Q2954069) (← links)
• Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization (Q2988479) (← links)
• Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
• (Q3641676) (← links)
• A new approximate dynamic programming algorithm based on an actor–critic framework for optimal control of alkali–surfactant–polymer flooding (Q5059277) (← links)
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands (Q5188995) (← links)
• Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits (Q5301117) (← links)
• A Price-Directed Approach to Stochastic Inventory/Routing (Q5321731) (← links)
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (Q5322013) (← links)
• A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem (Q5497420) (← links)
• Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands (Q6047879) (← links)
• The in‐house logistics routing problem (Q6079881) (← links)
• Solving large-scale dynamic vehicle routing problems with stochastic requests (Q6106486) (← links)
• Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles (Q6160382) (← links)