This paper describes a new approach for train calendars textual generation, that is a heuristic algorithm designed to automatically generate a text to final customers, concisely and clearly, from a service calendar represented by a boolean vector as input. This niche problem belongs to the transportation field, specifically, to railway services. The new heuristic algorithm, developed in the C programming language, guarantees a constant computation time, between 0 and 16 ms. Tested on several real railway timetables, this new approach was extensively compared with existing mathematical programming models presented in Amorosi et al. (2019), with a significant reduction of computation times that makes it applicable in practical contexts.
Bosi, T., D'Ariano, A., Amorosi, L., Giacco, G.L. (2021). A fast and effective greedy heuristic for on-line train calendars generation. In 2021 7th International Conference on Models and Technologies for Intelligent Transportation Systems, MT-ITS 2021 (pp. 1-6). Institute of Electrical and Electronics Engineers Inc. [10.1109/MT-ITS49943.2021.9529280].
A fast and effective greedy heuristic for on-line train calendars generation
Bosi T.;D'Ariano A.;
2021-01-01
Abstract
This paper describes a new approach for train calendars textual generation, that is a heuristic algorithm designed to automatically generate a text to final customers, concisely and clearly, from a service calendar represented by a boolean vector as input. This niche problem belongs to the transportation field, specifically, to railway services. The new heuristic algorithm, developed in the C programming language, guarantees a constant computation time, between 0 and 16 ms. Tested on several real railway timetables, this new approach was extensively compared with existing mathematical programming models presented in Amorosi et al. (2019), with a significant reduction of computation times that makes it applicable in practical contexts.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
