#### DMCA

## A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem (2006)

### Cached

### Download Links

Citations: | 3 - 0 self |

### Citations

370 | Benchmarking optimization software with performance profiles - Dolan, Moré - 2002 |

331 | Scheduling of vehicles from a central depot to a number of delivery points - Clarke, Wright - 1964 |

273 | Ant colonies for the traveling salesman problem - Dorigo, Gambardella - 1996 |

223 | A tabu search heuristic for the vehicle routing problem - Gendreau, Hertz, et al. - 1994 |

202 | The sample average approximation method for stochastic discrete optimization
- Kleywegt, Shapiro, et al.
- 2001
(Show Context)
Citation Context ...cenarios via a sample average or sample-path approach can be an extremely effective technique for solv25sing two-stage stochastic problems with a discrete structure (Shapiro and Homem-de-Mello, 2000, =-=Kleywegt et al., 2001-=-, Verweij et al., 2003, Linderoth et al., 2006). In the sample-average method for solving SP-ER, instead of including all scenarios S, a random subset S ′ ⊂ S with |S ′ | = N is used. The optimal solu... |

108 | The empirical behavior of sampling methods for stochastic programming. Optimization
- Linderoth, Shapiro, et al.
- 2002
(Show Context)
Citation Context ...approach can be an extremely effective technique for solv25sing two-stage stochastic problems with a discrete structure (Shapiro and Homem-de-Mello, 2000, Kleywegt et al., 2001, Verweij et al., 2003, =-=Linderoth et al., 2006-=-). In the sample-average method for solving SP-ER, instead of including all scenarios S, a random subset S ′ ⊂ S with |S ′ | = N is used. The optimal solution value of SP-ER is denoted as z∗ SP-ER , a... |

94 | Monte Carlo bounding techniques for determining solution quality in stochastic programs.Operations - Mak, Morton, et al. - 1999 |

87 | The integer l-shaped method for stochastic integer programs with complete recourse - Laporte, Louveaux - 1993 |

86 | An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science - Gendreau, Laporte, et al. - 1995 |

71 | Dynamic vehicle routing: Status and prospects - Psaraftis - 1995 |

68 |
A vehicle routing problem with stochastic demand
- Bertsimas
- 1992
(Show Context)
Citation Context ... plants. Bertsimas (1992) also cites as a practical application a company designing routes during a strategic planning phase before exact customer demands are known. As in previous work on the VRPSD (=-=Bertsimas, 1992-=-, Teodorovic and Pavkovic, 1992, Savelsbergh and Goetschalckx, 1995, Hjorring and Holt, 1999, Laporte et al., 2002), we assume that customer demands are independent and follow known probability distri... |

64 | The sample average approximation method applied to stochastic routing problems: a computational study
- Verweij, Ahmed, et al.
- 2003
(Show Context)
Citation Context ...verage or sample-path approach can be an extremely effective technique for solv25sing two-stage stochastic problems with a discrete structure (Shapiro and Homem-de-Mello, 2000, Kleywegt et al., 2001, =-=Verweij et al., 2003-=-, Linderoth et al., 2006). In the sample-average method for solving SP-ER, instead of including all scenarios S, a random subset S ′ ⊂ S with |S ′ | = N is used. The optimal solution value of SP-ER is... |

54 | An algorithm for the vehicle dispatching problem - Christofides, Eilon - 1969 |

50 | A rollout policy for the vehicle routing problem with stochastic demands - Secomandi - 2001 |

44 | Routing with time windows by column generation - Desrosiers, Soumis, et al. - 1984 |

44 | On the capacitated vehicle routing problem - Ralphs, Kopman, et al. - 2003 |

42 | Vehicle routing with stochastic demands: properties and solution framework - Dror, Laporte, et al. - 1989 |

42 | Stochastic vehicle routing: a comprehensive approach - Stewart, Golden - 1983 |

37 | Stochastic vehicle routing with modified savings algorithm - Dror, Trudeau - 1986 |

36 | Models and Exact Solutions for a Class of Stochastic Location-Routing Problems - LaPorte, Louveaux, et al. - 1989 |

34 | The multiple terminal delivery problem with probabilistic demands. Transportation Sci - Tillman - 1969 |

29 | Set partitioning based heuristic for interactive routing - Cullen, Jarvis, et al. - 1981 |

28 | A computational comparison of algorithms for the inventory routing problem - Dror, Ball, et al. - 1985 |

22 | Peterson,“Computational approaches to stochastic vehicle routing problems - Bertsimas, Chervi, et al. - 1995 |

21 | Modeling vehicle routing with uncertain demands as a stochastic program: properties of the corresponding solution - Dror - 1993 |

20 | L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands - Laporte, Louveaux, et al. - 2002 |

13 |
A comparison of the efficiency of fixed versus variable vehicle routes
- Savelsbergh, Goetschalckx
- 1995
(Show Context)
Citation Context ...cal application a company designing routes during a strategic planning phase before exact customer demands are known. As in previous work on the VRPSD (Bertsimas, 1992, Teodorovic and Pavkovic, 1992, =-=Savelsbergh and Goetschalckx, 1995-=-, Hjorring and Holt, 1999, Laporte et al., 2002), we assume that customer demands are independent and follow known probability distributions. Our solution method, which works for general joint demand ... |

10 | M.: Estimation-based metaheuristics for the the vehicle routing problem with stochastic demands and customers. IRIDIA Supplementary - Balaprakash, Birattari, et al. - 2011 |

9 |
A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand. Transportation Planning and
- Teodorović, Goran
- 1992
(Show Context)
Citation Context ...s (1992) also cites as a practical application a company designing routes during a strategic planning phase before exact customer demands are known. As in previous work on the VRPSD (Bertsimas, 1992, =-=Teodorovic and Pavkovic, 1992-=-, Savelsbergh and Goetschalckx, 1995, Hjorring and Holt, 1999, Laporte et al., 2002), we assume that customer demands are independent and follow known probability distributions. Our solution method, w... |

8 |
New optimality cuts for a single-vehicle stochastic routing problem
- Hjorring, Holt
- 1999
(Show Context)
Citation Context ...routes during a strategic planning phase before exact customer demands are known. As in previous work on the VRPSD (Bertsimas, 1992, Teodorovic and Pavkovic, 1992, Savelsbergh and Goetschalckx, 1995, =-=Hjorring and Holt, 1999-=-, Laporte et al., 2002), we assume that customer demands are independent and follow known probability distributions. Our solution method, which works for general joint demand distributions, does not r... |

6 | A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands - Ak, Erera |

4 | Reducing bias in stochastic linear programming with sampling methods - Freimer, Thomas, et al. - 2005 |

4 | Using data mining to forecast uncertain demands - Markovic, Cavar, et al. - 2005 |

3 | Static and dynamic approaches for solving the vehicle routing problem with stochastic demands - Novoa |

1 | Homem de Mello. 2005. Solving the vehicle routing problem with stochastic demands using the cross entropy method - Chepuri, T |

1 | An algorithm for the vehicle dispatching problem. Operational Research Quarterly 309–318 - N - 1969 |

1 | Networks 14 545–565. Routing with time windows by column generation - Desrosiers, Soumis, et al. - 1984 |

1 | An integer L-Shaped algorithm for the capacitated vehicle routing problem with stochastic demands - G, Hamme - 2002 |