A Hybrid Genetic Algorithm for Integrated Truck Scheduling and Product Routing on the Cross-Docking System with Multiple Receiving and Shipping Docks

In this research, a truck scheduling problem for a cross-docking system with multiple receiving and shipping docks is studied. Until recently, single-dock cross-docking problems are studied mostly. This research is focused on the multiple-dock problems. The objective of the problem is to determine the best docking sequences of inbound and outbound trucks to the receiving and shipping docks, respectively, which minimize the maximal completion time. We propose a new hybrid genetic algorithm to solve this problem. This genetic algorithm improves the solution quality through the population scheme of the nested structure and the new product routing heuristic. To avoid unnecessary infeasible solutions, a linked-chromosome representation is used to link the inbound and outbound truck sequences, and locus-pairing crossovers and mutations for this representation are proposed. As a result of the evaluation of the benchmark problems, it shows that the proposed hybrid GA provides a superior solution compared to the existing heuristics.

Adaptive memory red deer algorithm for cross-dock truck scheduling with products time window

Purpose The cross-docking strategy has a significant influence on supply chain and logistics efficiency. This paper aims to investigate the most suitable and efficient way to schedule the transfer of logistics activities and present a meta-heuristic method of the truck scheduling problem in cross-docking logistics. A truck scheduling problem with products time window is investigated with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks. Design/methodology/approach This research proposed a meta-heuristic method for the truck scheduling problem with products time window. To solve the problem, a lower bound of the problem is built through a novel two-stage Lagrangian relaxation problem and on account of the NP-hard nature of the truck scheduling problem, the novel red deer algorithm with the mechanism of the heuristic oscillating local search algorithm, as well as adaptive memory programming was proposed to overcome the inferior capability of the original red deer algorithm in the aspect of local search and run time. Findings Theory analysis and simulation experiments on an industrial case of a cross-docking center with a product’s time window are conducted in this paper. Satisfactory results show that the performance of the red deer algorithm is enhanced due to the mechanism of heuristic oscillating local search algorithm and adaptive memory programming and the proposed method efficiently solves the real-world size case of truck scheduling problems in cross-docking with product time window. Research limitations/implications The consideration of products time window has very realistic significance in different logistics applications such as cold-chain logistics and pharmaceutical supply chain. Furthermore, the novel adaptive memory red deer algorithm could be modified and applied to other complex optimization scheduling problems such as scheduling problems considering energy-efficiency or other logistics strategies. Originality/value For the first time in the truck scheduling problem with the cross-docking strategy, the product’s time window is considered. Furthermore, a mathematical model with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks is developed. To solve the proposed problem, a novel adaptive memory red deer algorithm with the mechanism of heuristic oscillating local search algorithm was proposed to overcome the inferior capability of genetic algorithm in the aspect of local search and run time.