Creating bus timetables with maximal synchronization

@article{citeulike:1109597, abstract = {This paper addresses the problem of generating a timetable for a given network of buses so as to maximize their synchronization. It attempts to maximize the number of simultaneous bus arrivals at the connection (transfer) nodes of the network. Transit schedulers, taking into account the satisfaction and convenience of the system's users, appreciate the importance of creating a timetable with maximal synchronization, which enables the transfer of passengers from one route to another with minimum waiting time at the transfer nodes. In this paper, the problem is formulated as a mixed integer linear programming problem, and a heuristic algorithm is developed to solve the problem in polynomial time. The efficiency of this algorithm, compared to optimal solutions, is illustrated through a series of examples.}, author = {Ceder, A. and Golany, B. and Tal, O. }, citeulike-article-id = {1109597}, doi = {http://dx.doi.org/10.1016/S0965-8564(00)00032-X}, journal = {Transportation Research Part A: Policy and Practice}, keywords = {bus, timetables}, month = {December}, number = {10}, pages = {913--928}, posted-at = {2007-02-16 09:41:35}, priority = {3}, title = {Creating bus timetables with maximal synchronization}, url = {http://dx.doi.org/10.1016/S0965-8564(00)00032-X}, volume = {35}, year = {2001} }

TY - JOUR ID - citeulike:1109597 L3 - citeulike-article-id:1109597 N2 - This paper addresses the problem of generating a timetable for a given network of buses so as to maximize their synchronization. It attempts to maximize the number of simultaneous bus arrivals at the connection (transfer) nodes of the network. Transit schedulers, taking into account the satisfaction and convenience of the system's users, appreciate the importance of creating a timetable with maximal synchronization, which enables the transfer of passengers from one route to another with minimum waiting time at the transfer nodes. In this paper, the problem is formulated as a mixed integer linear programming problem, and a heuristic algorithm is developed to solve the problem in polynomial time. The efficiency of this algorithm, compared to optimal solutions, is illustrated through a series of examples. IS - 10 JF - Transportation Research Part A: Policy and Practice EP - 928 TI - Creating bus timetables with maximal synchronization VL - 35 SP - 913 KW - bus KW - timetables AU - Ceder, A AU - Golany, B AU - Tal, O PY - 2001/12// UR - http://dx.doi.org/10.1016/S0965-8564(00)00032-X ER -