Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

Abstract

Abstract Although demand responsive feeder bus operation is possible with human-driven vehicles, it has not been very popular and is mostly available as a special service because of its high operating costs due to intensive labor costs as well as requirement for advanced real-time information technology and complicated operation. However, once automated vehicles become available, small-sized flexible door-to-door feeder bus operation will become more realistic, so preparing for such automated flexible feeder services is necessary to take advantage of the rapid improvement of automated vehicle technology. Therefore, in this research, an algorithm for optimal flexible feeder bus routing, which considers relocation of buses for multiple stations and trains, was developed using a simulated annealing algorithm for future automated vehicle operation. An example was developed and tested to demonstrate the developed algorithm. The algorithm successfully handled relocation of buses when the optimal bus routings were not feasible using the buses available at certain stations. Furthermore, the developed algorithm limited the maximum degree of circuity for each passenger while minimizing the total cost, including total vehicle operating costs and total passenger in-vehicle travel time costs.

Keywords

• Automated transit
• Vehicle routing
• Feeder bus
• Simulated annealing
• Demand responsive transit
• First and last mile service