The Stochastic Multiperiod Location Transportation Problem

Walid Klibi (), Francis Lasalle (), Alain Martel () and Soumia Ichoua ()
Additional contact information
Walid Klibi: Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal, Quebéc H3C 3J7, Canada, and Faculté des Sciences de l'Administration, Département Opérations et Systémes de Décision, Université Laval, Québec City, Québec G1V 0A6, Canada
Francis Lasalle: Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal, Quebéc H3C 3J7, Canada, and Faculté des Sciences de l'Administration, Département Opérations et Systémes de Décision, Université Laval, Québec City, Québec G1V 0A6, Canada
Alain Martel: Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal, Quebéc H3C 3J7, Canada, and Faculté des Sciences de l'Administration, Département Opérations et Systémes de Décision, Université Laval, Québec City, Québec G1V 0A6, Canada
Soumia Ichoua: Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université de Montréal, Montréal, Quebéc H3C 3J7, Canada, and Department of Computer Science and Engineering, Johnson C. Smith University, Charlotte, North Carolina 28216

Transportation Science, 2010, vol. 44, issue 2, 221-237

Abstract: 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.

Keywords: location problem; transportation problem; stochastic customer order process; stochastic programming; Monte Carlo scenarios; tabu search (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1090.0307 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:44:y:2010:i:2:p:221-237

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().