Development of Application for Estimating Daily Boarding and Alighting Counts on New York City Buses
TL;DRAbstract
To support bus service scheduling and planning, New York City Transit (NYCT) put into production a ridership application to determine surface transit boarding and alighting locations for each of approximately 2.8 million daily passenger trips on 218 bus routes. The application combined data from an automated vehicle location (AVL) system, a multimodal entry-only nongeographic automated fare collection (AFC) system, and general transit feed specification schedule file streams. To accomplish this objective, NYCT developed a highly optimized network-generation tool to estimate bus link loads and boarding and alighting locations by creating a scaled-down custom network based on first-bus trajectory (from AVL boarding location data) and a few possible AFC- or AVL-inferred second-leg pickup stops. Solving for the shortest walking path on this subnetwork yielded connection and alighting points more efficiently than did solving for all 128 million potential origin–destination (O-D) pairs syste
Chat with Paper
AI Agents for this Paper
To support bus service scheduling and planning, New York City Transit (NYCT) put into production a ridership application to determine surface transit boarding and alighting locations for each of approximately 2.8 million daily passenger trips on 218 bus routes. The application combined data from an automated vehicle location (AVL) system, a multimodal entry-only nongeographic automated fare collection (AFC) system, and general transit feed specification schedule file streams. To accomplish this objective, NYCT developed a highly optimized network-generation tool to estimate bus link loads and boarding and alighting locations by creating a scaled-down custom network based on first-bus trajectory (from AVL boarding location data) and a few possible AFC- or AVL-inferred second-leg pickup stops. Solving for the shortest walking path on this subnetwork yielded connection and alighting points more efficiently than did solving for all 128 million potential origin–destination (O-D) pairs syste
Keywords
Chat
Click to start Chat