Deriving Link Travel-Time Distributions via Stochastic Speed Processes

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

References

  • Abate J., Choudhury G., Whitt W. On the Laguerre method for numerically inverting Laplace transforms. INFORMS J. Comput. (1996) 8:413–427LinkGoogle Scholar
  • Abate J., Choudhury G., Whitt W. Numerical inversion of multidimensional Laplace transforms by the Laguerre method. Performance Evaluation (1998) 31:229–243CrossrefGoogle Scholar
  • Anick D., Mitra D., Sondhi M. M. Stochastic theory of a data handling system with multiple sources. The Bell System Tech. J. (1982) 61:1871–1894CrossrefGoogle Scholar
  • Berry D. S., Belmont D. M. Distribution of vehicle speeds and travel times. (1951) Proc. 2nd Berkeley Sympos. Math. Statist. Probab.:589–602Google Scholar
  • Blue V., List G. F., Embrechts M. J. Neural net freeway travel time estimation. ANNIE'94 (1994) 4:1135–1140Google Scholar
  • Choudhury G. L., Lucantoni D., Whitt W. Multidimensional transform inversion with applications to the transient M/G/1 queue. The Ann. Appl. Probab. (1994) 4:719–740CrossrefGoogle Scholar
  • Coifman B. Estimating travel times and vehicle trajectories on freeways using dual loop detectors. Transportation Res. (2002) 36A:351–364Google Scholar
  • D'Angelo M., Haitham H. M., Wang M. C. Travel-time prediction for freeway corridors. Transportation Res. Record (1999) 1676:184–191CrossrefGoogle Scholar
  • Ditkin V. A., Prudnikov A. P.Operational Calculus in Two Variables and Its Applications (1962) 2nd ed.(Academic Press, New York) Google Scholar
  • Dubner H., Abate J. Numerical inversion of Laplace transform and finite Fourier Cosine transform. J. ACM (1968) 15:115–123CrossrefGoogle Scholar
  • Elwalid A. I., Mitra D. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/ACM Trans. Networking (1993) 1:329–343CrossrefGoogle Scholar
  • Frank H. Shortest paths in probabilistic graphs. Oper. Res. (1969) 17:583–599LinkGoogle Scholar
  • Hellinga B., Gudapati R. Estimating link travel times for advanced traveller information systems. (2000) Proc. 3rd Transportation Specialty Conf. Canadian Soc. Civil Engrg.(June 7–10)London, Ontario, CanadaGoogle Scholar
  • Jain R., Smith J. M. Modeling vehicular traffic flow using M/G/C/C state dependent queueing models. Transportation Sci. (1997) 31:324–336LinkGoogle Scholar
  • Kesidis G., Walrand J., Cheng-Shang C. Effective bandwidths for multi-class Markov fluids and other ATM sources. IEEE/ACM Trans. Networking (1993) 1:424–428CrossrefGoogle Scholar
  • Kulkarni V. G., Gautam N. Admission control of multi-class traffic with service priorities in high-speed networks. Queuing Systems (1997) 27:79–97CrossrefGoogle Scholar
  • Lighthill M. J., Whitham G. A. On kinematic waves II. A theory of traffic flow on long crowded roads. Proc. Royal Soc. (London), Series A (1955) 229:317–345CrossrefGoogle Scholar
  • MacDonald J. R. Accelerated convergence divergence, iteration, extrapolation, and curve fitting. J. Appl. Physics (1964) 35:3034–3041CrossrefGoogle Scholar
  • Miller-Hooks E. D., S Mahmassani H. Least expected time paths in stochastic, time-varying transportation networks. Transportation Sci. (2000) 34:198–215LinkGoogle Scholar
  • Mirchandani P., Soroush H. Optimal paths in probabilistic networks: A case with temporary preferences. Comput. Oper. Res. (1985) 25:365–381CrossrefGoogle Scholar
  • Moorthy M. V. Numerical inversion of two-dimensional Laplace transforms-Fourier series representation. Appl. Numerical Math. (1995) 17:119–127CrossrefGoogle Scholar
  • Park D., Rilett L., Han G. Forecasting multi-period freeway link travel times using neural networks with expanded input nodes. (1998) Proc. 1998 5th Internat. Conf. Adv. Tech. TransportationNewport Beach, CA:325–332Google Scholar
  • Singhal K., Vlach J., Vlach M. Numerical inversion of multi-dimensional Laplace transforms. Proc. IEEE (1975) 63:1627–1628CrossrefGoogle Scholar
  • Weeks W. T. Numerical inversion of Laplace transforms using Laguerre functions. J. ACM (1966) 13:419–429CrossrefGoogle Scholar
  • Wynn P. On the convergence and stability of the epsilon algorithm. SIAM J. Numerical Anal. (1966) 3:91–122CrossrefGoogle 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.