An Algorithm for Trip Planning with Constraint of Transfer Connection in Urban Mass Transit Network

In large scale urban mass transit (UMT) network, different lines in a transfer station always stop at different time. Thus, in the time span of last trains running, passengers are easy to face a problem when transferring: the next line already stopped. This brings big inconvenience to passengers. A survey from 276 passengers in Beijing shows that 51 percent passengers have ever missed the last trains when transferring. As to solve this problem, we analyzed the factors which affect the transfer such as: the topology of UMT network, schedule, distribution of passengers´ transfer time. Then we introduced an algorithm with the constraint of transfer connection. Experiments were conducted to validate this algorithm based on the real UMT network in Beijing China. The result shows that the algorithm is efficient to tackle this problem. With the development of the trip planning system based on this algorithm, it will make the late trip more convenient for passengers.