Loading...
Please wait, while we are loading the content...
Similar Documents
An algorithm for the vehicle routing problem with stochastic demands
| Content Provider | Semantic Scholar |
|---|---|
| Author | Savelsbergh, Mwp Martin Goetschalckx, Marc |
| Copyright Year | 1990 |
| Abstract | Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. This research was supported in part by the member companies of the Material Handling Research Center of the Georgia Institute of Technology. An Algorithm for the Vehicle Routing Problem with Stochastic Demands M.W.P. Savelsbergh Eindhoven University of Technology M. Goetschalckx Georgia Institute of Technology, Atlanta Abstract Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms.Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://pure.tue.nl/ws/files/2474401/340652.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
