The following pages link to Stochastic vehicle routing (Q1266554):
Displaying 20 items.
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS (Q3636500) (← links)
- Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows (Q4578167) (← links)
- Partially dynamic vehicle routing—models and algorithms (Q4656667) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Learning to Approximate Industrial Problems by Operations Research Classic Problems (Q5031031) (← links)
- Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands (Q5130499) (← links)
- The Distributionally Robust Chance-Constrained Vehicle Routing Problem (Q5130504) (← links)
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (Q5322013) (← links)
- New policies for the dynamic traveling salesman problem (Q5426977) (← links)
- On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers (Q5850924) (← links)
- Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics (Q6065595) (← links)
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
- The in‐house logistics routing problem (Q6079881) (← links)
- Routing Courier Delivery Services with Urgent Demand (Q6160118) (← links)
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles (Q6160382) (← links)
- Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time (Q6195033) (← links)
- Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands (Q6565437) (← links)
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning (Q6599068) (← links)
