Pages that link to "Item:Q5188995"

The following pages link to Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands (Q5188995):

Displaying 50 items.

• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
• A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order (Q319511) (← links)
• Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← 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)
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• New optimality cuts for a single-vehicle stochastic routing problem (Q1290168) (← 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)
• Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← links)
• Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← 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)
• Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
• Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
• Quantifying the benefits of route reoptimisation under stochastic customer demands (Q3156537) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• (Q3641676) (← links)
• SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS (Q4929134) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• Learning to Approximate Industrial Problems by Operations Research Classic Problems (Q5031031) (← links)
• A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility (Q5058032) (← links)
• Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits (Q5301117) (← links)
• A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem (Q5497420) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• A Vehicle Routing Problem with Stochastic Demand (Q5966685) (← links)
• A vehicle routing problem with multiple service agreements (Q6066197) (← links)
• Solving large-scale dynamic vehicle routing problems with stochastic requests (Q6106486) (← links)
• Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach (Q6109553) (← 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 tutorial on value function approximation for stochastic and dynamic transportation (Q6489316) (← links)
• Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems (Q6572838) (← links)