Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation
An important objective for train operating companies is to let users, especially commuters, directly query the ICT system about trains’ availability calendar, based on an online approach, and give them clear and brief information, expressed through “intelligent” phrases instead of bit maps. This pap...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2021/4664010 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849472717277888512 |
|---|---|
| author | Tommaso Bosi Andrea D’Ariano |
| author_facet | Tommaso Bosi Andrea D’Ariano |
| author_sort | Tommaso Bosi |
| collection | DOAJ |
| description | An important objective for train operating companies is to let users, especially commuters, directly query the ICT system about trains’ availability calendar, based on an online approach, and give them clear and brief information, expressed through “intelligent” phrases instead of bit maps. This paper provides a linear programming model of this problem and a fast and flexible heuristic algorithm to create descriptive sentences from train calendars. The algorithmic method, based on the “Divide and Conquer” approach, takes the calendar period queried in its whole and divides it into subsets, which are successively processed one by one. The dominant limitation of previous methods is their strong dependence on the size and complexity of instances. On the contrary, our computational findings show that the proposed online algorithm has a very limited and constant computation time, even when increasing the problem complexity, keeping its processing time between 0 and 16 ms, while producing good quality solutions that differ by an average surplus of 0.13 subsentences compared to benchmark state-of-art solutions. |
| format | Article |
| id | doaj-art-dab58b48e616450fb8fd68e96dc6152f |
| institution | Kabale University |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-dab58b48e616450fb8fd68e96dc6152f2025-08-20T03:24:26ZengWileyJournal of Advanced Transportation0197-67292042-31952021-01-01202110.1155/2021/46640104664010Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar GenerationTommaso Bosi0Andrea D’Ariano1Dipartimento Di Ingegneria, Sezione Di Computer Science and Automation, Università Degli Studi Roma Tre, Via Della Vasca Navale 79, Rome 00146, ItalyDipartimento Di Ingegneria, Sezione Di Computer Science and Automation, Università Degli Studi Roma Tre, Via Della Vasca Navale 79, Rome 00146, ItalyAn important objective for train operating companies is to let users, especially commuters, directly query the ICT system about trains’ availability calendar, based on an online approach, and give them clear and brief information, expressed through “intelligent” phrases instead of bit maps. This paper provides a linear programming model of this problem and a fast and flexible heuristic algorithm to create descriptive sentences from train calendars. The algorithmic method, based on the “Divide and Conquer” approach, takes the calendar period queried in its whole and divides it into subsets, which are successively processed one by one. The dominant limitation of previous methods is their strong dependence on the size and complexity of instances. On the contrary, our computational findings show that the proposed online algorithm has a very limited and constant computation time, even when increasing the problem complexity, keeping its processing time between 0 and 16 ms, while producing good quality solutions that differ by an average surplus of 0.13 subsentences compared to benchmark state-of-art solutions.http://dx.doi.org/10.1155/2021/4664010 |
| spellingShingle | Tommaso Bosi Andrea D’Ariano Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation Journal of Advanced Transportation |
| title | Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation |
| title_full | Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation |
| title_fullStr | Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation |
| title_full_unstemmed | Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation |
| title_short | Linear Programming Model and Online Algorithm for Customer-Centric Train Calendar Generation |
| title_sort | linear programming model and online algorithm for customer centric train calendar generation |
| url | http://dx.doi.org/10.1155/2021/4664010 |
| work_keys_str_mv | AT tommasobosi linearprogrammingmodelandonlinealgorithmforcustomercentrictraincalendargeneration AT andreadariano linearprogrammingmodelandonlinealgorithmforcustomercentrictraincalendargeneration |