Abstract
The arrival unpunctuality of demand- responsive bus transit seriously reduced the service level and the passengers' willingness to choose public transit. This paper studies the dynamic bus routing problem of demand-responsive feeder transit (DRFT) considering stochastic bus arrival time. A mathematical model is developed by optimizing bus routes to find the cost-optimal transit service, in which the total cost, consisting of operator cost, passenger travel time cost, and passenger waiting time cost is minimized. The innovation of the model lies in allowing passengers to submit real-time travel demand during the operation and defining the bus arrival time following a known distribution to describe its stochasticity. A heuristic combining genetic algorithm and neighborhood search was proposed. The proposed algorithm hybridizes the global search of a genetic algorithm with the local search of a neighborhood search algorithm. The validity and advance of the proposed algorithm are verified by the experimental test analysis. Finally, the results based on the experiment on Yanpingmen subway station in Xi'an City show that the consideration of stochastic bus arrival time could reduce the passenger waiting time and the total cost.
Translated title of the contribution | Dynamic Bus Routing Optimization for Demand-responsive Feeder Transit Considering Stochastic Bus Arrival Time |
---|---|
Original language | Chinese (Traditional) |
Pages (from-to) | 196-204 and 292 |
Journal | Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/ Journal of Transportation Systems Engineering and Information Technology |
Volume | 22 |
Issue number | 5 |
DOIs | |
State | Published - Oct 25 2022 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Transportation
- Computer Science Applications
Keywords
- demand- responsive feeder transit
- genetic algorithm
- neighborhood search
- real-time requests
- stochastic bus arrival time
- urban traffic