The periodic event scheduling problem (PESP) is a well studied problem known as intrinsically hard. Its main application is for designing periodic timetables in public transportation. To this end, the passengersu27 paths are required as input data. This is a drawback since the final paths which are used by the passengers depend on the timetable to be designed. Including the passengersu27 routing in the PESP hence improves the quality of the resulting timetables. However, this makes PESP even harder.Formulating the PESP as satisfiability problem and using SAT solvers for its solution has been shown to be a highly promising approach. The goal of this paper is to exploit if SAT solvers can also be used for the problem of integrated timetabling and passenger routing. In our model of the integrated problem we distribute origin-destination (OD) pairs temporally through the network by using time-slices in order to make the resulting model more realistic. We present a formulation of this integrated problem as integer program which we are able to transform to a satisfiability problem. We tested the latter formulation within numerical experiments, which are performed on Germanyu27s long-distance passenger railway network. The computationu27s analysis in which we compare the integrated approach with the traditional one with fixed passengersu27 weights, show promising results for future scientific investigations.
展开▼
