Pages that link to "Item:Q5322013"

The following pages link to Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (Q5322013):

Displaying 32 items.

• A scalable anticipatory policy for the dynamic pickup and delivery problem (Q2676347) (← links)
• Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications (Q2954069) (← links)
• Online traveling salesman problems with service flexibility (Q3100693) (← links)
• The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
• Recent Developments in Dynamic Vehicle Routing Systems (Q3564357) (← links)
• Challenges and Opportunities in Attended Home Delivery (Q3564366) (← links)
• Vehicle Routing Problems and Container Terminal Operations – An Update of Research (Q3564376) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function (Q5139622) (← links)
• Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization (Q5387630) (← links)
• New policies for the dynamic traveling salesman problem (Q5426977) (← links)
• Minimising average passenger waiting time in personal rapid transit systems (Q5963104) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery (Q6047877) (← links)
• Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
• Solving large-scale dynamic vehicle routing problems with stochastic requests (Q6106486) (← links)
• A two-stage stochastic location-routing problem for electric vehicles fast charging (Q6106597) (← links)
• Recent advances in integrating demand management and vehicle routing: a methodological review (Q6109246) (← links)
• A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows (Q6109341) (← links)
• Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach (Q6109553) (← links)
• Dynamic demand management and online tour planning for same-day delivery (Q6109836) (← links)
• Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders (Q6112618) (← links)
• Dynamic priority rules for combining on-demand passenger transportation and transportation of goods (Q6112779) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
• Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead (Q6113359) (← links)
• A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
• An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem (Q6551141) (← links)
• Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades (Q6554626) (← links)
• Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions (Q6568451) (← links)
• Data-driven customer acceptance for attended home delivery (Q6581369) (← links)
• Balancing resources for dynamic vehicle routing with stochastic customer requests (Q6581370) (← links)
• A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations (Q6599061) (← links)