ÇAPRAZ SEVKİYATTA BÜTÜNLEŞİK KAPI ATAMA VE KAMYON ÇİZELGELEME PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL

Yıl 2024, Cilt: 35 Sayı: 3, 354 - 377

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

Öz

Çapraz sevkiyat, farklı tedarikçilerden gelen ürünlerin bir depoda sevkiyat noktalarına göre birleştirilerek genelde 24 saat içinde sevk edildiği depolama sürecidir. Bu işlemlerin gerçekleştirildiği merkezlerde, kamyonların hangi kapılara hangi sırada atandığı, işlemlerin tamamlanma zamanlarını oldukça etkileyen bir karardır. Bu nedenle literatürde, kamyonların kapılara atanması ve çizelgelenmesi problemi (KKAÇP) sıklıkla ele alınmıştır. Ancak bu çalışmalarda genellikle kapılara atanacak işçi sayısı ve kapıların hangi tip kamyonlara hizmet verebileceği konuları göz ardı edilmiştir. Bu çalışmada ilk defa kapılara atanacak işçi sayılarının ve hem gelen kamyonlara hem de giden kamyonlara hizmet verebilen karma kapıların dikkate alındığı bütünleşik KKAÇP ele alınmıştır. Ele alınan problemin çözümü için bir matematiksel model önerilmiştir. Önerilen modelin performansı rassal türetilen test problemleri kullanılarak gösterilmiştir. Elde edilen sonuçlar, önerilen çözüm yaklaşımı ile son işin tamamlanma zamanının klasik yaklaşıma göre ortalama %52 oranında iyileştiğini ortaya koymuştur.

Anahtar Kelimeler

Çapraz sevkiyat, kapı atama, çizelgeleme

Kaynakça

• Acar, K., Yalcin, A. ve Yankov, D. (2012). Robust door assignment in less-than-truckload terminals. Computers & Industrial Engineering, 63(4), 729-738. Doi: https://doi.org/10.1016/j.cie.2012.04.008
• Dondo, R. ve Cerdá, J. (2015). The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system. Computers & Chemical Engineering, 76, 42-62. Doi: https://doi.org/10.1016/ j.compchemeng.2015.02.003
• Enderer, F., Contardo, C. ve Contreras, I. (2017). Integrating dock-door assignment and vehicle routing with cross-docking. Computers & Operations Research, 88, 30-43. Doi: https://doi.org/10.1016/j.cor.2017.06.018
• Escudero, L. F., Garín, M. A. ve Unzueta, A. (2024). On solving the cross-dock door assignment problem. International Journal of Production Research, 62(4), 1262-1276. Doi: https://doi.org/10.1080/00207543.2023.2180307
• Essghaier, F., Allaoui, H. ve Goncalves, G. (2021). Truck to door assignment in a shared cross-dock under uncertainty. Expert Systems with Applications, 182, 114889. Doi: https://doi.org/10.1016/j.eswa.2021.114889
• Gallo, A., Accorsi, R., Akkerman, R. ve Manzini, R. (2022). Scheduling cross-docking operations under uncertainty: A stochastic genetic algorithm based on scenarios tree. EURO Journal on Transportation and Logistics, 11, 100095. Doi: https://doi.org/10.1016/j.ejtl.2022.100095
• Gelareh, S., Glover, F., Guemri, O., Hanafi, S., Nduwayo, P. ve Todosijević, 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 utilisation 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
• 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.
• Hermel, D., Hasheminia, H., Adler, N. ve Fry, M. J. (2016). A solution framework for the multi-mode resource-constrained cross-dock scheduling problem. Omega, 59, 157-170. Doi: https://doi.org/10.1016/ j.omega.2015.06.002
• 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
• Li, Y., Tang, R. Y., MuRong, L. W. ve Sun, Q. (2020). Collaborative Optimization of Dock Door Assignment and Vehicle Scheduling in Cross-Docking. Journal of the Operations Research Society of China, 8, 493-514. Doi: https://doi.org/10.1007/s40305-019-00266-9
• Li, M., Hao, J. K. ve Wu, Q. (2024). A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment. European Journal of Operational Research, 312(2), 473-492. Doi: https://doi.org/10.1016/j.ejor.2023.07.014
• 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, 285-298. Doi: https://doi.org/10.1007/s11518-019-5410-3
• Monemi, R. N., Gelareh, S. ve Maculan, N. (2023). A machine learning based branch-cut-and-Benders for dock assignment and truck scheduling problem in cross-docks. Transportation Research Part E: Logistics and Transportation Review, 178, 103263. Doi: https://doi.org/10.1016/j.tre.2023.103263
• Monemi, R. N., Gelareh, S. ve Maculan, N. (2024). Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic. Computers & Operations Research, 167, 106604. Doi: https://doi.org/10.1016/j.cor.2024.106604
• Monemi, R. N., Gelareh, S., Maculan, N. ve Chen, W. K. (2024). A neural branch-and-price for truck scheduling in cross-docks. Science China Mathematics, 67, 1341–1358. Doi: https://doi.org/10.1007/s11425-024-2301-9
• 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 & 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
• Ozden, G. ve Saricicek, I. (2019). Scheduling trucks in a multi-door cross-docking system with time windows. Bulletin of the Polish Academy of Sciences. Technical Sciences, 67(2). Doi: https://doi.org/10.24425/bpas.2019.128113
• Rijal, A., Bijvank, M. ve de Koster, R. (2019). Integrated scheduling and assignment of trucks at unit-load 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
• 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
• Tadumadze, G., Boysen, N., Emde, S. ve Weidinger, F. (2019). Integrated truck and workforce scheduling to accelerate the unloading of trucks. European Journal of Operational Research, 278(1), 343-362. Doi: https://doi.org/10.1016/j.ejor.2019.04.024
• Tarhini, A. A., Yunis, M. M. ve Chamseddine, M. (2016). Natural optimization algorithms for the cross-dock door assignment problem. IEEE Transactions on intelligent transportation systems, 17(8), 2324-2333. Doi: https://doi.org/10.1109/TITS.2016.2519104
• Van Belle, J., Valckenaers, P., Berghe, G. V. ve Cattrysse, D. (2013). A tabu search approach to the truck scheduling problem with multiple docks and time windows. Computers & Industrial Engineering, 66(4), 818-826. Doi: https://doi.org/10.1016/j.cie.2013.09.024
• Wang, H. ve Alidaee, B. (2019). The multi-floor cross-dock door assignment problem: Rising challenges for the new trend in logistics industry. Transportation Research Part E: Logistics and Transportation Review, 132, 30-47. Doi: https://doi.org/10.1016/j.tre.2019.10.006
• 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 and Management Systems, 14(3), 299-311. Doi: http://dx.doi.org/10.7232/iems.2015.14.3.299
• Xi, X., Changchun, L., Yuan, W. ve Hay, L. L. (2020). Two-stage conflict robust optimization models for cross-dock truck scheduling problem under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 144, 102123. Doi: https://doi.org/10.1016/j.tre.2020.102123
• Zhang, Y. H., Gong, Y. J., Chen, W. N., Gu, T. L., Yuan, H. Q. ve Zhang, J. (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