How to cite this paper
APA: Geramianfar, R., Pakzad, M., Golhashem, H & Tavakkoli-Moghaddam, R. (2013). A multi-objective hub covering location problem under congestion using simulated annealing algorithm. Uncertain Supply Chain Management, 1(3), 153-164.
Chicago/Turabian: Geramianfar, R., Pakzad, M., Golhashem, H & Tavakkoli-Moghaddam, R. 2013. "A multi-objective hub covering location problem under congestion using simulated annealing algorithm." Uncertain Supply Chain Management 1, no. 3 (2013): 153-164.
AMA: Geramianfar, R., Pakzad, M., Golhashem, H & Tavakkoli-Moghaddam, R. A multi-objective hub covering location problem under congestion using simulated annealing algorithm. Uncertain Supply Chain Management. 2013;1(3):153-164.
References
Abdinnour-Helm, S. (2001). Using simulated annealing to solve the p-hub median problem. International Journal of Physical Distribution & Logistics Management, 31(3), 203-220.
Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1-21.
Aykin, T. (1995). Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Science, 29(3), 201-221.
Boland, N., Krishnamoorthy, M., Ernst, A. T., & Ebery, J. (2004). Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155(3), 638-653.
Brooks, S. P., & Morgan, B. J. T. (1995). Optimization using simulated annealing. The Statistician, 241-257.
de Camargo, R. S., Miranda, G., & Luna, H. P. (2008). Benders decomposition for the uncapacitated multiple allocation hub location problem. Computers & Operations Research, 35(4), 1047-1064.
Contreras, I., D?az, J. A., & Fern?ndez, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR spectrum, 31(3), 483-505.
Ebery, J., Krishnamoorthy, M., Ernst, A., & Boland, N. (2000). The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120(3), 614-631.
Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141-159.
Karimi, P., Shadlou, S., & Nazari, B. (2012). Introduction of a novel and powerful optimization method using genetic algorithm and finite element method. Advanced Materials Research, 433, 746-753.
Labbé, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical programming, 102(2), 371-405.
Mar?n, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operations Research, 32(12), 3093-3109.
Pirkul, H., & Schilling, D. A. (1998). An efficient procedure for designing single allocation hub and spoke systems. Management Science, 44(12-Part-2), S235-S242.
Sasaki, M., & Fukushima, M. (2003). On the hub-and-spoke model with arc capacity constraints. Journal of the Operations Research Society of Japan-Keiei Kagaku, 46(4), 409-428.
Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1-21.
Aykin, T. (1995). Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Science, 29(3), 201-221.
Boland, N., Krishnamoorthy, M., Ernst, A. T., & Ebery, J. (2004). Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155(3), 638-653.
Brooks, S. P., & Morgan, B. J. T. (1995). Optimization using simulated annealing. The Statistician, 241-257.
de Camargo, R. S., Miranda, G., & Luna, H. P. (2008). Benders decomposition for the uncapacitated multiple allocation hub location problem. Computers & Operations Research, 35(4), 1047-1064.
Contreras, I., D?az, J. A., & Fern?ndez, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR spectrum, 31(3), 483-505.
Ebery, J., Krishnamoorthy, M., Ernst, A., & Boland, N. (2000). The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120(3), 614-631.
Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141-159.
Karimi, P., Shadlou, S., & Nazari, B. (2012). Introduction of a novel and powerful optimization method using genetic algorithm and finite element method. Advanced Materials Research, 433, 746-753.
Labbé, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical programming, 102(2), 371-405.
Mar?n, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operations Research, 32(12), 3093-3109.
Pirkul, H., & Schilling, D. A. (1998). An efficient procedure for designing single allocation hub and spoke systems. Management Science, 44(12-Part-2), S235-S242.
Sasaki, M., & Fukushima, M. (2003). On the hub-and-spoke model with arc capacity constraints. Journal of the Operations Research Society of Japan-Keiei Kagaku, 46(4), 409-428.