Pasar al contenido principal

INTEGRACION DE METODOS DE INTELIGENCIA ARTIFICIAL Y APRENDIZAJE AUTOMATICO PARA LA PLANIFICACION TACTICA DE SISTEMAS FERROVIARIOS DE PASAJEROS BAJO COMPETENCIA

PID2020-112967GB-C32

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE CASTILLA-LA MANCHA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Optimization techniques for Kernel Logistic Regression on large-scale datasets: A comparative study

  • Martín-Baos, José Ángel
  • García-Ródenas, Ricardo
  • Rodriguez-Benitez, Luis
[EN] In recent years, machine learning techniques have been increasingly applied to modelling the decision-making processes of individuals. One technique that has shown good results in the literature for modelling complex behaviours is the Kernel Logistic Regression (KLR). However, standard KLR implementations have a time complexity of O(n3), which is not feasible for large datasets. To overcome this limitation, one of the purposed alternatives is to approximate the kernel matrix using the Nyström method. The aim of this work is to evaluate the Nyström KLR model on large-scale datasets and to study, at the experimental level, which of the optimisation techniques that allow training this model is the most efficient. As results, the authors show that the Nyström method efficiently computes the objective function and its gradient, enabling the training of KLR models with up to 105 parameters. Then, it is evaluated the performance of several optimisation methods, including gradient descend, Momentum, Adam, and L-BFGS-B. It can be concluded that L-BFGS-B is the most efficient method for training the Nyström KLR model. However, given enough computational time and proper hyperparameter tuning, the Adam method can also yield good results., Grant PID2020-112967GB-C32 founded by MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación 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)