Journal of Transportation Research

Journal of Transportation Research

Solving the Hub Location-Routing Problem for National Postal Network with an Integrative Approach

Document Type : Original Article

Authors
Shahriar Afandizadeh 1
Mahmoud Ahmadinejad 2
Saeideh Abdoli 3
Hamid BIgdeli 4
1 Professor, School of Civil Engineering, Iran University of Science and Technology, Tehran, Iran.
2 Associate Professor, School of Civil Engineering, Iran University of Science and Technology, Tehran, Iran.
3 M.Sc., Student, School of Civil Engineering, Iran University of Science and Technology Tehran, Iran
4 Ph.D.Student , School of Civil Engineering, Iran University of Science and Technology Tehran, Iran
10.22034/tri.2023.385465.3128
Abstract
The postal network is a network in which the flow of shipments is collected by vehicles from several sources and transferred to hubs; In the last step, the parcels are sent to the final destination by the vehicles. In order to provide this service, the hubs are located to process the parcels and the local routes are planned to pick up and delivery the packages in the hubs. This problem is known as location-routing problem. The current research seeks to locate the hub and the routing of freight carriers on an intercity scale and at the level of Iran. For this purpose, first, the mathematical model of the problem of locating the hubs and routing the cargo carriers is presented, and since the problem of locating-routing is in the category of complex problems with large dimensions, meta-heuristic algorithms have been used to solve it. In previous studies, meta-heuristic algorithms or a combination of them have been used to solve the location-routing problem, but in the study, the location-routing problem has been solved by integrating two genetic algorithms (GA) and the particle swarm optimization algorithm (PSO). The results of this research show that the integration of two algorithms, PSO and GA, provides a better answer than if only one meta-heuristic algorithm is used to solve the problem. It is worth mentioning that in the current research, the data of Tipax Company was used to locate the hubs and local tours routing.
Keywords
Hub Location Routing Problem
Postal Network Optimization
Genetic Algorithm
Particle Swarm Optimization Algorithm
Subjects
-Abdi, A., Mosadeq, Z., & Bigdeli Rad, H. (2020). Prioritizing Factors Affecting Road Safety Using Fuzzy Hierarchical Analysis. Journal Of Transportation Research, 17(3), 33-44.
-Afandizadeh Zargari, S., Bigdeli Rad, H., & Shaker,H. (2019). Using Optimization and Metaheuristic Method to Reduce the Bus Headway (Case Study: Qazvin Bus Routes). Quarterly Journal of Transportation Engineering, 10(4), 833-849.
-Afandizadeh, S., & Rad, H. B. (2021). Developing A Model to Determine the Number of Vehicles Lane Changing on Freeways by Brownian Motion Method. Nonlinear Engineering, 10(1), 450-460.
-Aslantaş, E., & Yavuz, Y. (2022). İki Kademeli Lokasyon-Rotalama Problemi İçin Bütünleşik Matematiksel Model Ve Kamuda Bir Uygulama. Yönetim Bilimleri Dergisi, 20(45), 523-556.
-Bostel, N., Dejax, P., & Zhang, M. (2015, October). A Model and A Metaheuristic Method for The Hub Location Routing Problem and Application to Postal Services. In 2015 International Conference on Industrial Engineering and Systems Management (IESM), IEEE, 1383-1389.
-Bostel, N., Dejax, P., And Zhang, M. (2015). A Model and A Metaheuristic Method for The Hub Location Routing Problem and Application to Postal Services. 2015 International Conference on Industrial Engineering and Systems Management (IESM), 1383-1389.
-Bruns, A., Klose, A., & Stähly, P. (2000). Restructuring Of Swiss Parcel Delivery Services: Restrukturierung Der Schweizer Paketpost. OR-Spektrum, 22, 285-302.
-Cao, J., Wang, X., Li, B., And Gao, J. (2020).The Location-Routing Problem: A Review". CICTP 2020, 4500-4511.
-Çetiner, S., Sepil, C., & Süral, H. (2010). Hubbing and Routing in Postal Delivery Systems. Annals of Operations Research, 181, 109-124.
-De Camargo, R. S., De Miranda, G., & Løkketangen, A. (2013). A New Formulation and an Exact Approach for The Many-To-Many Hub Location-Routing Problem. Applied Mathematical Modelling, 37(12-13), 7465-7480.
-Drexl, M. And Schneider, M., (2015). A Survey of Variants and Extensions of the Location Routing Problem. European Journal of Operational Research, Vol. 241, No. 2, 283-308.
-Dukkanci, O., Kara, B. Y., & Bektaş, T. (2019). The Green Location-Routing Problem. Computers & OperationsResearch, 105, 187-202.
-Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient Algorithms for The Uncapacitated Single Allocation P-Hub Median Problem. Location Science, 4(3), 139-154.
-Gattuso, J. L. (2013). Can The Postal Service Have a Future? Retrieved From.
-Ghatreh Samani, M., & Hosseini-Motlagh, S. M. (2017). A Hybrid Algorithm for A Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery Under Fuzzy Demand. International Journal of Transportation Engineering, 5(1), 59-85.
-Guastaroba, G., Mor, A., & Speranza, M. G. (2022). Integrated Vehicle Routing Problems: A Survey. In The Palgrave Handbook of Operations Research, ­73-103. Cham: Springer International Publishing.
-Hua-Li, S., Xun-Qing, W., & Yao-Feng, X. (2011). A Bi-Level Programming Model for A Multi-Facility Location-Routing Problem in Urban Emergency System. In Engineering Education and Management: Vol. 1, Results of the 2011 International Conference on Engineering Education and Management (ICEEM2011), 75-80. Springer Berlin Heidelberg.
-Jarboui, B., Derbel, H., Hanafi, S., & Mladenović, N. (2013). Variable Neighborhood Search for Location Routing. Computers & Operations Research, 40(1), 47-57.
-Karimi, H., & Setak, M. (2018). Flow Shipment Scheduling in An Incomplete Hub Location-Routing Network Design Problem. Computational and Applied Mathematics, Vol. 37, 819-851.
-Li, P., Lan, H., & Saldanha-Da-Gama, F. (2019). A Bi-Objective Capacitated Location-Routing Problem for Multiple Perishable Commodities. IEEE Access, 7, 136729-136742.
-Prodhon, C. And Prins, C. (2014). Survey of Recent Research on Location-Routing Problems. European Journal of Operational Research, Vol. 238, No. 1, 1-17.
-Rybičková, A., Burketová, A., & Mocková, D. (2016). Solution to the Location-Routing Problem Using a Genetic Algorithm. 2016 Smart Cities Symposium Prague (SCSP), 1-6.
-S. Ponboon, A. G. Qureshi, and E. Taniguchi, (2016). Branch-And-Price Algorithm for The Location-Routing Problem with Time Windows. Transportation Research Part E: Logistics and Transportation Review, Vol. 86, 1-19.
-Toro, E. M., Franco, J. F., Echeverri, M. G., & Guimarães, F. G. (2017). A Multi-Objective Model for The Green Capacitated
Location-Routing Problem Considering Environmental Impact. Computers & Industrial Engineering, 110, 114-125.
-Zarandi, M. H. F., Hemmati, A., Davari, S., & Turksen, I. B. (2013). Capacitated Location-Routing Problem with Time Windows Under Uncertainty. Knowledge-Based Systems, 37, 480-489.