• Feb 07, 2023 News!IJMO will adopt Article-by-Article Work Flow   [Click]
  • Aug 25, 2023 News!Vol. 13, No. 3 has been published with online version.   [Click]
  • Dec 21, 2023 News!Vol. 13, No. 4 has been published with online version.   [Click]
General Information
Editor-in-chief
Prof. Adrian Olaru
University Politehnica of Bucharest, Romania
I'm happy to take on the position of editor in chief of IJMO. It's a journal that shows promise of becoming a recognized journal in the area of modelling and optimization. I'll work together with the editors to help it progress.
IJMO 2020 Vol.10(5): 150-159 ISSN: 2010-3697
DOI: 10.7763/IJMO.2020.V10.763

Low-Level Modeling for Routing and Scheduling Trains through Busy Railway Stations with Expandable Coupling/Decoupling Mechanism

Quoc Khanh Dang, Thomas Bourdeaud’huy, Khaled Mesghouni, and Armand Toguyéni

Abstract—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.

Index Terms—Busy railway stations, mixed-integer linear programming, offline railway station management, train coupling, train decoupling, train platforming, train routing, train scheduling.

Q. K. Dang, T. Bourdeaud’huy, K. Mesghouni, and A. Toguyéni are with the Research center in Computer Science, Signal and Automatic Control of Lille (CRIStAL), Ecole Centrale de Lille, Univ. Lille Nord-Europe, Lille, France (e-mail: quoc-khanh.dang@centralelille.fr, thomas.bourdeaud’huy@centralelille.fr, khaled.mesghouni@centralelille.fr, armand.toguyeni@centralelille.fr).

[PDF]

Cite: Quoc Khanh Dang, Thomas Bourdeaud’huy, Khaled Mesghouni, and Armand Toguyéni, "Low-Level Modeling for Routing and Scheduling Trains through Busy Railway Stations with Expandable Coupling/Decoupling Mechanism," International Journal of Modeling and Optimization vol. 10, no. 5, pp. 150-159, 2020.

Copyright © 2008-2024. International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com