A genetic algorithm approach to periodic railway synchronization

被引:100
作者
Nachtigall, K
Voget, S
机构
[1] Universität Hildesheim, Institut für Mathematik, 31141, Hildesheim
关键词
D O I
10.1016/0305-0548(95)00032-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 1996 Elsevier Science Ltd
引用
收藏
页码:453 / 463
页数:11
相关论文
共 16 条
[11]  
NACHTIGALL K, IN PRESS DISCRETE AP
[12]  
NACHTIGALL K, 1993, 1493
[13]  
Serafini P., 1989, SIAM J. Discrete Math., V2, P550, DOI DOI 10.1137/0402049
[14]  
ULDER NLJ, 1991, LECT NOTES COMPUT SC, V496, P109, DOI 10.1007/BFb0029740
[15]  
VAESSENS R, 1993, DISCRETE APPL MATH, P71
[16]  
WEIGAND W, 1983, RAIL INT, P8