Provide a new formulation to precisely describe the first train transfer problem in mathematical terms.
The non-linear constraints of the model are linearized.
A heuristic algorithm is developed to solve the Beijing subway case with a local search method.
We observe that departure time constraints can be relaxed for the first train timetabling problem.