A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty ∗

@inproceedings{2006ARO,
  title={A Robust Optimization Approach for the Capacitated Vehicle Routing Problem with Demand Uncertainty ∗},
  author={},
  year={2006}
}
  • Published 2006
In this paper we introduce a robust optimization approach to solve the Vehicle Routing Problem (VRP) with demand uncertainty. This approach yields routes that minimize transportation costs while satisfying all demands in a given bounded uncertainty set. We show that for the Miller-Tucker-Zemlin formulation of the VRP and specific uncertainty sets, solving for the robust solution is no more difficult than solving a single deterministic VRP. We present computational results that investigate the… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 56 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Computational results with a branch and cut code for the capacitated vehicle routing problem

  • P. Augerat, J. Belenguer, E. Benavent, A. Corbern, D. Naddef, G. Rinaldi
  • Research report 949-m, Universite Joseph Fourier…
  • 1995
Highly Influential
8 Excerpts

Stochastic routing problem

  • P. Jaillet
  • G. Andreatta, F. Mason, and P. Serafini (Eds…
  • 1987
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…