LAUSR

In cross docking network, multiple products from multiple origins are transferred by trucks through one or more cross docks. One critical concern is the decision on how to synchronise product transshipment through multiple cross docks to achieve timely shipment. This paper presents a mathematical model of truck scheduling problem in cross docking network in order to minimise makespan. Since the problem is NP-hard, a solution method is developed based on particle swarm optimisation (PSO) with two solution representations: randomised truck solution representation (Ra-SR) and prioritised truck solution representation (Pr-SR). The results show that the PSO-based approach performs well in solving the problem. Both solution representations are proven effective when comparing the solution quality and computational time with optimal results obtained from LINGO. However, the Pr-SR yields superior results to the Ra-SR in terms of solution quality and convergence behaviour for most instances especially in the case of large-size problems.