Last mile routing for LTL shipments
Keywords: Practical Vehicle Routing Problem, Time windows, Metaheuristics, Transportation, Less-than-truckload
Abstract: In this paper we consider a problem of last mile routing of LTL shipments based on our real life experience in route planning system development. The developed system processes over 100,000 transportation tasks across 300 cities daily. The goal of this paper is to combine the existing methods of route planning, adapt them for daily application, and add new constraints necessary for practical employment. The route planning system contains a risk model which fosters route stability over optimality. Experimental results, based on Homberger tests, demonstrate that the constructed algorithm performs remarkably well, with minimal deviations from best known solutions.
Submission Number: 43
Loading