Public Transit Network Research Articles

Schedule synchronization for public transit networks

The problem of minimizing waiting times of passengers who want to change communication routes at transfer stations is considered. The paper contains heuristics (regret-methods, improvement algorithms, simulated annealing) as well as a branch and boundalgorithm and provides computational results, some of them gained with practical data.

地方圏域における「都市化」の空間構造 : その 3 関東・東北地方における広域生活圏の形成状況

Tohoku district (65925.71km^2, 9232875 habitants, 1975) of Japan has been widely urbanized during the last twentyfive years. We can divide the region into 42 daily urban arers (DUA) according to daily life movement such as commuting to work or attending school. DUA consists of central urban district (CUD) and outer dependent areas (ODA) and has a population of 87.6% in Tohoku district except isolated areas. Average population in CUD : 120060 habitants Average population in DUA : 192496 habitants Average radius of DUA : 19.1km Thus we can get various patterns of DUA following the size of the number of CUD population. And the characteristics of spatial structure of DUA is as follows : the larger CUD population is, 1. the larger DUA population, 2. the larger ratio of CUD population to whole DUA population, 3. the larger growth of CUD population, 4. the larger growth of DUA population, and 5. the larger radius of DUA is. We must pay attention to the characteristics of DUA in regional planning such as location of public service facilities, transit network and land use.

Common Bus Lines

In large cities operating an important public mass transit network, we are faced with the problem of ‘common bus lines’: some routes share common sections and the passenger must select the buses he will probably use. While most computer packages code the section as a unique link and disregard the precise assignment of passengers on the distinct routes, we give a solution to this operational assignment based on the “perceived” travel time. Formulated as an optimization problem within a probabilistic context, the optimal subset of routes “to be selected” is obtained. A more detailed treatment on uniform and exponential cases for the time of the first vehicle to arrive on a route concludes the paper.