Abstract
The paper deals with a truck scheduling and transshipment problem in a cross-docking terminal, with one inbound gate and one outbound gate. Each inbound truck carries one or more load units possibly of different commodities, and each outbound truck must be loaded with different commodities as well. The problem is to define the sequence of trucks at the inbound and outbound gates and the transshipment plan, so as to minimize the makespan of the whole process. We propose a Lagrangian relaxation scheme and a dual ascent method to optimize the Lagrangian dual that encloses three heuristics aimed at recovering feasible solutions for the problem at hand from the solution of the Lagrangian problem. Computational experiments are also provided, in order to evaluate the effectiveness of the Lagrangian approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and materials
All the instances and the detailed result tables are available online at https://sites.google.com/icar.cnr.it/softcompcd/home.
References
Balinski ML (1961) Fixed-cost transportation problems. Naval Res Logist Q 8(1):41–54. https://doi.org/10.1002/nav.3800080104
Boysen N, Fliedner M (2010) Cross dock scheduling: classification, literature review and research agenda. Omega 38(6):413–422. https://doi.org/10.1016/j.omega.2009.10.008
Buijs P, Vis IF, Carlo HJ (2014) Synchronization in cross-docking networks: a research classification and framework. Eur J Oper Res 239(3):593–608. https://doi.org/10.1016/j.ejor.2014.03.012
Chen F, Lee CY (2009) Minimizing the makespan in a two-machine cross-docking flow shop problem. Eur J Oper Res 193(1):59–72. https://doi.org/10.1016/j.ejor.2007.10.051
Chiarello A, Gaudioso M, Sammarra M (2018) Truck synchronization at single door cross-docking terminals. OR Spectrum 40(2):395–447. https://doi.org/10.1007/s00291-018-0510-x
Fisher ML (1981) The lagrangian relaxation method for solving integer programming problems. Manage Sci 27(1):1–18. https://doi.org/10.1287/mnsc.27.1.1
Fisk J, McKeown P (1979) The pure fixed charge transportation problem. Naval Res Logist Q 26(4):631–641. https://doi.org/10.1002/nav.3800260408
Fonseca GB, Nogueira TH, Ravetti MG (2019) A hybrid lagrangian metaheuristic for the cross-docking flow shop scheduling problem. Eur J Oper Res 275(1):139–154. https://doi.org/10.1016/j.ejor.2018.11.033
Gaudioso M (2020) A view of lagrangian relaxation and its applications. In: Bagirov AM, Gaudioso M, Karmitsa N, Mäkelä MM, Taheri S (eds) Numerical nonsmooth optimization: state of the art algorithms. Springer, Cham, pp 579–617. https://doi.org/10.1007/978-3-030-34910-3_17
Gaudioso M, Monaco MF, Sammarra M (2018) A decomposition-based heuristic for the truck scheduling problem in a cross-docking terminal. In: Daniele P, Scrimali L (eds) New trends in emerging complex real life problems: ODS, Taormina, Italy, September 10–13, 2018, Springer International Publishing, Cham. pp 265–273. https://doi.org/10.1007/978-3-030-00473-6_29
Gaudioso M, Monaco MF, Sammarra M (2021) A lagrangian heuristics for the truck scheduling problem in multi-door, multi-product cross-docking with constant processing time. Omega 101:102255. https://doi.org/10.1016/j.omega.2020.102255
Hirsch W, Dantzig G (1954) The fixed charge transportation problem. Rand Corporation, Santa Monica, California, Memo
Hirsch WM, Dantzig GB (1968) The fixed charge problem. Nav Res Logist Q 15(3):413–424. https://doi.org/10.1002/nav.3800150306
Ladier AL, Alpan G (2016) Cross-docking operations: current research versus industry practice. Omega 62:145–162. https://doi.org/10.1016/j.omega.2015.09.006
Monaco MF, Sammarra M (2020) Managing loading and discharging operations at cross-docking terminals. Procedia Manuf 42:475–482. https://doi.org/10.1016/j.promfg.2020.02.045
Rijal A, Bijvank M, de Koster R (2019) Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors. Eur J Oper Res 278(3):752–771. https://doi.org/10.1016/j.ejor.2019.04.028
Shahmardan A, Sajadieh MS (2020) Truck scheduling in a multi-door cross-docking center with partial unloading and reinforcement learning-based simulated annealing approaches. Comput Ind Eng 139:106134. https://doi.org/10.1016/j.cie.2019.106134
Tadumadze G, Boysen N, Emde S, Weidinger F (2019) Integrated truck and workforce scheduling to accelerate the unloading of trucks. Eur J Oper Res 278(1):343–362. https://doi.org/10.1016/j.ejor.2019.04.024
Theophilus O, Dulebenets MA, Pasha J, yip Lau Y, Fathollahi-Fard AM, Mazaheri A (2021) Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations. Comput Ind Eng 156:107240. https://doi.org/10.1016/j.cie.2021.107240
Van Belle J, Valckenaers P, Cattrysse D (2012) Cross-docking: state of the art. Omega 40(6):827–846. https://doi.org/10.1016/j.omega.2012.01.005
Wolff P, Emde S, Pfohl HC (2021) Internal resource requirements: the better performance metric for truck scheduling? Omega, p 102431. https://doi.org/10.1016/j.omega.2021.102431
Funding
The research has been supported by Ministero dell’Istruzione, Università e Ricerca under the PRIN 2015 research program - Grant 2015XAPRKF - SPORT: Smart PORt Terminals.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Human and animal rights
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by Anna Sciomachen.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Monaco, M.F., Sammarra, M. A multiplier adjustment algorithm for a truck scheduling and transshipment problem at a cross-docking terminal. Soft Comput 27, 4169–4193 (2023). https://doi.org/10.1007/s00500-022-06999-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-022-06999-9