Designing a hub covering location problem under uncertainty conditions

Abstract: Increased demand for transportation is inevitable along with the growth of social welfare and economic development. Furthermore, providing cheap transportation services has brought about a bulk of benefits in the ever-expanding development of countries. Therefore, the optimization of fuel consumption in the transportation sector is essential for the continued low cost of transportation and reduced amount of pollution caused by the traffic. A major strategy for optimizing fuel consumption and transportation costs in the transportation of goods and passengers is the proper design of transportation networks. Accordingly, in this study, hub covering location problem is modeled taking into account the queuing system in order to minimize the cost of the whole network as well as to minimize emissions of greenhouse gases. The model presented in this study includes uncertain parameters of demand and transportation costs. To control the parameters, a robust-box optimization method is used. As the hub covering network model is multi-objective and NP-hard, three meta-heuristic algorithms; namely MOPSO, NSGA II and MOALO are presented. Computational results show the high efficiency of the MOALO algorithm for obtaining efficient problem-solving in large sizes.

How to cite this paper

 Zahedi, M & Nahr, J. (2020). Designing a hub covering location problem under uncertainty conditions.Management Science Letters , 9(3), 477-500.

Refrences

Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1-21.
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization (Vol. 28). Princeton University Press.
Calık, H., Alumur, S. A., Kara, B. Y., & Karasan, O. E. (2009). A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research, 36(12), 3088-3096.
Campbell, J., Ernst, A., & Krishnamoorthy, M. (2002). Hub location problems.
Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2), 387-405.
Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4), 1096-1109.
Gao, Y., & Qin, Z. (2016). A chance constrained programming approach for uncertain p-hub center location problem. Computers & Industrial Engineering, 102, 10-20.
Gavriliouk, E. O. (2009). Aggregation in hub location problems. Computers & Operations Research, 36(12), 3136-3142.
Ghaffarinasab, N., Motallebzadeh, A., Jabarzadeh, Y., & Kara, B. Y. (2018). Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Computers & Operations Research, 90, 173-192.
Goldman, A. J. (1969). Optimal locations for centers in a network. Transportation Science, 3(4), 352-360.
Hasanzadeh, H., Bashiri, M., & Amiri, A. (2018). A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming. Soft Computing, 22(3), 949-961.
Huang, J., & Qingyun, W. A. N. G. (2009). Robust optimization of hub-and-spoke airline network design based on multi-objective genetic algorithm. Journal of Transportation Systems Engineering and Information Technology, 9(3), 86-92.
Makui, A., Rostami, M., Jahani, E., & Nikui, A. (2011). A multi-objective robust optimization model for the capacitated P-hub location problem under uncertainty. Management Science Letters, 2(2), 525-534.
Marianov, V., & Serra, D. (2003). Location models for airline hubs behaving as M/D/c queues. Computers & Operations Research, 30(7), 983-1003
Meraklı, M., & Yaman, H. (2017). A capacitated hub location problem under hose demand uncertainty. Computers & Operations Research, 88, 58-70.
Mirjalili, S., Jangir, P., & Saremi, S. (2017). Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems. Applied Intelligence, 46(1), 79-95.
Nickel, S., Schöbel, A., & Sonneborn, T. (2001). Hub location problems in urban traffic networks. Mathematical Methods on Optimization in Transportation Systems, 48, 95.
O'kelly, M. E. (1986). The location of interacting hub facilities. Transportation science, 20(2), 92-106.
O'kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32(3), 393-404.
O'Kelly, M. E. (1992). Hub facility location with fixed costs. Papers in Regional Science, 71(3), 293-306.
Peker, M., & Kara, B. Y. (2015). The P-Hub maximal covering problem and extensions for gradual decay functions. Omega, 54, 158-172.
Rodríguez-Martín, I., Salazar-González, J. J., & Yaman, H. (2014). A branch-and-cut algorithm for the hub location and routing problem. Computers & Operations Research, 50, 161-174.
Seifbarghy, M., Hemmati, M., & Soltan Karimi, S. (2018). Hub Covering Location Problem Considering Queuing and Capacity Constraints. Journal of Optimization in Industrial Engineering, 11(1), 143-156.
Silva, M. R., & Cunha, C. B. (2017). A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, 262(3), 954-965.
Yu, J., Liu, Y., Chang, G. L., Ma, W., & Yang, X. (2009). Cluster-based hierarchical model for urban transit hub location planning: formulation, solution, and case study. Transportation Research Record, 2112(1), 8-16.
Zhai, H., Liu, Y. K., & Yang, K. (2016). Modeling two-stage UHL problem with uncertain demands. Applied Mathematical Modelling, 40(4), 3029-3048.

Journals

MSL Volumes

Keywords

Authors

Countries

Management Science Letters

Designing a hub covering location problem under uncertainty conditions Pages 477-500 Download PDF

Add Reviews