IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v44y2010i2p221-237.html
   My bibliography  Save this article

The Stochastic Multiperiod Location Transportation Problem

Author

Listed:
  • 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)

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.

Suggested Citation

  • Walid Klibi & Francis Lasalle & Alain Martel & Soumia Ichoua, 2010. "The Stochastic Multiperiod Location Transportation Problem," Transportation Science, INFORMS, vol. 44(2), pages 221-237, May.
    • Handle: RePEc:inm:ortrsc:v:44:y:2010:i:2:p:221-237
    DOI: 10.1287/trsc.1090.0307
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1090.0307
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1090.0307?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    2. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    3. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    4. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    5. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    6. Laporte, Gilbert & Louveaux, Francois & Mercure, Helene, 1989. "Models and exact solutions for a class of stochastic location-routing problems," European Journal of Operational Research, Elsevier, vol. 39(1), pages 71-78, March.
    7. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    8. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    9. Oded Berman & Dmitry Krass & Chen Wei Xu, 1995. "Locating Discretionary Service Facilities Based on Probabilistic Customer Flows," Transportation Science, INFORMS, vol. 29(3), pages 276-290, August.
    10. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    11. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    12. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    13. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    14. Barreto, Sergio & Ferreira, Carlos & Paixao, Jose & Santos, Beatriz Sousa, 2007. "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 968-977, June.
    15. Rosemary T. Berger & Collette R. Coullard & Mark S. Daskin, 2007. "Location-Routing Problems with Distance Constraints," Transportation Science, INFORMS, vol. 41(1), pages 29-43, February.
    16. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    17. Zainuddin, Z.M. & Salhi, S., 2007. "A perturbation-based heuristic for the capacitated multisource Weber problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1194-1207, June.
    18. Carlos F. Daganzo, 1984. "The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application," Transportation Science, INFORMS, vol. 18(4), pages 331-350, November.
    19. Ambrosino, Daniela & Grazia Scutella, Maria, 2005. "Distribution network design: New problems and related models," European Journal of Operational Research, Elsevier, vol. 165(3), pages 610-624, September.
    20. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    2. Albareda-Sambola, Maria & Fernández, Elena & Nickel, Stefan, 2012. "Multiperiod Location-Routing with Decoupled Time Scales," European Journal of Operational Research, Elsevier, vol. 217(2), pages 248-258.
    3. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "An exact and a heuristic approach for the transportation-p-facility location problem," Computational Management Science, Springer, vol. 17(3), pages 389-407, October.
    4. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    5. Fadda, Edoardo & Perboli, Guido & Tadei, Roberto, 2019. "A progressive hedging method for the optimization of social engagement and opportunistic IoT problems," European Journal of Operational Research, Elsevier, vol. 277(2), pages 643-652.
    6. Lin Zhou & Xu Wang & Lin Ni & Yun Lin, 2016. "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
    7. Luca Bertazzi & Francesca Maggioni, 2015. "Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 321-342, July.
    8. Ben Mohamed, Imen & Klibi, Walid & Sadykov, Ruslan & Şen, Halil & Vanderbeck, François, 2023. "The two-echelon stochastic multi-period capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 645-667.
    9. Jaller, Miguel & Pahwa, Anmol, 2023. "Coping with the Rise of E-commerce Generated Home Deliveries through Innovative Last-mile Technologies and Strategies," Institute of Transportation Studies, Working Paper Series qt5t76x0kh, Institute of Transportation Studies, UC Davis.
    10. Alizadeh, Morteza & Amiri-Aref, Mehdi & Mustafee, Navonil & Matilal, Sumohon, 2019. "A robust stochastic Casualty Collection Points location problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 965-983.
    11. Soumen Kumar Das & Magfura Pervin & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2023. "Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach," Annals of Operations Research, Springer, vol. 324(1), pages 283-309, May.
    12. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    13. Amiri-Aref, Mehdi & Farahani, Reza Zanjirani & Hewitt, Mike & Klibi, Walid, 2019. "Equitable location of facilities in a region with probabilistic barriers to travel," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 66-85.
    14. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid, 2022. "Inventory availability commitment under uncertainty in a dropshipping supply chain," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1155-1174.
    15. Paul Berglund & Changhyun Kwon, 2014. "Robust Facility Location Problem for Hazardous Waste Transportation," Networks and Spatial Economics, Springer, vol. 14(1), pages 91-116, March.
    16. Wang, Xin & Kuo, Yong-Hong & Shen, Houcai & Zhang, Lianmin, 2021. "Target-oriented robust location–transportation problem with service-level measure," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 1-20.
    17. Amiri-Aref, Mehdi & Klibi, Walid & Babai, M. Zied, 2018. "The multi-sourcing location inventory problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 266(1), pages 72-87.
    18. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    19. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "Heuristic approaches for solid transportation-p-facility location problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 939-961, September.
    20. Wang, Minke & Wu, Jiang & Kafa, Nadine & Klibi, Walid, 2020. "Carbon emission-compliance green location-inventory problem with demand and carbon price uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    21. Bernard G. Zweers & Sandjai Bhulai & Rob D. Mei, 2021. "Planning hinterland container transportation in congested deep-sea terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 583-622, September.
    22. Ben Jouida, Sihem & Krichen, Saoussen & Klibi, Walid, 2017. "Coalition-formation problem for sourcing contract design in supply networks," European Journal of Operational Research, Elsevier, vol. 257(2), pages 539-558.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    2. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    3. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    4. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    5. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    6. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    7. Hunkar Toyoglu & Oya Ekin Karasan & Bahar Yetis Kara, 2011. "Distribution network design on the battlefield," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 188-209, April.
    8. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    9. Ben Mohamed, Imen & Klibi, Walid & Sadykov, Ruslan & Şen, Halil & Vanderbeck, François, 2023. "The two-echelon stochastic multi-period capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 645-667.
    10. Rieck, Julia & Ehrenberg, Carsten & Zimmermann, Jürgen, 2014. "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery," European Journal of Operational Research, Elsevier, vol. 236(3), pages 863-878.
    11. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    12. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    13. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
    14. Roberto Baldacci & Aristide Mingozzi & Roberto Wolfler Calvo, 2011. "An Exact Method for the Capacitated Location-Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1284-1296, October.
    15. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    16. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    17. Martínez-Salazar, Iris Abril & Molina, Julian & Ángel-Bello, Francisco & Gómez, Trinidad & Caballero, Rafael, 2014. "Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms," European Journal of Operational Research, Elsevier, vol. 234(1), pages 25-36.
    18. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    19. Jenn-Rong Lin & Hsien-Chung Lei, 2009. "Distribution systems design with two-level routing considerations," Annals of Operations Research, Springer, vol. 172(1), pages 329-347, November.
    20. Ahn, Jaemyung & de Weck, Olivier & Geng, Yue & Klabjan, Diego, 2012. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration," European Journal of Operational Research, Elsevier, vol. 223(1), pages 47-59.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:44:y:2010:i:2:p:221-237. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.