Cross-docking truck scheduling with product unloading/loading constraints based on an improved particle swarm optimisation algorithm. Issue 16 (18th August 2018)

• Record Type: Journal Article
• Authors: Ye, Yan; Li, Jingfeng; Li, Kaibin; Fu, Hui
• Is Part Of: International journal of production research. Volume 56:Issue 16(2018)
• Page Start: 5365
• Page End: 5385
• Publication Date: 2018-08-18
• Subjects: cross docking -- scheduling -- particle swarm optimisation -- inbound and outbound trucks -- product handling constraint; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2018.1464678
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : Cross-docking is a very useful logistics technique that can substantially reduce distribution costs and improve customer satisfaction. A key problem in its success is truck scheduling, namely, decision on assignment and docking sequence of inbound/outbound trucks to receiving/shipping dock doors. This paper focuses on the problem with the requirement of unloading/loading products in a given order, which is very common in many industries, but is less concerned by existing researches. An integer programming model is established to minimise the makespan. An improved particle swarm optimisation (ωc-PSO) algorithm is proposed for solving it. In the algorithm, a cosine decreasing strategy of inertia weight is designed to dynamically balance global and local search. A repair strategy is put forward for continuous search in the feasible solution space and a crossover strategy is presented to prevent the algorithm from falling into local optimum. After algorithm parameters are tuned using Taguchi method, computational experiments are conducted on different problem scales to evaluate ωc-PSO against genetic algorithm, basic PSO and GLNPSO. The results show that ωc-PSO outperforms other three algorithms, especially when the number of dock doors, trucks and product types is great. Statistical tests show that the performance difference is statistically significant.