Low-Level Modeling for Routing and Scheduling ...
Document type :
Article dans une revue scientifique
Title :
Low-Level Modeling for Routing and Scheduling Trains through Busy Railway Stations with Expandable Coupling/Decoupling Mechanism
Author(s) :
Khanh Dang, Quoc [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Bourdeaud’huy, Thomas [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Mesghouni, Khaled [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Toguyéni, Armand [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Bourdeaud’huy, Thomas [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Mesghouni, Khaled [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Toguyéni, Armand [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Journal title :
International Journal of Modeling and Optimization
Pages :
150 - 159
Publisher :
IJMO
Publication date :
2020-10
ISSN :
2010-3697
HAL domain(s) :
Informatique [cs]/Modélisation et simulation
English abstract : [en]
This paper studies train routing and scheduling problem for busy railway stations. The train routing problem is to assign each train to a route through the railway station and to a platform in the station. The train ...
Show more >This paper studies train routing and scheduling problem for busy railway stations. The train routing problem is to assign each train to a route through the railway station and to a platform in the station. The train scheduling problem is to determine timing and ordering plans for all trains on the assigned train routes. Our objective is to allow trains to be routed in dense areas that are reaching saturation. Unlike traditional methods that allocate all resources to setup a route for a train until the route is freed, our work focuses on the use of resources as trains progress through the railway node. This technique allows a larger number of trains to be routed simultaneously in a railway node and thus reduces their current saturation. In this paper, we consider that trains can be coupled or decoupled and trains can pass through the railway station without stopping at any platform. To deal with this problem, this study proposes an abstract model and a mixed-integer linear programming formulation to solve it. The method is illustrated on a didactic example.Show less >
Show more >This paper studies train routing and scheduling problem for busy railway stations. The train routing problem is to assign each train to a route through the railway station and to a platform in the station. The train scheduling problem is to determine timing and ordering plans for all trains on the assigned train routes. Our objective is to allow trains to be routed in dense areas that are reaching saturation. Unlike traditional methods that allocate all resources to setup a route for a train until the route is freed, our work focuses on the use of resources as trains progress through the railway node. This technique allows a larger number of trains to be routed simultaneously in a railway node and thus reduces their current saturation. In this paper, we consider that trains can be coupled or decoupled and trains can pass through the railway station without stopping at any platform. To deal with this problem, this study proposes an abstract model and a mixed-integer linear programming formulation to solve it. The method is illustrated on a didactic example.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-03447073/document
- Open access
- Access the document
- https://doi.org/10.7763/ijmo.2020.v10.763
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03447073/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03447073/document
- Open access
- Access the document
- document
- Open access
- Access the document
- DANG_2020_763-CE2-0015%20edited%2015_07.pdf
- Open access
- Access the document
- ijmo.2020.v10.763
- Open access
- Access the document