The following pages link to Stochastic vehicle routing (Q1266554):
Displaying 50 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Optimal routing for electric vehicle service systems (Q320027) (← links)
- Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
- Risky traveling salesman problem (Q418099) (← links)
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence (Q421576) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- Stochastic chance constrained mixed-integer nonlinear programming models and the solution approaches for refinery short-term crude oil scheduling problem (Q611563) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control (Q683937) (← links)
- The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- A simple greedy algorithm for a class of shuttle transportation problems (Q732773) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
- Travel time reliability in vehicle routing and scheduling with time windows (Q862488) (← links)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- A reactive GRASP and path relinking for a combined production-distribution problem (Q883304) (← links)
- Dynamic VRP in pharmaceutical distribution -- a case study (Q926346) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← 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 two-stage stochastic programming model for transportation network protection (Q960408) (← links)
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
- Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← 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)
- Planning models for freight transportation (Q1278638) (← links)
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations. (Q1413870) (← links)
- A continuous approach to the design of physical distribution systems (Q1571036) (← links)
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
- A period vehicle routing case study (Q1604063) (← links)
- The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
- Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← links)
- The dynamic bowser routing problem (Q1711454) (← links)
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping (Q1749489) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
