Article ID: | iaor19982837 |
Country: | United Kingdom |
Volume: | 32B |
Issue: | 2 |
Start Page Number: | 77 |
End Page Number: | 100 |
Publication Date: | Feb 1998 |
Journal: | Transportation Research. Part B: Methodological |
Authors: | Barnhart Cynthia, Wilson Nigel H.M., Bernstein David H., Eberlein Xu Jun |
Keywords: | control |
In high frequency transit operations, randomness and incidents often result in highly irregular headways which can significantly decrease service quality. Deadheading is one commonly used real-time operations control strategy that can improve service quality in such situations. When a vehicle is deadheaded, it runs empty from a terminal skipping a number of stations, typically in order to reduce expected large headways at later stations. The real-time deadheading problem is to determine at dispatching time which vehicles to deadhead and how many stations to skip in order to minimize the total passenger cost in the system. This paper formulates this problem, optimally solves a simplified version of the general formulation, and demonstrates that the solutions of the simpler problem are good approximations to the solutions of the more general problem.