A dynamic model for real-time track assignment at railway yards

Research output: Contribution to conferencePaper

22 Downloads (Pure)

Abstract

In this paper, we study the real-time train assignment problem (RT-TAP) that arises from the high percentage of unreliable arrival times of freight trains and the large quantity of last-minute parking requests at railway yards. In the RT-TAP, the reassignment of trains to the yard is triggered every time a train arrives at the railway yard and needs to be assigned (event-based optimization). After
introducing a problem formulation for the RT-TAP problem, we prove that RT-TAP is NP-Hard. In particular, the RT-TAP is modeled as a mixed integer program that strives to minimize the total weighted delay of trains. Because of its computational complexity and the time-critical nature of this problem, we introduce two real-time solution methods: (a) a problem-specific genetic algorithm (GA), (b) and a first-scheduled first-served (FSFS) heuristic. In small instances, we show that the GA returns a globally optimal solution which is identical to the solution of exact optimization methods. In larger problem instances, the heuristic approaches of FSFS and GA are tested at the Waalhaven Zuid railway yard in the Netherlands using two months of operational data. In the experimental results, the GA solutions reduce the average delays by more than 4 minutes compared to the solutions of the FSFS heuristic.
Original languageEnglish
Number of pages22
Publication statusPublished - Jan 2020
EventTransportation Research Board (TRB) 99th Annual Meeting - Walter E. Washington Convention Center, Washinton, United States
Duration: 12 Jan 202016 Jan 2020
Conference number: 99
http://www.trb.org/AnnualMeeting/AnnualMeeting.aspx

Conference

ConferenceTransportation Research Board (TRB) 99th Annual Meeting
Abbreviated titleTRB 2020
CountryUnited States
CityWashinton
Period12/01/2016/01/20
Internet address

Fingerprint

Dynamic models
Genetic algorithms
Computational complexity
Parking

Cite this

Schasfoort, B. B. W., Gkiotsalitis, K., Eikenbroek, O. A. L., & van Berkum, E. C. (2020). A dynamic model for real-time track assignment at railway yards. Paper presented at Transportation Research Board (TRB) 99th Annual Meeting, Washinton, United States.
Schasfoort, Bram B.W. ; Gkiotsalitis, Konstantinos ; Eikenbroek, Oskar Adriaan Louis ; van Berkum, E.C. . / A dynamic model for real-time track assignment at railway yards. Paper presented at Transportation Research Board (TRB) 99th Annual Meeting, Washinton, United States.22 p.
@conference{1b0c7a284b174631b3e5b03243d3de50,
title = "A dynamic model for real-time track assignment at railway yards",
abstract = "In this paper, we study the real-time train assignment problem (RT-TAP) that arises from the high percentage of unreliable arrival times of freight trains and the large quantity of last-minute parking requests at railway yards. In the RT-TAP, the reassignment of trains to the yard is triggered every time a train arrives at the railway yard and needs to be assigned (event-based optimization). Afterintroducing a problem formulation for the RT-TAP problem, we prove that RT-TAP is NP-Hard. In particular, the RT-TAP is modeled as a mixed integer program that strives to minimize the total weighted delay of trains. Because of its computational complexity and the time-critical nature of this problem, we introduce two real-time solution methods: (a) a problem-specific genetic algorithm (GA), (b) and a first-scheduled first-served (FSFS) heuristic. In small instances, we show that the GA returns a globally optimal solution which is identical to the solution of exact optimization methods. In larger problem instances, the heuristic approaches of FSFS and GA are tested at the Waalhaven Zuid railway yard in the Netherlands using two months of operational data. In the experimental results, the GA solutions reduce the average delays by more than 4 minutes compared to the solutions of the FSFS heuristic.",
author = "Schasfoort, {Bram B.W.} and Konstantinos Gkiotsalitis and Eikenbroek, {Oskar Adriaan Louis} and {van Berkum}, E.C.",
year = "2020",
month = "1",
language = "English",
note = "Transportation Research Board (TRB) 99th Annual Meeting, TRB 2020 ; Conference date: 12-01-2020 Through 16-01-2020",
url = "http://www.trb.org/AnnualMeeting/AnnualMeeting.aspx",

}

Schasfoort, BBW, Gkiotsalitis, K, Eikenbroek, OAL & van Berkum, EC 2020, 'A dynamic model for real-time track assignment at railway yards' Paper presented at Transportation Research Board (TRB) 99th Annual Meeting, Washinton, United States, 12/01/20 - 16/01/20, .

A dynamic model for real-time track assignment at railway yards. / Schasfoort, Bram B.W.; Gkiotsalitis, Konstantinos ; Eikenbroek, Oskar Adriaan Louis; van Berkum, E.C. .

2020. Paper presented at Transportation Research Board (TRB) 99th Annual Meeting, Washinton, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A dynamic model for real-time track assignment at railway yards

AU - Schasfoort, Bram B.W.

AU - Gkiotsalitis, Konstantinos

AU - Eikenbroek, Oskar Adriaan Louis

AU - van Berkum, E.C.

PY - 2020/1

Y1 - 2020/1

N2 - In this paper, we study the real-time train assignment problem (RT-TAP) that arises from the high percentage of unreliable arrival times of freight trains and the large quantity of last-minute parking requests at railway yards. In the RT-TAP, the reassignment of trains to the yard is triggered every time a train arrives at the railway yard and needs to be assigned (event-based optimization). Afterintroducing a problem formulation for the RT-TAP problem, we prove that RT-TAP is NP-Hard. In particular, the RT-TAP is modeled as a mixed integer program that strives to minimize the total weighted delay of trains. Because of its computational complexity and the time-critical nature of this problem, we introduce two real-time solution methods: (a) a problem-specific genetic algorithm (GA), (b) and a first-scheduled first-served (FSFS) heuristic. In small instances, we show that the GA returns a globally optimal solution which is identical to the solution of exact optimization methods. In larger problem instances, the heuristic approaches of FSFS and GA are tested at the Waalhaven Zuid railway yard in the Netherlands using two months of operational data. In the experimental results, the GA solutions reduce the average delays by more than 4 minutes compared to the solutions of the FSFS heuristic.

AB - In this paper, we study the real-time train assignment problem (RT-TAP) that arises from the high percentage of unreliable arrival times of freight trains and the large quantity of last-minute parking requests at railway yards. In the RT-TAP, the reassignment of trains to the yard is triggered every time a train arrives at the railway yard and needs to be assigned (event-based optimization). Afterintroducing a problem formulation for the RT-TAP problem, we prove that RT-TAP is NP-Hard. In particular, the RT-TAP is modeled as a mixed integer program that strives to minimize the total weighted delay of trains. Because of its computational complexity and the time-critical nature of this problem, we introduce two real-time solution methods: (a) a problem-specific genetic algorithm (GA), (b) and a first-scheduled first-served (FSFS) heuristic. In small instances, we show that the GA returns a globally optimal solution which is identical to the solution of exact optimization methods. In larger problem instances, the heuristic approaches of FSFS and GA are tested at the Waalhaven Zuid railway yard in the Netherlands using two months of operational data. In the experimental results, the GA solutions reduce the average delays by more than 4 minutes compared to the solutions of the FSFS heuristic.

M3 - Paper

ER -

Schasfoort BBW, Gkiotsalitis K, Eikenbroek OAL, van Berkum EC. A dynamic model for real-time track assignment at railway yards. 2020. Paper presented at Transportation Research Board (TRB) 99th Annual Meeting, Washinton, United States.