Dynamic Demand-Responsive Feeder Bus Network Design for a Short Headway Trunk Line

Abstract

Recent advancements in technology have increased the potential for demand-responsive feeder transit services to enhance mobility in areas with limited public transit access. For long rail headways, feeder bus network algorithms are straightforward, as the maximum feeder service cycle time is determined by rail headway, and bus–train matching is unnecessary. However, for short rail headways, the algorithm must address both passenger–feeder-bus and feeder-bus–train matching. This study presents a simulated annealing (SA) algorithm for flexible feeder bus routing, accommodating short headway trunk lines and multiple bus relocations for various stations and trains. A 5 min headway rail trunk line example was utilized to test the algorithm. The algorithm effectively managed bus relocations when optimal routes were infeasible at specific stations. Additionally, the algorithm minimized total costs, accounting for vehicle operating expenses and passenger in-vehicle travel time costs, while considering multiple vehicle relocations.

Keywords

• routing
• feeder bus
• demand-responsive transit
• shared mobility
• last-mile transit
• optimization