Multi-objective hub network design under uncertainty considering congestion: An M/M/c/K queue system

Applied Mathematical Modelling

Volumn 40, Issue 5-6, 2016, Pages 4179-4198

  Rahimi, Yaser ^a   Tavakkoli Moghaddam, Reza ^a,b   Mohammadi, Mehrdad ^a,b   Sadeghi, Marjan ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b Paul Verlaine University of Metz   (France)

Author keywords

Congestion; Hub location problem; Meta heuristics; Queue system; Uncertainty

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL EFFICIENCY; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; LOCATION; OPTIMIZATION; SENSITIVITY ANALYSIS; SITE SELECTION;

CONGESTION; HUB LOCATION PROBLEMS; META HEURISTICS; QUEUE SYSTEMS; UNCERTAINTY;

TELECOMMUNICATION NETWORKS;

EID: 84958279590     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2015.11.019     Document Type: Article

References (65)

1. Contreras I., Fernandez E., Marin A. Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 2009, 36:3117-3127.
2. Eiselt H.A., Marianov V. A conditional p-hub location problem with attraction functions. Comput. Oper. Res. 2009, 36:3128-3135.
3. Silva M.R., Cunha C. New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 2009, 36:3152-3165.
4. Mohammadi M., Tavakkoli-Moghaddam R., Tolouei H., Yousefi M. Solving a hub covering location problem under capacity constraints by a hybrid algorithm. J. Appl. Oper. Res. 2010, 2(2):109-116.
5. Mohammadi M., Tavakkoli-Moghaddam R., Rostami H. A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem. Int. J. Indus. Eng. Comput. 2011, 2(3):671-688.
6. Mohammadi M., Tavakkoli-Moghaddam R., Ghodratnama A., Rostami H. Genetic and improved shuffled frog leaping algorithms for a 2-stage model of a hub covering location network. Int. J. Indus. Eng. Prod. Res. 2011, 22(3):171-179.
7. R. Ghodsi, M. Mohammadi, H. Rostami, Hub covering location problem under capacity constraints In Proceedings of the Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation (IEEE). (2010) 204-208.
8. Owen S.H., Daskin M.S. Strategic facility location: a review. Eur. J. Oper. Res. 1998, 111:423-447.
9. Alumur S., Kara B.Y. Network hub location problems: the state of the art. Eur. J. Oper. Res. 2008, 190(1):1-21.
10. Campbell J.F., Ernst AT., Krishnamoorthy M. Hub location problems. Facility Location: Applications And Theory 2002, Springer, Berlin. Z. Drezner, H. Hamacher (Eds.).
11. Zanjirani Farahani R., Hekmatfar M., Boloori Arabani A., Nikbakhsh E. Hub location problems: a review of models, classification, techniques and application. Comput. Ind. Eng. 2013, 64:1096-1109.
12. N. Vidyarthi, S. Jayaswal, R. Tyagi, Hub and spoke network system design for freight transportation with priority consignment classes, CIRRELT, Nov. 2013.
13. Tan P.Z., Kara B.Y. A hub covering model for cargo delivery systems. Networks 2007, 49(1):28-39.
14. Lin C.C., Lin J.Y., Chen Y.C. The capacitated p-hub median problem with integral constraints: an application to a Chinese air cargo network. Appl. Math. Model. 2012, 36(6):2777-2787.
15. Ishfaq R., Sox C.R. Design of intermodal logistics networks with hub delays. Eur. J. Oper. Res. 2012, 220:629-641.
16. Mohammadi M., Jolai F., Tavakkoli-Moghaddam R. Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm. Appl. Math. Model. 2013, 37(24):10053-10073.
17. Mohammadi M., Torabi S.A., Tavakkoli-Moghaddam R. Sustainable hub location under mixed uncertainty. Trans. Res. Part E 2014, 62:89-115.
18. Mohammadi M., Dehbari S., Vahdani B. Design of a bi-objective reliable healthcare network with finite capacity queue under service covering uncertainty. Trans. Res. Part E 2014, 72:15-41.
19. Zahiri B., Tavakkoli-Moghaddam R., Mohammadi M., Jula P. Multi-objective design of an organ transplant network under uncertainty. Transp. Res. Part E 2014, 72:101-124.
20. Niakan F., Vahdani B., Mohammadi M. A multi-objective optimization model for hub network design under uncertainty: an inexact rough-interval fuzzy approach. Eng. Opt. 2015, 47:1670-1688.
21. Rodriguez V., Alvarez M.J., Barcos L. Hub location under capacity constraints. Trans. Res. Part E: Logis. Trans. Rev. 2007, 43:495-505.
22. Costa M., Captivo M., Climaco J. Capacitated single allocation hub location problem - A bi-criteria approach. Comput. Oper. Res. 2008, 35(11):3671-3695.
23. Snyder L.V. Facility location under uncertainty: a review. IIE Trans. 2006, 38:537-554.
24. Negoita C., Zadeh L., Zimmermann H. Fuzzy sets as a basis for a theory of possibility. Fuzz. Set. Syst. 1978, 1:3-28.
25. Bashiri M., Mirzaei M., Randall M. Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution. Appl. Mat. Model. 2013, 37(5):3513-3525.
26. k.Yang, Liu Y., Yang G. Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion. Appl. Math. Model. 2014, 38(15-16):3987-4005.
27. O'Kelly M.E. The location of interacting hub facilities. Trans. Sci. 1986, 20(2):92-106.
28. Campbell J.F. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 1994, 72(2):387-405.
29. Ernst A.T., Krishnamoorthy M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 1998, 104(1):100-112.
30. Skorin-Kapov D., Skorin-Kapov J., O'Kelly M.E. Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 1996, 94(3):582-593.
31. Marianov V., Serra D. Probabilistic, maximal covering location-allocation models for congested systems. J. Regi. Sci. 1998, 38(3):401-424.
32. Marianov V., Serra D. Location-allocation of multiple-server service centers with constrained queues or waiting times. Ann. Oper. Res. 2002, 111:35-50.
33. Marianov V., Serra D. Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. 2003, 30(7):983-1003.
34. Elhedhli S., Hu F.X. Hub-and-spoke network design with congestion. Comput. Oper. Res. 2005, 32(6):1615-1632.
35. Berman O., Hodgson M.J., Krass D. Flow-interception problems. Facility Location: A Survey Of Applications And Methods 1995, Springer, New York. Springer Series In Operations Research. Z. Drezner (Ed.).
36. Rahmati S.H.A., Ahmadi A., Sharifi M., Chambari A. A multi-objective model for facility location-allocation problem with immobile servers within queuing framework. Comput. Ind. Eng. 2014, 74:1-10.
37. Mohammadi M., Jolai F., Rostami H. An M/M/c queue model for hub covering location problem. Math. Comput. Model. 2011, 54:2623-2638.
38. Van Woensel T., Cruz F.R.B. A stochastic approach to traffic congestion costs. Comput. Oper. Res. 2009, 36:1731-1739.
39. Van Woensel T., Vandaele N. Empirical validation of a queueing approach to uninterrupted traffic flows. 4OR 2006, 4(1):59-72.
40. Van Woens
41. Van Woensel T., Wuyts B., Vandaele N. Validating state-dependent queueing models for uninterrupted traffic flows using simulation. 4OR 2006, 4(2):159-174.
42. Peterson M., Bertsimas D., Odoni A. Models and algorithms for transient queuing congestion at airports. Manag. Sci. 1995, 41(8):1279-1295.
43. Aykin T. Lagrangian-relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. 1994, 79(3):501-523.
44. Ebery J., Krishnamoorthy M., Ernst A., Bolanf N. The capacitated multiple allocation hub location problem: Formulations and algorithm. Eur. J. Oper. Res. 2000, 120(3):614-631.
45. Sasaki M., Fukushima M. On the hub-and-spoke model with arc capacity constraints. J. Oper. Res. Soc. Jpn. 2003, 46(4):409-428.
46. Elhedhli S., Wu H. A lagrangian heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J. Comput. 2010, 22(2):282-296.
47. Gross D., Harris C.M. Fundamentals of Queuing Theory 1974, Wiley, New York.
48. Zahiri B., Tavakkoli-Moghaddam R., Pishvaee M.S. A robust possibilistic programming approach to multi-period location-allocation of organ transplant centers under uncertainty. Comput. Ind. Eng. 2014, 74:139-148.
49. B. Zahiri, S.A. Torabi, M. Mousazadeh, S.A. Mansouri, Blood collection management: methodology and application, Appl. Math. Model. in Press, doi:10.1016/j.apm.2015.04.028.
50. Jimenez M., Arenas M., Bilbao A., Rodriguez M.V. Linear programming with fuzzy parameters: an interactive method resolution. Eur. J. Oper. Res. 2007, 177:1599-1609.
51. Torabi S.A., Hassini E. An interactive possibilistic programming approach for multiple objective supply chain master planning. Fuzz. Set Syst. 2008, 159:193-214.
52. Jimenez M. Ranking fuzzy numbers through the comparison of its expected intervals. Int. J. Uncertain. Fuzzy Knowl. Base Syst. 1996, 4(4):379-388.
53. Heilpern S. The expected valued of a fuzzy number. Fuzz. Set. Sys. 1992, 47:81-86.
54. Hwang C.L., Masud A. Multiple objective decision making, Methods and applications: a state of the art survey. Lecture Notes In Economics And Mathematical Systems 1979, 164. Springer-Verlag, Berlin.
55. Guu S.M., Wu Y.K. Two phase approach for solving the fuzzy linear programming problems. Fuzz. Set. Sys. 1999, 107:191-195.
56. Lai Y.J., Hwang C.L. A new approach to some possibilistic linear programming problems. Fuzz. Set. Sys. 1993, 49:121-133.
57. Sakawa M., Yano H., Yumine T. An interactive fuzzy satisfying method for multi objective linear-programming problems and its application. IEEE Trans. Syst. M. Cyber. 1987, SMC-17:654-661.
58. Wang J., Shu Y.F. A possibilistic decision model for new product supply chain design. Eur. J. Oper. Res. 2007, 177:1044-1061.
59. Mousazadeh M., Torabi S.A., Zahiri B. A robust possibilistic programming approach for pharmaceutical supply chain network design. Comput. Chem. Eng. 2015, 82:115-128.
60. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. Equations of state calculations by fast computing machines. J. Chem. Phys. 1953, 21:1087-1092.
61. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
62. Storn R., Price K. Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11:341-359.
63. Calegari P., Coray G., Hertz A., Kobler D., Kuonen P. A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heur. 1999, 5:145-158.
64. Hassanzadeh A., Jafarian A., Amiri M. Modeling and analysis of the causes of bullwhip effect in centralized and decentralized supply chain using response surface method. Appl. Math. Model. 2014, 38(9):2353-2365.
65. Karimi H., Bashiri M. Hub covering location problems with different coverage types. Sci. Iran. 2011, 18(6):1571-1578.