Pages that link to "Item:Q2467454"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454):
Displaying 30 items.
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← 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)
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
- Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
- Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← 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)
- Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations (Q2664431) (← links)
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
- A stochastic inventory routing problem for infectious medical waste collection (Q2811325) (← links)
- Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price (Q2958618) (← links)
- Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints (Q3057127) (← links)
- An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems (Q3296386) (← 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)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← 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)