An iterative heuristic for passenger-centric train timetabling with integrated adaption times

In this paper we present a method to construct periodic timetable from tactical planning perspective. We aim at constructing that is feasible with respect infrastructure constraints and minimizes total perceived passenger travel time. addition in-train transfer times, our notion of time includes the adaption (waiting origin station). Adaption minimization allows us avoid strict frequency regularity and, same time, ensure regular connections between passengers’ origins destinations. The combination satisfaction makes problem very challenging. described timetabling can be modelled as an extension Periodic Event Scheduling Problem (PESP) formulation, but requires huge computing times if it directly solved by general-purpose solver for instances realistic size. paper, propose heuristic approach consisting two phases are executed iteratively. First, solve mixed-integer linear program determine ideal neglects constraints. Then, Lagrangian-based modifying train departure arrival little possible. obtained then evaluated compute resulting feedback sent so possibly improve perspective, while still respecting illustrate proposed iterative on real-life Netherlands Railways compare benchmark approach, showing finds close one.