The Transportation Scheduling Optimization Of Guangzhou Sinotrans Logistics

The topic of this article comes from Guangzhou Sinotrans Logistics Company. Based onthe literature research of the development of transport scheduling problem and the analysis ofthird-party Logistics Company’s vehicle scheduling situations，we first proposed that the mosturgent scheduling problem was vehicle scheduling problem as known as vehicle routingproblem. Then a thorough investigation was conducted based on the present schedulingprocess，the utilization of scheduling tools and the performance in the company. According tothis analysis，we found the major problem is to improve the occupancy of the vehicles. Thuson the basis of Sinotrans scheduling scenarios，we built mathematic models to solve theVRPTW problem with single distribution center and multi-vehicle non-fully loaded.Compared to the traditional vehicle routing problem with time windows，the model weestablished is improved in time window constraints and more concerned about the vehicleutilization and customer satisfaction. For large-scale computing，a Tabu search algorithm isdesigned with the use of the variable neighborhood search algorithm for reference and testedwith the Benchmark instances. Finally, we verified our method based on the actual data fromthe field study of Sinotrans transportation scheduling. Through the comparison of theachievement of the target before and after the application of the optimization method，we cansee the remarkable improvement in the scheduling performance.