A Decomposition Approach of the Real-Time ...
Type de document :
Communication dans un congrès avec actes
Titre :
A Decomposition Approach of the Real-Time Railway Traffic Management Problem
Auteur(s) :
Petris, Matteo [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Pellegrini, Paola [Auteur]
Laboratoire Électronique Ondes et Signaux pour les Transports [COSYS-LEOST ]
Pesenti, Raffaele [Auteur]
Dipartimento di Management [Venezia]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Pellegrini, Paola [Auteur]
Laboratoire Électronique Ondes et Signaux pour les Transports [COSYS-LEOST ]
Pesenti, Raffaele [Auteur]
Dipartimento di Management [Venezia]
Titre de la manifestation scientifique :
RailBeijing 2021, 9th International Conference on Railway Operations Modelling and Analysis (ICROMA)
Ville :
Pékin
Pays :
Chine
Date de début de la manifestation scientifique :
2021-11-03
Titre de l’ouvrage :
RailBeijing 2021, 9th International Conference on Railway Operations Modelling and Analysis (ICROMA)
Date de publication :
2021-01-01
Mot(s)-clé(s) :
TRANSPORT FERROVIAIRE
GESTION DU TRAFIC
AFFECTATION DU TRAFIC
TRAITEMENT EN TEMPS REEL
TABLE HORAIRE
GESTION DU TRAFIC
AFFECTATION DU TRAFIC
TRAITEMENT EN TEMPS REEL
TABLE HORAIRE
Mot(s)-clé(s) en anglais :
RAILWAY TRAFFIC MANAGEMENT
REAL-TIME SCHEDULING
PROBLEM DECOMPOSITION
REAL-TIME SCHEDULING
PROBLEM DECOMPOSITION
Discipline(s) HAL :
Mathématiques [math]/Optimisation et contrôle [math.OC]
Résumé :
In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. ...
Lire la suite >In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. In this paper, we propose an algorithm for managing traffic considering dynamic problem decompositions. It is an asynchronous algorithm based on the decomposition of the problem considering at each time step the smallest possible portion of the network and subset of trains. We prove that this algorithm guarantees to find an overall feasible solution if it exists, for networks with specific characteristicsLire moins >
Lire la suite >In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. In this paper, we propose an algorithm for managing traffic considering dynamic problem decompositions. It is an asynchronous algorithm based on the decomposition of the problem considering at each time step the smallest possible portion of the network and subset of trains. We prove that this algorithm guarantees to find an overall feasible solution if it exists, for networks with specific characteristicsLire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Non spécifiée
Vulgarisation :
Non
Commentaire :
RailBeijing 2021, 9th International Conference on Railway Operations Modelling and Analysis (ICROMA), Pékin, CHINE, 03-/11/2021 - 07/11/2021
Collections :
Source :