RESEARCH PAPERS: Technical Papers

Scheduling Delays in Synchronous Transportation Networks

[+] Author and Article Information
A. L. Kornhauser

Transportation Program, Department of Civil Engineering, Princeton University, Princeton, N. J.

P. J. McEvaddy

Department of Electrical Engineering, Princeton University, Princeton, N. J.

J. Dyn. Sys., Meas., Control 98(2), 173-179 (Jun 01, 1976) (7 pages) doi:10.1115/1.3427006 History: Received October 28, 1975; Online July 13, 2010


This paper investigates the performance of proposed network management policies responsible for routing and scheduling vehicles in automated transportation networks Performance is quantified in probabilistic terms of expected delays inherent to the scheduling process. Improved performance resulting from extensions of synchronous management to include considerations of multiple feasible routes and scheduled slot slipping is quantified and compared to quasi-synchronous management. This comparison suggests a bound on the minimum number of feasible routes and slot slipping capability for synchronous management to rival quasi-synchronous. The implications of network management on queue formation in stations and, consequently, on station design and layout are presented. It is found that synchronous-type management policies require parallel or lateral berthing in stations, whereas quasi-synchronous management imposes no such restriction on station design.

Copyright © 1976 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In