A Routing Model for Hybrid Hub-and-Spoke with Time Windows

Authors

  • Felix Arya Gunadi Departement of Industrial Engineering, Faculty of Industrial Technology, Parahyangan Catholic University, Indonesia
  • Dharma Lesmono Departement of Mathematic s , Faculty of Information Technology and Science , Parahyangan Catholic University, Indonesia
  • Kinley Aritonang Departement of Industrial Engineering, Faculty of Industrial Technology, Parahyangan Catholic University, Indonesia

DOI:

https://doi.org/10.22219/JTIUMM.Vol21.No1.22-33

Keywords:

Hybrid Hub and Spoke, Routing Problem, Backhauling, Lead Time, Time Windows

Abstract

Currently, the company competition is getting tighter. Distribution companies need to provide excellent service to their customers to maintain their competitiveness. Distribution service performance could be measured with lead time. However, Reducing lead times may increase costs. This problem could be solved using freight consolidation and reducing backhaul. Freight consolidation can be done by using a hub-and-spoke network with a combination of inbound and outbound distribution. This study developed a route model for hybrid hub-and-spoke with time windows. This model determined the routes for shipping goods to consumers and taking products to suppliers using the same vehicle to reduce the backhaul. This model also conducted freight consolidation at the hub. The decision variables in this model included the routes of delivery to consumers, the collection of goods at the suppliers, the number of products distributed through the hub and direct shipping, and the excellent distribution route. This model was implemented into the problems. Besides, a sensitivity analysis of the model was carried out.

References

[1] A. Lewis, A. Lagrange, D. Patterson, and N. Gallop, "South London freight consolidation centre feasability study-Final report," London, UK: TTR, 2007.

[2] G. B. Dantzig and J. H. Ramser, "The Truck Dispatching Problem," Management Science, vol. 6, pp. 80-91, 1959. https://doi.org/10.1287/mnsc.6.1.80.

[3] A. Imran and L. Okdinawati, "Adaptation of the variable Neighborhood search heuristic to solve the vehicle routing problem," Jurnal Teknik Industri, vol. 12, pp. 10-15, 2012. https://doi.org/10.22219/JTIUMM.Vol12.No1.10-15.

[4] P. Toth and D. Vigo, "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, vol. 15, pp. 333-346, 2003. https://doi.org/10.1287/ijoc.15.4.333.24890.

[5] C. Shi, T. Li, Y. Bai, and F. Zhao, "A heuristics-based parthenogenetic algorithm for the vrp with potential demands and time windows," Scientific Programming, vol. 2016, 2016. https://doi.org/10.1155/2016/8461857.

[6] N. A. El-Sherbeny, "Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods," Journal of King Saud University - Science, vol. 22, pp. 123-131, 2010. https://doi.org/10.1016/j.jksus.2010.03.002.

[7] R. Liu and Z. Jiang, "A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints," Applied Soft Computing, vol. 80, pp. 18-30, 2019. https://doi.org/10.1016/j.asoc.2019.03.008.

[8] D. A. P. Putri, "Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion," Jurnal Teknik Industri, vol. 17, p. 9, 2017. https://doi.org/10.22219/JTIUMM.Vol17.No1.22-30.

[9] L. Lin and L. Tao, "Solving Mixed Vehicle Routing Problem with Backhauls by Adaptive Memory Programming Methodology," in 2011 Third International Conference on Measuring Technology and Mechatronics Automation, 2011, pp. 310-313. https://doi.org/10.1109/ICMTMA.2011.648.

[10] M. Goetschalckx and C. Jacobs-Blecha, "The vehicle routing problem with backhauls," European Journal of Operational Research, vol. 42, pp. 39-51, 1989. https://doi.org/10.1016/0377-2217(89)90057-X.

[11] R. Tavakkoli-Moghaddam, A. R. Saremi, and M. S. Ziaee, "A memetic algorithm for a vehicle routing problem with backhauls," Applied Mathematics and Computation, vol. 181, pp. 1049-1060, 2006. https://doi.org/10.1016/j.amc.2006.01.059.

[12] H. Koch, A. Bortfeldt, and G. Wäscher, "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum, vol. 40, pp. 1029-1075, 2018. https://doi.org/10.1007/s00291-018-0506-6.

[13] M. A. Ilgin and S. M. Gupta, Reverse logistics, 2013.

[14] M. E. Çiftçi and M. Şevkli, "A new hub and spoke system proposal: A case study for Turkey's aviation industry," Journal of Air Transport Management, vol. 47, pp. 190-198, 2015. https://doi.org/10.1016/j.jairtraman.2015.06.003.

[15] M. Zhalechian, S. A. Torabi, and M. Mohammadi, "Hub-and-spoke network design under operational and disruption risks," Transportation Research Part E: Logistics and Transportation Review, vol. 109, pp. 20-43, 2018. https://doi.org/10.1016/j.tre.2017.11.001.

[16] F. Alkaabneh, A. Diabat, and S. Elhedhli, "A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion," Transportation Research Part C: Emerging Technologies, vol. 102, pp. 249-273, 2019. https://doi.org/10.1016/j.trc.2018.12.011.

[17] J.-H. Lee and I. Moon, "A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post," Expert Systems with Applications, vol. 41, pp. 5509-5519, 2014. https://doi.org/10.1016/j.eswa.2014.02.027.

[18] W. Chen, K. He, and X. Fang, "Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount," Mathematical Problems in Engineering, vol. 2014, 2014. https://doi.org/10.1155/2014/830632.

[19] X. Yan, W. Jinghui, and Z. Liqun, "An Express Transportation Model of Hub-and-Spoke Network with Distribution Center Group," Berlin, Heidelberg, 2013, pp. 467-472. https://doi.org/10.1007/978-3-642-33030-8_75.

[20] J. Liu, C.-L. Li, and C.-Y. Chan, "Mixed truck delivery systems with both hub-and-spoke and direct shipment," Transportation Research Part E: Logistics and Transportation Review, vol. 39, pp. 325-339, 2003. https://doi.org/10.1016/S1366-5545(03)00005-X.

[21] J. Zhang, Y. Wu, and P. Liu, "Routing Problem for Hybrid Hub-and-spoke Transportation Network: a Case Study of a LTL Carrier," in 2007 IEEE International Conference on Automation and Logistics, 2007, pp. 170-175. https://doi.org/10.1109/ICAL.2007.4338551.

[22] G. Zäpfel and M. Wasner, "Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers," International Journal of Production Economics, vol. 78, pp. 207-220, 2002. https://doi.org/10.1016/S0925-5273(00)00152-3.

Downloads

Published

2020-02-29

How to Cite

Gunadi, F. A., Lesmono, D., & Aritonang, K. (2020). A Routing Model for Hybrid Hub-and-Spoke with Time Windows. Jurnal Teknik Industri, 21(1), 22-33. https://doi.org/10.22219/JTIUMM.Vol21.No1.22-33

Issue

Section

Article