Creating bus timetables with maximal synchronization |
| |
| Authors: | A. Ceder B. Golany O. Tal |
| |
| Affiliation: | 1. Department of Civil and Environmental Engineering, University of South Florida, 4202 E Fowler Avenue, ENC 3300, Tampa, FL 33620, United States;2. School of Sustainable Engineering and the Built Environment, Arizona State University, Tempe, AZ 85287, United States;1. Department of Civil and Transportation Engineering, South China University of Technology, Guangzhou 510641, China;2. Institute for Transport Studies, University of Leeds, Leeds LS2 9JT, United Kingdom;3. School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China |
| |
| 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. |
| |
| Keywords: | Public transportation planning Scheduling Synchronization Timetables |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
