A disaggregate bundle method for train timetabling problems. (December 2020)

• Record Type: Journal Article
• Authors: Ait-Ali, Abderrahman; Lindberg, Per Olov; Eliasson, Jonas; Nilsson, Jan-Eric; Peterson, Anders
• Is Part Of: Journal of rail transport planning & management. Volume 16(2020)
• Publication Date: 2020-12
• Subjects: Train timetabling -- Disaggregation -- Bundle methods -- Lagrangian relaxation -- Mathematical programming; Railroads -- Periodicals; Railroads -- Planning -- Periodicals; Railroads -- Management -- Periodicals; Railroads; Railroads -- Management; Railroads -- Planning; Periodicals; 385.068
• DOI: 10.1016/j.jrtpm.2020.100200
• Languages: English
• ISSNs: 2210-9706

Abstract

Abstract: 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. Highlights: Train timetabling model for single-track railway lines. An improved variant of bundle method using disaggregation of train path requests. Tests on real world scheduling scenarios from the Iron Ore line in Sweden. Possible parallel implementation.