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 optimizati
on problem. We present a genetic algorithm which is combined with a gr
eedy heuristic and a local improvement procedure. (C) 1996 Elsevier Sc
ience Ltd