Article ID: | iaor2002105 |
Country: | United Kingdom |
Volume: | 28 |
Issue: | 8 |
Start Page Number: | 803 |
End Page Number: | 826 |
Publication Date: | Jul 2001 |
Journal: | Computers and Operations Research |
Authors: | Chan Yupo, Carter William B., Burnes Michael D. |
Keywords: | vehicle routing & scheduling, heuristics |
We formulate a multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, which are defined as demands that are generated upon completing site-specific service on their predecessors. When a factory is re-supplied with manufacturing materials, for example, demand for raw materials surfaces only after the existing inventory has been exhausted. A special separable case of the problem was solved, wherein probable demands are estimated by stochastic processes at the demand nodes (the factories) before the vehicle location-routing decisions. Posterior solutions to the complete 90-day instances of the problem help to gauge the performance of the