A metaheuristic approach to the reliable location routing problem under disruptions

Transportation Research Part E: Logistics and Transportation Review

Volumn 83, Issue , 2015, Pages 90-110

  Zhang, Ying ^a   Qi, Mingyao ^a   Lin, Wei Hua ^b   Miao, Lixin ^a  

^a TSINGHUA UNIVERSITY   (China)

^b University of Arizona   (United States)

Author keywords

Facility disruptions; Location routing problem; Reliability design; Simulated annealing

Indexed keywords

ALGORITHM; ANNEALING; DESIGN; FACILITY LOCATION; HEURISTICS; LOCATION-ALLOCATION MODEL; MAXIMUM LIKELIHOOD ANALYSIS; RELIABILITY ANALYSIS;

EID: 84942525410     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2015.09.001     Document Type: Article

References (52)

1. Aboolian R., Cui T., Shen Z.J.M. An efficient approach for solving reliable facility location models. INFORMS J. Comput. 2012, 25(4):720-729.
2. Ahmadi-Javid A., Azad N. Incorporating location, routing and inventory decisions in supply chain network design. Transp. Res. Part E: Logist. Transp. Rev. 2010, 46(5):582-597.
3. Ahmadi-Javid A., Seddighi A.H. A location-routing problem with disruption risk. Transp. Res. Part E: Logist. Transp. Rev. 2013, 53:63-82.
4. Ahmadi M., Seifi A., Tootooni B. A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: a case study on San Francisco district. Transp. Res. Part E: Logist. Transp. Rev. 2015, 75:145-163.
5. Akca Z., Berger R.T., Ralphs T.K. A branch-and-price algorithm for combined location and routing problems under capacity restrictions. Operations Research and Cyber-infrastructure 2009, 309-330. Springer.
6. Albareda-Sambola M., Fernández E., Laporte G. Heuristic and lower bound for a stochastic location-routing problem. Eur. J. Oper. Res. 2007, 179(3):940-955.
7. An Y., Zeng B., Zhang Y., Zhao L. Reliable p-median facility location problem: two-stage robust models and algorithms. Transp. Res. Part B: Methodol. 2014, 64:54-72.
8. Balcik B., Beamon B.M. Facility location in humanitarian relief. Int. J. Logist.: Res. Appl. 2008, 11:101-121.
9. Barreto S., Ferreira C., Paixao J., Santos B.S. Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 2007, 179(3):968-977.
10. Belenguer J.M., Benavent E., Prins C., Prodhon C., Wolfler Calvo R. A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 2011, 38(6):931-941.
11. Çelik, M., Ergun, Ö., Johnson, B., Keskinocak, P., Lorca, Á., Pekgün, P., 2012. Humanitarian logistics. In: Tutorials in Operations Research. INFORMS, pp. 18-149.
12. Chen Q., Li X., Ouyang Y. Joint inventory-location problem under the risk of probabilistic facility disruptions. Transp. Res. Part B: Methodol. 2011, 45(7):991-1003.
13. Contardo C., Cordeau J.F., Gendron B. An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J. Comput. 2013, 26(1):88-102.
14. Contardo C., Cordeau J.F., Gendron B. A GRASP+ILP-based metaheuristic for the capacitated location-routing problem. J. Heurist. 2014, 20(1):1-38.
15. Cui T., Ouyang Y., Shen Z.J.M. Reliable facility location design under the risk of disruptions. Oper. Res. 2010, 58(4-part-1):998-1011.
16. Drexl M., Schneider M. A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 2015, 241(2):283-308.
17. Duhamel C., Lacomme P., Prins C., Prodhon C. A GRASP × ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 2010, 37(11):1912-1923.
18. Escobar J.W., Linfati R., Toth P. A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res. 2013, 40(1):70-79.
19. Holguín-Veras J., Jaller M., Van Wassenhove L.N., Pérez N., Wachtendorf T. On the unique features of post-disaster humanitarian logistics. J. Oper. Manage. 2012, 30(7):494-506.
20. Gedik R., Medal H., Rainwater C., Pohl E.A., Mason S.J. Vulnerability assessment and re-routing of freight trains under disruptions: a coal supply chain network application. Transp. Res. Part E: Logist. Transp. Rev. 2014, 71:45-57.
21. Ghaffari-Nasab N., Jabalameli M.S., Aryanezhad M.B., Makui A. Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times. Int. J. Adv. Manuf. Technol. 2013, 67(9-12):2007-2019.
22. Kleywegt A.J., Shapiro A., Homem-de-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 2002, 12(2):479-502.
23. Klibi W., Lasalle F., Martel A., Ichoua S. The stochastic multiperiod location transportation problem. Transp. Sci. 2010, 44(2):221-237.
24. Laarhoven P.J. Theoretical and computational aspects of simulated annealing. CWI Tracts 1988, 51:1-168.
25. Min H., Jayaraman V., Srivastava R. Combined location-routing problems: a synthesis and future research directions. Eur. J. Oper. Res. 1998, 108(1):1-15.
26. Nagy G., Salhi S. Location-routing: issues, models and methods. Eur. J. Oper. Res. 2007, 177(2):649-672.
27. Peng P., Snyder L.V., Lim A., Liu Z. Reliable logistics networks design with facility disruptions. Transp. Res. Part B: Methodol. 2011, 45(8):1190-1211.
28. Prins C., Prodhon C., Calvo R.W. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 2006, 4(3):221-238.
29. Prins C., Prodhon C., Ruiz A., Soriano P., Wolfler Calvo R. Solving the capacitated location-routing problem by a cooperative Lagrangian relaxation-granular tabu search heuristic. Transp. Sci. 2007, 41(4):470-483.
30. Prodhon C., Prins C. A survey of recent research on location-routing problems. Eur. J. Oper. Res. 2014, 238(1):1-17.
31. Qi L. A continuous-review inventory model with random disruptions at the primary supplier. Eur. J. Oper. Res. 2013, 225(1):59-74.
32. Qi L., Shen Z.J.M. A supply chain design model with unreliable supply. Nav. Res. Logis. 2007, 54(8):829-844.
33. Rennemo S.J., Rø K.F., Hvattum L.M., Tirado G. A three-stage stochastic facility routing model for disaster response planning. Transp. Res. Part E: Logist. Transp. Rev. 2014, 62:116-135.
34. Salhi S., Rand G.K. The effect of ignoring routes when locating depots. Eur. J. Oper. Res. 1989, 39(2):150-156.
35. Santoso T., Ahmed S., Goetschalckx M., Shapiro A. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 2005, 167(1):96-115.
36. Shen Z.J.M., Zhan R.L., Zhang J. The reliable facility location problem: formulations, heuristics, and approximation algorithms. INFORMS J. Comput. 2011, 23(3):470-482.
37. Snyder, L.V., 2003. Supply Chain Robustness and Reliability: Models and Algorithms. Doctoral Dissertation, Northwestern University.
38. Snyder L.V., Daskin M.S. Reliability models for facility location: the expected failure cost case. Transp. Sci. 2005, 39(3):400-416.
39. Snyder L.V., Daskin M.S. Stochastic p-robust location problems. IIE Trans. 2006, 38(11):971-985.
40. Snyder L.V., Daskin M.S., Teo C.P. The stochastic location model with risk pooling. Eur. J. Oper. Res. 2007, 179(3):1221-1238.
41. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 1987, 35(2):254-265.
42. Ting C.J., Chen C.H. A multiple ant colony optimization algorithm for the capacitated location routing problem. Int. J. Prod. Econ. 2013, 141(1):34-44.
43. Toth P., Vigo D. The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 2003, 15(4):333-346.
44. Ukkusuri S.V., Yushimito W.F. Location routing approach for the humanitarian prepositioning problem. Transp. Res. Rec.: J. Transp. Res. Board. 2008, 2089(1):18-25.
45. Wu T.H., Low C., Bai J.W. Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 2002, 29(10):1393-1415.
46. Xie, W., Ouyang, Y., 2014. Reliable location-routing design under probabilistic facility disruptions. In: Proceedings of the 93rd Annual Meeting of the Transportation Research Board, Washington DC.
47. Yu V.F., Lin S.W., Lee W., Ting C.J. A simulated annealing heuristic for the capacitated location routing problem. Comput. Ind. Eng. 2010, 58(2):288-299.
48. Zarandi M.H.F., Hemmati A., Davari S. The multi-depot capacitated location-routing problem with fuzzy travel times. Expert Syst. Appl. 2011, 38(8):10075-10084.
49. Zarandi M.H.F., Hemmati A., Davari S., Burhan Turksen I. Capacitated location-routing problem with time windows under uncertainty. Knowl.-Based. Syst. 2013, 37:480-489.
50. Zare Mehrjerdi Y., Nadizadeh A. Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands. Eur. J. Oper. Res. 2013, 229(1):75-84.
51. Zhang, B., Ma, Z., Jiang, S., 2008. Location-routing-inventory problem with stochastic demand in logistics distribution systems. In: 4th International Conference on IEEE Wireless Communications, Networking and Mobile Computing, WiCOM'08, pp. 1-4.
52. Zhang Y., Qi M., Miao L., Liu E. Hybrid metaheuristic solutions to inventory location routing problem. Transp. Res. Part E: Logist. Transp. Rev. 2014, 70:305-323.