DOCK-DOOR ASSIGNMENT PROBLEM WITH THE NUMBER OF WORKERS DEPENDENT LOADING AND UNLOADING TIMES IN CROSS-DOCKING

Yıl 2023, Cilt: 34 Sayı: 3, 311 - 333, 31.12.2023

Feriştah Özçelik , Tuğba Saraç , Mehmet Cem Öz

https://doi.org/10.46465/endustrimuhendisligi.1286055

Öz

Unloading and loading times play a crucial role in the door assignment problem in cross-docking. In a majority of the existing literature addressing the door assignment problem in cross-docking, it is generally assumed that these times are predetermined. However, it is important to note that unloading and loading times can vary based on the number of workers allocated to each door. Therefore, in this study, the problem of assigning trucks to doors in cross-docking is handled together with the problem of determining how many workers will be assigned to each door. A mathematical model has been developed for the considered problem. The proposed model is compared with two different scenarios where a fixed number of workers are assigned to the doors. The performance of the model is shown by using the test problems taken from the literature. The results revealed that assigning the appropriate number of workers to the doors can improve the value of the objective function by an average of 3,14% for Scenario-1 and %4,02 for Scenario-2 compared to scenarios where the number of workers is assumed constant.

Anahtar Kelimeler

Cross-docking, Door assignment problem, Number of workers dependent loading and unloading times.

ÇAPRAZ SEVKİYATTA İŞÇİ SAYISINA BAĞLI YÜKLEME VE BOŞALTMA SÜRELERİNİN OLDUĞU KAPI ATAMA PROBLEMİ

Öz

Boşaltma ve yükleme süreleri, çapraz sevkiyatta kapı atama probleminde çok önemli bir rol oynar. Literatürde çapraz sevkiyatta kapı atama problemini ele alan çalışmaların çoğunluğunda bu sürelerin önceden bilindiği varsayılmaktadır. Ancak boşaltma ve yükleme süreleri, kapılara atanan işçilerin sayısına bağlı olarak değişmektedir. Bu nedenle, bu çalışmada çapraz sevkiyatta kamyonların kapılara atanması problemi, her kapıya kaç işçi atanacağının belirlenmesi problemi ile birlikte ele alınmıştır. Ele alınan problem için karma tamsayılı doğrusal bir matematiksel model geliştirilmiştir. Önerilen model, kapılara sabit sayıda işçinin atandığı iki farklı senaryo ile karşılaştırılmıştır. Modelin performansı literatürden alınan test problemleri kullanılarak gösterilmiştir. Elde edilen sonuçlar, kapılara uygun sayıda işçi atanmasının, işçi sayılarının sabit kabul edildiği senaryolara kıyasla amaç fonksiyonunun değerini ortalama Senaryo-1 için %3,14 ve Senaryo-2 için %4,02 oranında oranında iyileştirebildiğini ortaya koymuştur.

Anahtar Kelimeler

Çapraz sevkiyat, kapı atama problemi, işçi sayısına bağlı yükleme ve boşaltma süreleri

Kaynakça

