How to cite this paper
Mohammadi, M., Tavakkoli-Moghaddam, R & Rostami, R. (2011). A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem.International Journal of Industrial Engineering Computations , 2(3), 671-688.
Refrences
Alumur, S., Kara, B.Y. (2009). The design of single allocation incomplete hub networks. Transportation Research Part B, 43 (10), 936–951.
Atashpas-Gargari E. and Lucas C. (2007). Colonial competitive algorithm. IEEE Congress on Evolutionary Computation.
Aykin T. (1994). Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problems. European Journal of Operational Research, 79, 501–523.
Aykin T. (1988). On the location of hub facilities. Transportation Science, 22 (2), 155–157.
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.
Campbell, J.F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387–405.
Campbell, J.F. (1996). Hub location and the p-hub median problem. Operations Research, 44 (6), 923–935.
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M. (2002). Hub location problems. In: Z. Drezner and H. Hamacher (Eds.), Facility location: Applications and theory. Berlin: Springer, 373–406.
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M. (2005). Hub arc location problems: part I – introduction and results. Management Science, 51 (10), 1540–1555.
Contreras, I., Fernández, E., Marín, A. (2009a). Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research, 36 (12), 3117–3127.
Contreras, I., Díaz, J., Fernández, E. (2009b). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31 (3), 483–505.
Contreras, I., Fernández, E., Marín, A. (2010). The tree of hubs location problem. European Journal of Operational Research, 202 (2), 390–400.
Costa, M., Captivo, M., Clímaco, J. (2008). Capacitated single allocation hub location problem – a bi-criteria approach. Computers & Operations Research, 35 (11), 3671–3695.
Ebery, J., Krishnamoorthy, M., Ernst, A.T., Boland, N. (2000). The capacitated multiple allocation hub location problems: formulations and algorithms. European Journal of Operational Research, 120, 614–31.
Ernst, A.T., Krishnamoorthy. M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4 (3), 139–54.
Ernst, A.T., Krishnamoorthy, M. (1996). An exact solution approach based on shortest paths for p-hub median problems. INFORMS Journal on Computing, 10 (2),149–62.
Ernst, A.T., Krishnamoorthy, M. (1998). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104, 100–12.
Ernst, A.T., Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141–59.
Ernst, A.T., Jiang, H., Krishnamoorthy, M. (2005). Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Unpublished Report, CSIRO Mathematical and Information Sciences, Australia.
Jabal-Ameli, M.S., Aryanezhad, M.B., Ghaffari-Nasab, N. (2011). A variable neighborhood descent based heuristic to solve the capacitated location-routing problem. International Journal of Industrial Engineering Computations, 2, 141–154.
Kara, B.Y., Tansel, B.C. (2003). The single-assignment hub covering problem: Models and linearizations. Journal of the Operational Research Society, 54, 59–64.
Labbe´, M., Yaman, H. (2004). Projecting flow variables for hub location problems. Networks, 44 (2), 84–93.
Malekinezhad, A., Shirazi, E., Aryanezhad, M., B. (2011). A multi-objective set covering problem: A case study of warehouse allocation in truck industry. Management Science Letters, 1, 73–80.
Marin, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operational Research, 32 (12), 3093–3109.
Montgomery DC (2000). Design and analysis of experiments, 5th edn. Wiley, London.
Nickel, S., Schobel, A., Sonneborn, T. (2001). Hub location problems in urban traffic networks. In: Niittymaki, J., Pursula, M. (Eds.), Mathematics Methods and Optimization in Transportation Systems. Kluwer Academic Publishers, 1–12.
O’Kelly ME. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393–404.
O’Kelly, M.E., Skorin-Kapov, D., Skorin-Kapov, J. (1995). Lower bounds for the hub location problem. Management Science, 41 (4), 713–721.
Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94, 582–593.
Yaman, H. Star p-hub median problem with modular arc capacities. (2008). Computers & Operations Research, 35 (9), 3009–3019.
Atashpas-Gargari E. and Lucas C. (2007). Colonial competitive algorithm. IEEE Congress on Evolutionary Computation.
Aykin T. (1994). Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problems. European Journal of Operational Research, 79, 501–523.
Aykin T. (1988). On the location of hub facilities. Transportation Science, 22 (2), 155–157.
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.
Campbell, J.F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387–405.
Campbell, J.F. (1996). Hub location and the p-hub median problem. Operations Research, 44 (6), 923–935.
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M. (2002). Hub location problems. In: Z. Drezner and H. Hamacher (Eds.), Facility location: Applications and theory. Berlin: Springer, 373–406.
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M. (2005). Hub arc location problems: part I – introduction and results. Management Science, 51 (10), 1540–1555.
Contreras, I., Fernández, E., Marín, A. (2009a). Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research, 36 (12), 3117–3127.
Contreras, I., Díaz, J., Fernández, E. (2009b). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31 (3), 483–505.
Contreras, I., Fernández, E., Marín, A. (2010). The tree of hubs location problem. European Journal of Operational Research, 202 (2), 390–400.
Costa, M., Captivo, M., Clímaco, J. (2008). Capacitated single allocation hub location problem – a bi-criteria approach. Computers & Operations Research, 35 (11), 3671–3695.
Ebery, J., Krishnamoorthy, M., Ernst, A.T., Boland, N. (2000). The capacitated multiple allocation hub location problems: formulations and algorithms. European Journal of Operational Research, 120, 614–31.
Ernst, A.T., Krishnamoorthy. M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4 (3), 139–54.
Ernst, A.T., Krishnamoorthy, M. (1996). An exact solution approach based on shortest paths for p-hub median problems. INFORMS Journal on Computing, 10 (2),149–62.
Ernst, A.T., Krishnamoorthy, M. (1998). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104, 100–12.
Ernst, A.T., Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141–59.
Ernst, A.T., Jiang, H., Krishnamoorthy, M. (2005). Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Unpublished Report, CSIRO Mathematical and Information Sciences, Australia.
Jabal-Ameli, M.S., Aryanezhad, M.B., Ghaffari-Nasab, N. (2011). A variable neighborhood descent based heuristic to solve the capacitated location-routing problem. International Journal of Industrial Engineering Computations, 2, 141–154.
Kara, B.Y., Tansel, B.C. (2003). The single-assignment hub covering problem: Models and linearizations. Journal of the Operational Research Society, 54, 59–64.
Labbe´, M., Yaman, H. (2004). Projecting flow variables for hub location problems. Networks, 44 (2), 84–93.
Malekinezhad, A., Shirazi, E., Aryanezhad, M., B. (2011). A multi-objective set covering problem: A case study of warehouse allocation in truck industry. Management Science Letters, 1, 73–80.
Marin, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operational Research, 32 (12), 3093–3109.
Montgomery DC (2000). Design and analysis of experiments, 5th edn. Wiley, London.
Nickel, S., Schobel, A., Sonneborn, T. (2001). Hub location problems in urban traffic networks. In: Niittymaki, J., Pursula, M. (Eds.), Mathematics Methods and Optimization in Transportation Systems. Kluwer Academic Publishers, 1–12.
O’Kelly ME. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393–404.
O’Kelly, M.E., Skorin-Kapov, D., Skorin-Kapov, J. (1995). Lower bounds for the hub location problem. Management Science, 41 (4), 713–721.
Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94, 582–593.
Yaman, H. Star p-hub median problem with modular arc capacities. (2008). Computers & Operations Research, 35 (9), 3009–3019.