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.
A Fast and Effective Greedy Heuristic for On-line Train Calendars Generation
2021-06-16
5911948 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Research on Greedy Train Rescheduling Algorithm
British Library Conference Proceedings | 2009
|An Effective Meta-Heuristic Technique for Solving Train Scheduling Problem
British Library Conference Proceedings | 2007
|An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
Online Contents | 2010
|An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
British Library Online Contents | 2010
|