Static Pre-Scheduling for ICD Drayage Operations via Task Pooling and Enhanced Adaptive Large Neighborhood Search

Static pre-scheduling in inland container depot (ICD)-centered drayage must coordinate tractors, detachable load units, factory loading, and port deadlines before next-day execution. Conventional order-based routing is too rigid for mixed direct haulage, drop-and-pull, relay pickup, street-turn, and buffering operations. This study proposes a task-pooling framework that decomposes logistics orders into atomic tasks and recombines them across tractors in a unified static planning space. A compact route-based MILP is used for reduced-scale calibration, and an enhanced adaptive large neighborhood search (E-ALNS) is developed around ICD-oriented relay recombination and temporal-slack shifting. On a realistic synthetic benchmark with 100 generated order records (90 active executable orders), 60 available tractors, and 330 executable tasks, the proposed method reduces the internal search-ledger value from 42,213.29 to 34,421.22 and the compact ex post blueprint value from 53,802.28 to 47,717.99 relative to the greedy construction baseline. The resulting blueprint preserves an average inter-task slack of 89.86 min and a 5th-percentile slack of 61.73 min. A generic adaptive-neighborhood baseline reaches a slightly lower ex post value of 46,722.48 only with a longer runtime and much lower temporal reserve. The results support a cost–reserve–runtime tradeoff interpretation rather than unconditional cost dominance.