• Acar, K., Yalçın, A. ve Yankov, D. (2012). Robust door assignment in less-than-truckload terminals. Computer and Industrial Engineering, 63 (4), 729-738. Doi: https://doi.org/10.1016/j.cie.2012.04.008
• Bartholdi, J. J. ve Gue, K. R. (2000). Reducing labor costs in an LTL cross docking terminal. Operations Research, 48 (6), 823–832. Doi: https://doi.org/10.1287/opre.48.6.823.12397
• Bartz-Beielstein, T., Chmielewski, A., Janas, M., Naujoks, B. ve Scheffermann, R. (2006). Optimizing door assignment in LTL terminals by evolutionary multiobjective algorithms. 2006 IEEE Congress on Evolutionary Computation. Doi: https://doi.org/10.1109/CEC.2006.1688288
• Bozer, Y.A. ve Carlo, H.J. (2008). Optimizing inbound and outbound door assignments in less-than-truckload cross docks. IIE Transactions, 40 (11), 1007–1018. Doi: https://doi.org/10.1080/07408170802167688
• Daquin, C., Allaoui, H., Goncalves, G. ve Hsu, T. (2021). Variable neighborhood search based algorithms for crossdock truck assignment. RAIRO Operations Research, 55, S2291-S2323. Doi: https://doi.org/10.1051/ro/2020087
• Enderer, F., Contardo, C. ve Contreras, I. (2017). Integrating dock-door assignment and vehicle routing with cross-docking. Computers and Operations Research, 88, 30-43. Doi: https://doi.org/10.1016/j.cor.2017.06.018
• Fatthi, W.N.A.W.A., Shuib, A. ve Dom, R. M. (2016). A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse. Journal of Industrial and Management Optimization, 12 (2), 431-447. Doi: http://dx.doi.org/10.3934/jimo.2016.12.431
• Gelareh, S., Glover, F., Guemri, O., Hanafi, S., Nduwayo, P. ve Todosijevic, R. (2020). A comparative study of formulations for a cross-dock door assignment problem. Omega, 91, 102015. Doi: https://doi.org/10.1016/j.omega.2018.12.004
• Ghomi, V., Ghazi Nezami, F., Shokoohyar, S. ve Ghofrani Esfahani, M. (2023). An optimization model for forklift utilization and congestion control in cross-docking terminals. International Journal of Systems Science: Operations & Logistics, 10(1), 2142463. Doi: https://doi.org/10.1080/23302674.2022.2142463
• Guemri, O., Nduwayo, P., Todosijevic, R., Hanafi, S. ve Glover, F. (2019). Probabilistic tabu search for the cross-docking assignment problem. European Journal of Operational Research, 277, 875-885. Doi: https://doi.org/10.1016/j.ejor.2019.03.030
• Guignard, M., Hahn, P.M., Pessoa, A.A. ve da Silva, D.C. (2012). Algorithms for the cross-dock door assignment problem. Proceedings of the Fourth International Workshop on Model-Based Metaheuristics, Rio de Janeiro, Brazil.
• Jarrah, A. I., Qi, X. ve Bard, J. F. (2014). The destination-loader-door assignment problem for automated package sorting centers. Transportation Science, 1–23. Doi: https://doi.org/10.1287/trsc.2014.0521
• Kinnear, E. (1997). Is there any magic in cross-docking? Supply Chain Management: An International Journal, 2, 49-52. Doi: https://doi.org/10.1108/13598549710166096
• Konur, D. ve Golias, M. M. (2017). Loading time flexibility in cross-docking systems. Procedia Computer Science, 114, 491-498. Doi: https://doi.org/10.1016/j.procs.2017.09.011
• Küçükoğlu, İ. ve Öztürk, N. (2017). Two-stage optimisation model for material flow and allocation management in cross-docking networks. International Journal of Production Research, 55 (2), 410-429. Doi: https://doi.org/10.1080/00207543.2016.1184346
• Ladier, A. ve Alpan, G. (2016). Cross-docking operations: Current research versus industry practice. Omega, 62, 145-162. Doi: https://doi.org/10.1016/j.omega.2015.09.006
• Lee, K., Kim, B.S. ve Joo, C.M., (2012), Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance, Expert Systems with Applications, 39, 12975–12983. Doi: https://doi.org/10.1016/j.eswa.2012.05.057
• Lim, A., Ma, H. ve Miao, Z. (2006). Truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks. In: Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. Doi: https://doi.org/10.1007/11751595_73
• Luo, G. ve Noble, J. S. (2012). An integrated model for crossdock operations including staging. International Journal of Production Research, 50, 2451-2464. Doi: https://doi.org/10.1080/00207543.2011.581007
• Miao, Z., Zhang, J., Lan, Y. ve Su, R. (2019). A two-stage genetic algorithm for the truck-door assignment problem with limited capacity vehicles and storage area. Journal of Systems Science and Systems Engineering, 28 (3), 285-298. Doi: https://doi.org/10.1007/s11518-019-5410-3
• Miao, Z., Cai, S. ve Xu, D. (2014). Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system. Expert Systems with Applications, 41(1), 16–22. Doi: https://doi.org/10.1016/j.eswa.2013.07.007
• Miao, Z., Lim, A. ve Ma, H. (2009). Truck dock assignment problem with operational time constraint within cross docks. European Journal of Operational Research, 192(1), 105–115. Doi: https://doi.org/10.1016/j.ejor.2007.09.031
• Nassief, W., Contreras, I. ve As’ad, R., (2016). A mixed-integer programming formulation and Lagrangean relaxation for the cross-dock door assignment problem. International Journal of Production Research, 54 (2), 494–508. Doi: https://doi.org/10.1080/00207543.2014.1003664
• Nassief, W., Contreras, I. ve Jaumard, B. (2018). A comparison of formulations and relaxations for cross-dock door assignment problems. Computers and Operations Research, 94, 76-88. Doi: https://doi.org/10.1016/j.cor.2018.01.022
• Oh, Y., Hwang, H., Cha, C.N. ve Lee, S., (2006). A dock-door assignment problem for the Korean mail distribution center. Computers & Industrial Engineering, 51 (2), 288–296. Doi: https://doi.org/10.1016/j.cie.2006.02.009
• Rijal, A., Marco, B. ve De Koster, R. (2019). Integrated scheduling and assignment of trucks at unit-loas cross-dock terminals with mixed service mode dock doors. European Journal of Operational Research, 278 (3), 752-771. Doi: https://doi.org/10.1016/j.ejor.2019.04.028
• Rosales, C. R., Fry, M. J. ve Radhakrishnan, R. (2009). Transfreight reduces costs and balances workload at georgetown crossdock. Interfaces, 39 (4), 316-328. Doi: https://doi.org/10.1287/inte.1090.0446
• Sayed, S. I., Contreras, I., Diaz, J. A. ve Luna, D. E. (2020). Integrated cross-dock door assignment and truck scheduling with handling times. TOP, 28, 705-727. Doi: https://doi.org/10.1007/s11750-020-00556-z
• Shakeri, M., Low, M. ve Zhengping, L. (2008). A generic model for cross dock truck scheduling and truck-to-door assignment problems. 6th IEEE International Conference on Industrial Informatics. Doi: https://doi.org/10.1109/INDIN.2008.4618221
• Torbalı, B. ve Alpan, G. (2023). A literature review on robust and real-time models for cross-docking. International Journal of Production Research, 61 (7), 2372–2401. Doi: https://doi.org/10.1080/00207543.2022.2062580
• Van Belle, J., Valckenaers, P. ve Cattrysse, D. (2012). Cross-docking: State of the art. Omega, 40, 827-846. Doi: https://doi.org/10.1016/j.omega.2012.01.005
• Wang, Z., Lu, Y., Zhao, L. ve Cao, N. (2018). Improved harmony search algorithm for truck scheduling problem in multiple-door cross-docking systems. Discrete Dynamics in Nature and Society, 1-15. Doi: https://doi.org/10.1155/2018/7913256
• Wisittipanich, W. ve Hengmeechai, P. (2015). A multi-objective differential evolution for just-in-time door assignment and truck scheduling in multi-door cross docking problems. Industrial Engineering & Management Systems, 14 (3), 299-311. Doi: http://dx.doi.org/10.7232/iems.2015.14.3.299
• Yu, V.F., Sharma, D. ve Murty, K.G. (2008). Door allocations to origins and destinations at less-than-truckload trucking terminals. Journal of Industrial and Systems Engineering, 2 (1), 1–15. Doi: https://dorl.net/dor/20.1001.1.17358272.2008.2.1.1.4
• Zhang, Y. H., Gong, Y. J. ve Chen, W. N. (2019). A dual-colony ant algorithm for the receiving and shipping door assignments in cross-docks. IEEE Transactions on Intelligent Transportation Systems, 20 (7), 2523-2539. Doi: https://doi.org/10.1109/TITS.2018.2867577