Pages that link to "Item:Q5689143"
From MaRDI portal
The following pages link to An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers (Q5689143):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← 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)
- 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)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment (Q725797) (← links)
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- Real-time vehicle rerouting problems with time windows (Q958553) (← links)
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← 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 practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- Stochastic vehicle routing (Q1266554) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Modelling and analysis of multistage stochastic programming problems: A software environment (Q1278966) (← 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 hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← 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)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
- A recourse goal programming approach for airport bus routing problem (Q2404354) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
- Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
- Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm (Q2496000) (← links)
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
- Improving the Integer L-Shaped Method (Q2830952) (← links)
- Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price (Q2958618) (← links)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints (Q3057127) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← 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)
