Extensive Model and Matheuristic Algorithm for the Train Platforming Problem with Two-Train-Capacity Tracks: A Case Study of Prague Central Station

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F23%3A39920231" target="_blank" >RIV/00216275:25510/23:39920231 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1177/03611981231184251" target="_blank" >https://doi.org/10.1177/03611981231184251</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1177/03611981231184251" target="_blank" >10.1177/03611981231184251</a>

Result language

angličtina

Original language name

Extensive Model and Matheuristic Algorithm for the Train Platforming Problem with Two-Train-Capacity Tracks: A Case Study of Prague Central Station

Original language description

This paper provides a deeper insight into the train platforming problem (TPP). Many studies have focused on different versions of train scheduling and routing problems, and most of them assume that the platform track’s capacity is one train. However, especially in busy and complex railway stations, most platform tracks are divided into two parts, allowing two trains to simultaneously share the same platform track for passenger boarding/alighting. This results in more efficient train assignment to the platform tracks. In addition, consideration of the track capacity makes the problem more difficult because directions of trains are problematic. Motivated by this challenge, we consider the TPP with two-train-capacity tracks. We first describe the problem in detail and then propose a mixed-integer programming model. The objective of the considered problem is to minimize the total weighted train delays, which are defined as the difference between the departure times calculated by the mathematical model (M1) and the scheduled departure times of the trains in the timetable. Because of the NP-hard nature of the problem, the proposed M1 may not find feasible solutions for large-size problems. Thus, a matheuristic algorithm (MA) is developed to solve large-size problems. We used randomly generated test problems to demonstrate the performance of the proposed M1 and MA. Experimental results showed that MA outperforms M1 in both solution quality and solution time. Additionally, a case study was conducted at the central station of Prague, Czechia.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20104 - Transport engineering

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Transportation Research Record

ISSN

0361-1981

e-ISSN

2169-4052

Volume of the periodical

2678

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

24

Pages from-to

131-154

UT code for WoS article

001034148000001

EID of the result in the Scopus database

2-s2.0-85165567926