A novel approach for the railway undertaking pre-arranged paths optimization

This paper describes a new framework and mixed-integer linear-programming formulation for solving railway undertaking pre-arranged paths (PAP) optimization problem. Nowadays this is a key problem in railway timetable planning that requires discovering commercial opportunities making path requests starting from partial routes that belong to several PAP catalogues (PC). The overall...