Cross dock scheduling with fixed outbound trucks departure times under substitution condition

Tootkaleh, S. Rahmanzadeh; Ghomi, S. M. T. Fatemi; Sajadieh, Mohsen S.

doi:10.1016/j.cie.2015.12.005

Cited by 29 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In reality, staging limitations around dock doors necessitate products to be moved to a temporary storage area when an inbound truck is unloaded before the corresponding outbound truck is docked at an outbound door (Rijal et al, 2019). Tootkaleh et al (2016) explicitly modelled the storage of products in a separate area when products of an inbound truck arrive after the outbound truck has already left the CD terminal due to a departure deadline. Tarhini et al (2016) presented a scatter search and a genetic algorithm to deal with CDAP based on the problem defined by Tsui and Chang (1990).…”

Section: Literature Reviewmentioning

confidence: 99%

An optimisation model to increase the cross-dockings operational utilisation

Ghomi,

Nezami,

Shokoohyar

et al. 2024

IJLSM

View full text Add to dashboard Cite

Introducing a new version of a cross-docking assignment problem when forklifts carry bulk materials, we address an operational solution to reduce the impact of forklifts congestion in centre of terminals. We develop a mixed-integer bilinear programming model, a Tabu-search algorithm, where the main objective of the model is still to minimize the total transshipment costs, and additionally trying to minimize the weighted forklifts travelled distance (WTD) and the weighted unloading/loading labour costs at inbound and outbound doors (WLC). We hypothesize that longer WTD could shift the location of weighted forklift congestion concentration from the centre of the terminal toward the sides. We assuming four cost pattern's distributions, all are supposed to lead high flows to doors with low labour costs, which ultimately impact the total WTD, WLC, and TTC. The proposed Tabu-search outperform CPLEX by finding a set of a diverse and high-quality solution within a reasonable computing time.V. Ghomi et al.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An optimisation model to increase the cross-dockings operational utilisation

Ghomi,

Nezami,

Shokoohyar

et al. 2024

IJLSM

View full text Add to dashboard Cite

show abstract

The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds

Bugow

Kellenbrink

2023

OR Spectrum

View full text Add to dashboard Cite

We investigate a specific truck scheduling problem at cross-docks in the postal service industry on an operational level aiming to maximise the number of duly parcels assuming fixed departure times of the outbound trucks. The inbound gates and the conveyors as means of transportation inside the hub constitute the bottleneck resources. As a novel extension, we propose flexible unloading speeds to efficiently utilise the scarce resources. We formalise the problem with a mixed integer program and explicitly incorporate controllable unloading speeds of the inbound trucks. We determine the computational complexity and develop a genetic algorithm to efficiently solve the problem. Our investigation focuses on both the performance of the genetic algorithm and the applicability of the results in a real-world environment by implementing scheduling policies in a simulation model that considers individual parcel interactions. Based on our experimental results, we can state that especially in problem settings with scarce conveyor capacities, our approach to incorporate controllable unloading speeds has the potential of significantly increasing the number of duly parcels.

show abstract