A genetic algorithm approach to periodic railway synchronization

We consider the compilation of timetables for periodic served railway networks. The calculation of timetables with minimal waiting time for passengers changing trains is modeled by a periodic network optimization problem. We present a genetic algorithm which is combined with a greedy heuristic and a local improvement procedure.