Journal
TRANSPORTATION SCIENCE
Volume 44, Issue 2, Pages 221-237Publisher
INFORMS
DOI: 10.1287/trsc.1090.0307
Keywords
location problem; transportation problem; stochastic customer order process; stochastic programming; Monte Carlo scenarios; tabu search
Categories
Funding
- Natural Sciences and Engineering Research Council of Canada [DNDPJ 335078-05]
- Defence RD Canada
- Modellium Inc
Ask authors/readers for more resources
This paper studies a stochastic multiperiod location-transportation problem (SMLTP) characterized by multiple transportation options, multiple demand periods, and a stochastic demand. We consider the determination of the number and location of the depots required to satisfy customer demand as well as the mission of these depots in terms of the subset of customers they must supply. The problem is formulated as a stochastic program with recourse, and a hierarchical heuristic solution approach is proposed. It incorporates a tabu search procedure, an approximate route length formula, and a modified procedure of Clarke and Wright (Clarke, G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581). Three neighbourhood exploration strategies are proposed and compared with extensive experiments based on realistic problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available