关键词: 铁路运输, 列车时刻表, Benders分解, 集装箱运输, 线性混合整数规划

Abstract:

This study proposes a linear mixed integer programming model for the container train timetables to minimize the total tardiness of deliveries. The assignment between the container goods and the container trains is fully considered in terms of time and quantity. An approach based on Benders decomposition is developed to convert the model into a master problem of assignment scheme of container goods to trains as well as a timetabling subproblem. The cuts of the master problem are constantly generated by solving the dual subproblem. To overcome the disadvantage of low efficiency of the cut, an improved strategy is also proposed to produce multiple cuts and add them to the master problem in each iteration. A numerical example is provided to demonstrate the effectiveness of the model and algorithm. The results indicate that the improved strategy increases the calculation efficiency of the algorithm. The train timetables obtained by the proposed model and algorithm match well with the distribution of the quantity and times of the goods; the generated train timetables well meet the user demand.

Key words: railway transportation, train timetable, Benders decomposition, container transport, linear mixed integer programming