Optimal Slack Time for Schedule-Based Transit Operations

Published Online:https://doi.org/10.1287/trsc.1060.0170

References

  • Barnett A. On controlling randomness in transit operations. Transportation Sci. (1974) 8:102–116LinkGoogle Scholar
  • Barnett A. Control strategies for transport systems with nonlinear waiting costs. Transportation Sci. (1978) 12:119–136LinkGoogle Scholar
  • Brent R. P., Gustavson F. G., Yun D. Y. Y. Fast solution of Toeplitz systems of equations and computation of Pade approximations. J. Algorithms (1980) 1(3):259–295CrossrefGoogle Scholar
  • Bowman L. A., Turnquist M. A. Service frequency, schedule reliability and passenger wait times at transit stops. Transportation Res. Part A (1981) 15:465–471CrossrefGoogle Scholar
  • Carey M. Reliability of interconnected scheduled services. Eur. J. Oper. Res. (1994) 79:51–72CrossrefGoogle Scholar
  • Daley D. J., Kreinin A. YA., Trengove C. D. Inequalities concerning the waiting-time in single-server queues: A survey. Queueing Related Models, Oxford Statist. Sci. Ser. (1992) 9:177–223Google Scholar
  • Davies B.Integral Transforms and Their Applications (1985) 2nd ed.(Springer-Verlag, New York) CrossrefGoogle Scholar
  • Dessouky M. M., Hall R. W., Nowroozi A., Mourikas K. Bus dispatching at timed transfer transit stations using bus tracking technology. Transportation Res. Part C (1999) 7:187–208CrossrefGoogle Scholar
  • Dessouky M. M., Hall R. W., Zhang L., Singh A. Real-time control of buses for schedule coordination at a terminal. Transportation Res. Part A (2003) 37:145–164Google Scholar
  • Gohberg I. C., Feldman I. A.Convolution Equations and Projection Method for Their Solution. Translations of Mathematical Monographs (1974) 41(American Mathematical Society, Providence, RI) Google Scholar
  • Hochstadt H.Integral Equations (1973) (John Wiley & Sons, New York) Google Scholar
  • Kiefer J., Wolfowitz J. On the theory of queues with many servers. Trans. Amer. Math. Soc. (1955) 78(1):1–18CrossrefGoogle Scholar
  • Kiefer J., Wolfowitz J. On the characteristics of the general queueing process, with applications to random walks. Ann. Math. Statist. (1956) 27(1):147–161CrossrefGoogle Scholar
  • Lindley D. V. The theory of queues with a single server. Proc. Cambridge Philosophy Soc. (1952) 48:277–289CrossrefGoogle Scholar
  • Newell G. F. Control of pairing vehicles on a public transportation route, two vehicles, one control point. Transportation Sci. (1974) 9:248–264LinkGoogle Scholar
  • Osuna E. E., Newell G. F. Control strategies for an idealized public transportation system. Transportation Sci. (1972) 6:52–72LinkGoogle Scholar
  • Rao B. V., Feldman Richard M. Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue. Oper. Res. Lett. (2001) 28:51–62CrossrefGoogle Scholar
  • Turnquist M. A. A model for investigating the effects of service frequency and reliability on bus passenger waiting times. Transportation Res. Record (1978) 663:70–73Google Scholar
  • Wolff Ronald W.Stochastic Modeling and the Theory of Queues (1988) (Prentice Hall, NJ) Google Scholar
  • Zhao J., Bukkapatnam S., Dessouky M. M. Distributed architecture for real-time coordination of bus holding in transit networks. IEEE Trans. Intelligent Transportation Systems (2003) 4:43–51CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.