A disaggregate bundle method for train timetabling problems

The train timetabling problem (TTP) consists of finding a feasible timetable for a number of trains which minimises some objective function, e.g., sum of running times or deviations from ideal departure times. One solution approach is to solve the dual problem of the TTP using so-called bundle metho...

Full description

Bibliographic Details
Published in:Journal of Rail Transport Planning & Management
Main Authors: Ait Ali, Abderrahman, Lindberg, Per Olov, Eliasson, Jonas, Nilsson, Jan-Eric, Peterson, Anders
Format: Article in Journal/Newspaper
Language:English
Published: Linköpings universitet, Kommunikations- och transportsystem 2020
Subjects:
Train timetabling
Disaggregation
Bundle methods
Lagrangian relaxation
Mathematical programming
Transport Systems and Logistics
Transportteknik och logistik
Northern Sweden
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-165781
https://doi.org/10.1016/j.jrtpm.2020.100200
Description
Summary:The train timetabling problem (TTP) consists of finding a feasible timetable for a number of trains which minimises some objective function, e.g., sum of running times or deviations from ideal departure times. One solution approach is to solve the dual problem of the TTP using so-called bundle methods. This paper presents a new bundle method that uses disaggregate data, as opposed to the standard bundle method which in a certain sense relies on aggregate data. We compare the disaggregate and aggregate methods on realistic train timetabling scenarios from the Iron Ore line in Northern Sweden. Numerical results indicate that the proposed disaggregate method reaches better solutions faster than the standard aggregate approach. The accepted version is also available on the author's home page: http://abdeaitali.github.io/ Funding agencies: Swedish Transport Administration (Trafikverket) SamEff

Similar Items