Some Practical Aspects of Periodic Timetabling
暂无分享,去创建一个
We consider the design of periodic timetables for public transportation networks. The used model is a digraph in which temporal restrictions on the arcs relate periodically recurring events. Solution methods are commonly based on an integer programming approach; the number of integer variables equals the cyclomatic number of the digraph.
[1] Karl Nachtigall,et al. A genetic algorithm approach to periodic railway synchronization , 1996, Comput. Oper. Res..
[2] Karl Nachtigall,et al. Cutting Planes for a Polyhedron Associated with a Periodic Network. , 1996 .
[3] Walter Ukovich,et al. A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..
[4] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..