| Summary |
Seamless transportation is a door-to-door public transit service with no transferring gap in the whole journey, which can be achieved by integrates the operation and infrastructures of different public transit systems. As the improvement of the efficiency and service level, the willingness of adopting public transit will increase.
The main goal of this research is to minimize the time gap of transferring between different public transit systems by adjusting current schedule, so that the number of runs and the number of operating public transportation will remain the same. First we divide public transit systems into “main line” and “branch line” two categories and use a mathematical model to describe the problem, than design a heuristic algorithm with a concept of local search for solving the problem. After imports current schedules into the algorithm, it will correspond every run of the branch line and mail line which means passengers can transfer through these runs. And the algorithm will adjust the time of the branch line one by one from the first run to minimize the time gap of transferring. Also we consider other situations, such as one branch line can transfer to two or more main lines, changing the initial adjusting branch line run or changing different objective function.
We use the 155 bus in Taichung city and the Green 4 bus in Tainan city as testing examples represent the intensive and sparse schedule of the branch line respectively and compare the adjustment result in different situation. The testing results shows that the schedule adjust by the algorithm is much better than the current schedule. |
