Mathematical Models for On-Line Train Calendars Generation

In this paper we present a new model for train calendars textual generation, that is a method for automatically generating a text to customers in a concise and clear way with a service calendar represented by a boolean vector as its input. This problem arises in the transportation field, in particular in railway services. A new mathematical model which guarantees the optimality of solutions and good computational performances is described and tested on several real railway timetables, always obtaining optimal solutions. Moreover, it is extensively compared with existing models showing a significant reduction of computational times that makes it applicable in practical contexts.