Article ID: | iaor1993267 |
Country: | United States |
Volume: | 40 |
Issue: | 3 |
Start Page Number: | 574 |
End Page Number: | 585 |
Publication Date: | May 1992 |
Journal: | Operations Research |
Authors: | Bertsimas Dimitris J. |
Keywords: | networks: path, stochastic processes, vehicle routing & scheduling |
We consider a natural probabilistic variation of the classical vehicle routing problem (VRP), in which demands are stochastic. Given only a probabilistic description of the demand we need to design routes for the VRP. Motivated by applications in strategic planning and distribution systems, rather than resolving the problem when the demand becomes known, we propose to construct an