Skip to main content

TECNICAS ANALITICAS PARA LA TRANSICION HACIA UNA PLANIFICACION, GESTION Y CONTROL SOSTENIBLES DE LA MOVILIDAD EN TRANSPORTE AEREO

PID2020-112967GB-C33

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD REY JUAN CARLOS

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An efficient greedy heuristic for the real-time train platforming problem

  • García Ródenas, Ricardo
  • López García, Maria Luz
  • Cadarso Morga, Luis
  • Codina Sancho, Esteve|||0000-0002-9431-6158
© 2023 The Author(s). This is an open access article under the CC BY-NC license, This paper focuses on a special class of real-time railway traffic management problem: efficiently reallocating trains to platforms at stations in case of slight schedule changes or major disruptions. The need for a real-time response with a high level of quality makes this problem particularly challenging. To address this issue, the authors propose a mesoscopic approach that involves preprocessing the data to determine feasible routes and other disruption parameters. They develop a greedy interchange heuristic to solve the mesoscopic real-time train platforming problem, providing high-quality routing and timing decisions within the computational time constraints of real-time management problems. The performance of the proposed heuristic is analyzed through case studies using both synthetic and realistic scenarios from the Spanish railway traffic system. For large instances of the Atocha-Cercanías station case study, the solutions are generated from 5 to 10 times faster by the heuristic algorithm than by the exact method. The authors conclude that the proposed heuristic is a promising solution for real-time train platforming problems., This research has been supported by Project Grants PID2020-112967GB-C31, PID2020-112967GB-C32, PID2020-112967GB-C33 and TED2021-130347B-I00 funded by MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An efficient greedy heuristic for the real-time train platforming problem

  • García Ródenas, Ricardo
  • López García, Maria Luz
  • Cadarso Morga, Luis
  • Codina Sancho, Esteve
© 2023 The Author(s). This is an open access article under the CC BY-NC license, This paper focuses on a special class of real-time railway traffic management problem: efficiently reallocating trains to platforms at stations in case of slight schedule changes or major disruptions. The need for a real-time response with a high level of quality makes this problem particularly challenging. To address this issue, the authors propose a mesoscopic approach that involves preprocessing the data to determine feasible routes and other disruption parameters. They develop a greedy interchange heuristic to solve the mesoscopic real-time train platforming problem, providing high-quality routing and timing decisions within the computational time constraints of real-time management problems. The performance of the proposed heuristic is analyzed through case studies using both synthetic and realistic scenarios from the Spanish railway traffic system. For large instances of the Atocha-Cercanías station case study, the solutions are generated from 5 to 10 times faster by the heuristic algorithm than by the exact method. The authors conclude that the proposed heuristic is a promising solution for real-time train platforming problems., This research has been supported by Project Grants PID2020-112967GB-C31, PID2020-112967GB-C32, PID2020-112967GB-C33 and TED2021-130347B-I00 funded by MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe., Peer Reviewed, Postprint (published version)