Formulation and Solution of the Stochastic Truck and Trailer Routing Problem

In manufacturing and service industries, transportation often faces uncertain conditions. While current research on the truck and trailer routing problem (TTRP) mostly uses deterministic methods, they fall short in addressing uncertainties in travel and service times. This study aims to improve TTRP models by incorporating randomness in travel and service durations and specific time windows, better mirroring real-world scenarios. The enhanced model uses the multipoint simulated annealing (M-SA) method for practical application. The study involves 144 benchmark instances across six levels, starting with generating feasible solutions, then refining them using M-SA. A stochastic programming model with recourse (SPR) was used for problem formulation. Sensitivity analysis assessed the impact of various parameters and compared solutions obtained from M-SA and the analysis, showing minimal differences and thus the effectiveness of the proposed algorithm in solving the stochastic TTRP. The paper concludes with suggestions for future research.