Research Article
Integrating Bus Holding Control Strategies and Schedule Recovery: Simulation-Based Comparison and Recommendation
Algorithm 1
Bus trajectories evolution algorithm.
Initialization: Set input parameters and the counter of simulations | Procedure: | Step 1: Generate the departure times for all trips from the terminal | for bus =1: do | Compute the departure time for the bus line, satisfying | end | Step 2: Generate the stochastic bus link travel time | for bus =1: do | for stop =2: do | Compute the bus link travel time from a truncated normal distribution. | end | end | Step 3: Generate the full trajectories of the first bus | for stop =2: do | Compute the arrival time of bus 1 at stop, satisfying | Compute the departure time of bus from stop, satisfying | Compute the number of on-board passengers, satisfying | Let the leftover demand, | end | Step 4: Generate the trajectories for the remaining trips of the bus line | for stop =2: do | for bus =2: do | Compute the trajectory and passenger flows of bus at stop using Eqs.(1)-(11) subject to Eqs.(16) | Apply holding control and schedule recovery where necessary, and update the departure time according to Eqs.(12)-(15). | end | end |
|