A Quadratic Programming for Truck-to-Door Assignment Problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32797
A Quadratic Programming for Truck-to-Door Assignment Problem

Authors: Y. Fathi, B. Karimi, S. M. J. Mirzapour Al-e-Hashem

Abstract:

Cross-docking includes receiving products supplied by a set of suppliers, unloading them from inbound trucks (ITs) at strip doors, consolidating and handling these products to stack doors based on their destinations, loading them into outbound trucks (OTs); then, delivering these products to customers. An effective assignment of the trucks to the doors would enhance the advantages of the cross-docking (e.g. reduction of the handling costs). This paper addresses the truck-to-door assignment problem in a cross-dock in which assignment of the ITs to the strip doors as well as assignment of the OTs to the stacks doors is determined so that total material handling cost in the cross-dock is minimized. Capacity constraints are applied for the ITs, OTs, strip doors, and stack doors. We develop a Quadratic Programming (QP) to formulate the problem. To solve it, the model is coded in LINGO software to specify the best assignment of the trucks to the doors.

Keywords: Cross-docking, truck-to-door assignment, supply chain, quadratic programming.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1126249

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1674

References:


[1] Van Belle, J., Valckenaers, P., & Cattrysse, D. (2012). Cross-docking: State of the art. Omega, 40(6), 827-846.
[2] Peck, K. E. (1983). Operational analysis of freight terminals handling less than container load shipments (No. 83-09998 UMI).
[3] Tsui, L. Y., & Chang, C. H. (1990). A microcomputer based decision support tool for assigning dock doors in freight yards. Computers & Industrial Engineering, 19(1), 309-312.
[4] Tsui, L. Y., & Chang, C. H. (1992). An optimal solution to a dock door assignment problem. Computers & Industrial Engineering, 23(1-4), 283-286.
[5] Bermudez, R., & Cole, M. H. (2000). A genetic algorithm approach to LTL breakbulk terminal door assignment. In Proceedings of the 2000 industrial engineering research conference.
[6] Oh, Y., Hwang, H., Cha, C. N., & Lee, S. (2006). A dock-door assignment problem for the Korean mail distribution center. Computers & Industrial Engineering, 51(2), 288-296.
[7] Bozer, Y. A., & Carlo, H. J. (2008). Optimizing inbound and outbound door assignments in less-than-truckload cross docks. IIE Transactions, 40(11), 1007-1018.
[8] Zhu, Y. R., Hahn, P. M., Liu, Y., & Guignard, M. (2009, September). New approach for the cross-dock door assignment problem. In in Proceedings of the XLI Brazilian Symposium on Operations Research.
[9] Cohen, Y., & Keren, B. (2009). Trailer to door assignment in a synchronous cross-dock operation. International Journal of Logistics Systems and Management, 5(5), 574-590.
[10] Guignard, M., Hahn, P. M., Pessoa, A. A., & da Silva, D. C. (2012). Algorithms for the cross-dock door assignment problem. In Proceedings of the Fourth International Workshop on Model-Based Metaheuristics.
[11] Nassief, W., Contreras, I., & 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.