Skip to main content
Log in

Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The location-routing problem (LRP) is a relatively new research area within location analysis that concerns simultaneously both the problems of location of facilities and routing of vehicles among the established facilities and the demand points. In this work, we address the capacitated LRP with probabilistic travel times, which may arise in many practical contexts in logistics and supply chain management, and present some bi-objective mathematical programming formulations to model the problem using different stochastic programming approaches. The first objective is to minimize the overall system-wide costs, while the second objective concerns minimization of the maximum delivery time to the customers. In all the cases, the deterministic equivalents of the stochastic models have been extracted. To solve the resulted models, a variable neighborhood descent-based heuristic is proposed and finally computational study is performed and numerical results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Albareda-Sambola M, Fernandez E, Laporte G (2007) Heuristic and lower bound for a stochastic location-routing problem. Eur J Oper Res 179:940–955

    Article  MATH  Google Scholar 

  2. Barreto S, Ferriera C, Paixao J, Santos BS (2007) Using clustering analysis in a capacitated location-routing problem. Eur J Oper Res 179:968–977

    Article  MATH  Google Scholar 

  3. Caballero R, Gonzalez M, Guerrero FM, Molina J, Paralera C (2007) Solving a multiobjective location routing problem with a metaheuristic based on tabu search: application to a real case in Andalusia. Eur J Oper Res 177:1751–1763

    Article  MATH  Google Scholar 

  4. Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28:803–826

    Article  MathSciNet  MATH  Google Scholar 

  5. Charnes A, Cooper WW (1959) Chance-constrained programming. Manag Sci 6(1):73–79

    Article  MathSciNet  MATH  Google Scholar 

  6. Clarke G, Wrights JW (1964) Scheduling of vehicles form a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  7. Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP×ELS approach for the capacitated location-routing problem. Comput Oper Res 37(11):1912–1923

    Article  MATH  Google Scholar 

  8. Fazel Zarandi MH, Hemmati A, Davari S (2011) The multi-depot capacitated location-routing problem with fuzzy travel times. Expert Syst Appl 38:10075–10084

    Article  Google Scholar 

  9. Hassan-Pour HA, Mosadegh-Khan M, Tavakkoli-Moghaddam R (2009) Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing algorithm. Proc IMechE Part B 223:1045–1054

    Article  Google Scholar 

  10. Jabal-Ameli MS, Aryanezhad MB, Ghaffari-Nasab N (2011) A variable neighborhood descent based heuristic for solving the capacitated location-routing problem. Int J Ind Eng Comput 2:141–154

    Google Scholar 

  11. Jacobsen SK, Madsen OBG (1980) A comparative study of heuristics for a two-level routing-location problem. Eur J Oper Res 5(6):378–387

    Article  MATH  Google Scholar 

  12. Laporte G (1988) Location routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. Elsevier, North Holland, pp 163–197

    Google Scholar 

  13. Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multi-depot vehicle routing and location-routing problems. Transp Sci 22:161–172

    Article  MathSciNet  MATH  Google Scholar 

  14. Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time window and stochastic travel and service times: models and algorithm. Int J Prod Econ 125:137–145

    Article  Google Scholar 

  15. Lin JR, Lei HC (2009) Distribution systems design with two-level routing considerations. Ann Oper Res 172(1):329–347

    Article  MATH  Google Scholar 

  16. Marinakis Y, Marinaki M (2008) A bilevel genetic algorithm for a real life location routing problem. Int J Logist Res Appl 11(1):49–65

    Article  MathSciNet  Google Scholar 

  17. Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a research directions synthesis and future. Eur J Oper Res 108:1–15

    Article  MATH  Google Scholar 

  18. Mladenovic M, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  19. Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649–672

    Article  MathSciNet  MATH  Google Scholar 

  20. Or I, Pierskalla WP (1979) A transportation location-allocation model for regional blood banking. AIIE Trans 11:86–94

    Article  Google Scholar 

  21. Prins C, Prodhon C, Ruiz A, Soriano P, Wolfler Calvo R (2007) Solving the capacitated location-routing problem by a cooperative lagrangean relaxation granular tabu search heuristic. Transp Sci 41(4):470–483

    Article  Google Scholar 

  22. Shapiro A, Dentcheva D, Ruszczynski A (2009) Lectures on stochastic programming: modeling and theory. Society for Industrial and Applied Mathematics (SIAM) and Mathematical Programming Society (MPS), Philadelphia

    Book  Google Scholar 

  23. Schwardt M, Fischer K (2009) Combined location-routing problems-a neural network approach. Ann Oper Res 167(1):253–269

    Article  MathSciNet  Google Scholar 

  24. Simchi-Levi D, Kaminsky P, Simchi-Levi E (2003) Designing and managing the supply chain: concepts, strategies, and case studies. McGraw-Hill/Irwin, New York

    Google Scholar 

  25. Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, Hoboken

    Google Scholar 

  26. Tuzun D, Bruke LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 116:87–99

    Article  MATH  Google Scholar 

  27. Watson-Gandy CDT, Dohrn PJ (1973) Depot location with van salesmen—a practical approach. Omega 1(3):321–329

    Article  Google Scholar 

  28. Yu VF, Lin SW, Lee W, Ting CJ (2010) A simulated annealing heuristic for the capacitated location-routing problem. Comput Ind Eng 58:288–299

    Article  Google Scholar 

  29. Zhou G, Min H, Gen M (2002) The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach. Comput Ind Eng 43:251–261

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nader Ghaffari-Nasab.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghaffari-Nasab, N., Jabalameli, M.S., Aryanezhad, M.B. et al. Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times. Int J Adv Manuf Technol 67, 2007–2019 (2013). https://doi.org/10.1007/s00170-012-4627-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4627-9

Keywords

Navigation