Crossdock truck scheduling with time windows: earliness, tardiness and storage policies

Abstract

International audienceThis article proposes to simultaneously plan inbound and outbound truck arrivals and departures in a cross-docking platform, as well as the internal pallet handling. The objective is to minimize both the total number of pallets put in storage and the dissatisfaction of the transportation providers, by creating a truck schedule as close as possible to the wished schedule they communicate in advance. The problem is modeled with an integer program tested on generated instances to assess its performance, especially regarding the computation time. The problem is proven to be np-hard in the strong sense. Since the execution takes too long to be used on a daily basis by platform managers, three heuristics are also proposed and tested. Two are based on integer programs solved sequentially, the third one is a tabu search in which the storage part of the objective function is evaluated by a maximum flow model in a graph. Numerical experiments show in which conditions each heuristic performs best, which can help choosing a solution method when confronted to a real-life problem

Cross-docking operations: Current research versus industry practice

“…It also determines on which door exactly each truck is processed. Polynomial algorithm [34], [72], [103], [130], [131] Mathematical programming [1], [2], [4], [9], [17], [25], [28], [29], [32], [33], [35], [36], [43], [44], [46], [47], [63], [70], [71], [81], [82], [86], [87], [90], [92], [95], [97], [98], [99], [100], [101], [105], [108], [109], [110], [112], [116], [119], [123], [124], [129], [138], [139], [141], ...…”

A hybrid Approach in Metaheuristics for a Cross-dock Scheduling Considering Time Windows and Deadline for Trucks Departure

“…8. Average value obtained by the algorithm List of Tables: Table 1 Solution method of the related studies to this paper Table 2 Parameters and their level in SA Table 3 Parameters and their level in DE Table 4 Parameters and their level in KA Table 5 Parameters and their level in KA-SA Table 6 Parameters and their best level for each algorithm Table 7 Information of test problems Table 8 Best and average value obtained by metaheuristic algorithms Tables: Table 1 Solution method of the related studies to this paper Paper(s) Method Exact Heuristic Metaheuristic Yu and Egbelu [11]   Chen and Song [34]   Boysen [13]   Soltani and Sadjadi [35]   Boysen et al [36]  Forouharfard and Zandieh [37]  Larbi et al [38]   Arabani et al [39]   Shakeri et al [40]  Berghman et al [41]  Davoudpour et al [42]  Sadykov [43]  Boysen et al [44]    Van Belle et al [45]   Bjelić et al [46]  Joo and Kim [47]  Konur and Golias [48]   Ladier and Alpan [49]   Ladier and Alpan [50]    Madani-Isfahani et al [51]  Amini et al [52]   Mohtashami et al [53]  Golshahi-Roudbaneh et al [16]   Khalili-Damghani et al [54]   Wisittipanich and Hengmeechai [55]  Mohammadzadeh et al [19]  Moteghedi-Larijani and Aminnayeri [18]   Beniamerian et al [20] …”

Truck Scheduling at Cross-Docking Terminals: A Follow-Up State-Of-The-Art Review

“…Ladier and Alpan [36] focused on the truck scheduling problem at a CDT. The authors modeled the internal pallet handling within the considered CDT.…”