Schedule synchronization for public transit networks (Q1111918): Difference between revisions

The problem of minimizing waiting times of passengers who want to change communication routes at transfer stations is considered. The paper contains heuristics (regret-methods, improvement algorithms, simulated annealing) as well as a branch-and-bound algorithm and provides computational results, some of them gained with practical data.