| Article ID: | iaor19962157 |
| Country: | United Kingdom |
| Volume: | 23 |
| Issue: | 5 |
| Start Page Number: | 453 |
| End Page Number: | 463 |
| Publication Date: | May 1996 |
| Journal: | Computers and Operations Research |
| Authors: | Nachtigall Karl, Voget Stefan |
| Keywords: | timetabling, heuristics |
The authors 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. The authors present a genetic algorithm which is combined with a greedy heuristic and a local improvement procedure.