TY - JOUR
T1 - An optimization model for forklift utilisation and congestion control in cross-docking terminals
AU - Ghomi, Vahid
AU - Ghazi Nezami, Farnaz
AU - Shokoohyar, Sina
AU - Ghofrani Esfahani, Mina
N1 - Publisher Copyright:
© 2022 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2023
Y1 - 2023
N2 - This study aims to optimize cross-docking (CD) performance and efficiency in CD assignment problems by maximising forklift utilisation inside the terminal. ‘We present a new Mixed-Integer Nonlinear programming (MINLP)’ model that considers truck-door assignment and forklift utilisation inside the airport. One objective is to enhance the quality of truck-door by minimising the total transshipment costs, including the penalty cost associated with forklift underutilisation, the total forklift travel distance cost, and the total weighted loading unloading and operator cost. Another objective is to control the forklift congestion by minimising the total number of forklifts needed to transfer products between multiple doors inside the terminal. Two algorithms, including the tabu-search and the best-local-point-finder, are proposed to accomplish these objectives. Our computational results show the advantage of the proposed algorithms over the CPLEX commercial solver.
AB - This study aims to optimize cross-docking (CD) performance and efficiency in CD assignment problems by maximising forklift utilisation inside the terminal. ‘We present a new Mixed-Integer Nonlinear programming (MINLP)’ model that considers truck-door assignment and forklift utilisation inside the airport. One objective is to enhance the quality of truck-door by minimising the total transshipment costs, including the penalty cost associated with forklift underutilisation, the total forklift travel distance cost, and the total weighted loading unloading and operator cost. Another objective is to control the forklift congestion by minimising the total number of forklifts needed to transfer products between multiple doors inside the terminal. Two algorithms, including the tabu-search and the best-local-point-finder, are proposed to accomplish these objectives. Our computational results show the advantage of the proposed algorithms over the CPLEX commercial solver.
UR - http://www.scopus.com/inward/record.url?scp=85143408345&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85143408345&partnerID=8YFLogxK
U2 - 10.1080/23302674.2022.2142463
DO - 10.1080/23302674.2022.2142463
M3 - Article
AN - SCOPUS:85143408345
SN - 2330-2674
VL - 10
JO - International Journal of Systems Science: Operations and Logistics
JF - International Journal of Systems Science: Operations and Logistics
IS - 1
M1 - 2142463
ER -