This paper describes a new method of generating text starting from a calendar, automatically and in a representation clear to customers. We focus in particular on railway applications. Railway undertakings are trying to improve their communication with commuters, employees and travelers, especially for the frequent occurrences of path modifications implying scattered calendars and not intelligible descriptions appearing in various outputs such as websites, mobile applications, timetable boards, train transport diagrams and books. We propose two alternative approaches for this challenging task. The first one combines a customized set covering problem formulation with a parallel vector generation algorithm. The second one integrates the vector generation problem in the set covering problem into a more complex mathematical model. Our aim is to verify that with a mathematical programming approach it is possible to improve the quality of outcomes in terms of intelligibility. We used a commercial mip solver (CPLEX 12.4) to solve the two models, while we designed a specific parallel algorithm for the vector generation problem in the first approach. The new solutions were tested on several real timetables and compared with the tools used so far.

A new approach for train calendar description generation / Amorosi, Lavinia; Dell'Olmo, Paolo; Giacco, GIOVANNI LUCA. - ELETTRONICO. - 25 August 2015:(2015), pp. 280-286. ((Intervento presentato al convegno 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) tenutosi a Budapest; Hungary [10.1109/MTITS.2015.7223268].

A new approach for train calendar description generation

AMOROSI, LAVINIA;DELL'OLMO, Paolo;
2015

Abstract

This paper describes a new method of generating text starting from a calendar, automatically and in a representation clear to customers. We focus in particular on railway applications. Railway undertakings are trying to improve their communication with commuters, employees and travelers, especially for the frequent occurrences of path modifications implying scattered calendars and not intelligible descriptions appearing in various outputs such as websites, mobile applications, timetable boards, train transport diagrams and books. We propose two alternative approaches for this challenging task. The first one combines a customized set covering problem formulation with a parallel vector generation algorithm. The second one integrates the vector generation problem in the set covering problem into a more complex mathematical model. Our aim is to verify that with a mathematical programming approach it is possible to improve the quality of outcomes in terms of intelligibility. We used a commercial mip solver (CPLEX 12.4) to solve the two models, while we designed a specific parallel algorithm for the vector generation problem in the first approach. The new solutions were tested on several real timetables and compared with the tools used so far.
2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS)
set covering; text generation; train calendar
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
A new approach for train calendar description generation / Amorosi, Lavinia; Dell'Olmo, Paolo; Giacco, GIOVANNI LUCA. - ELETTRONICO. - 25 August 2015:(2015), pp. 280-286. ((Intervento presentato al convegno 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) tenutosi a Budapest; Hungary [10.1109/MTITS.2015.7223268].
File allegati a questo prodotto
File Dimensione Formato  
Amorosi_Train-calendar_2015.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 269.73 kB
Formato Adobe PDF
269.73 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/836942
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact