IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v7y1973i2p138-157.html
   My bibliography  Save this article

Minimum Cost Schedules for a Public Transportation Route II. Examples

Author

Listed:
  • V. F. Hurdle

    (University of California, Berkeley, California)

Abstract

A fleet of vehicles carries passengers in one direction on a public transportation route, then returns to the dispatch point after a travel time T . The arrival rate of passengers is a known deterministic function of time and the objective is to devise a schedule that minimizes the total cost for passenger waiting time and vehicle operations. The optimal schedules for a number of hypothetical examples are found by applying principles derived in Part I and a procedure is given for constructing suboptimal schedules in cases where it is difficult to construct the optimal schedule.

Suggested Citation

  • V. F. Hurdle, 1973. "Minimum Cost Schedules for a Public Transportation Route II. Examples," Transportation Science, INFORMS, vol. 7(2), pages 138-157, May.
    • Handle: RePEc:inm:ortrsc:v:7:y:1973:i:2:p:138-157
    DOI: 10.1287/trsc.7.2.138
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.7.2.138
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.7.2.138?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Zhiwei & Li, Xiaopeng & Zhou, Xuesong, 2020. "Operational design for shuttle systems with modular vehicles under oversaturated traffic: Continuous modeling method," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 76-100.
    2. Yan, Shangyao & Chen, Hao-Lei, 2002. "A scheduling model and a solution algorithm for inter-city bus carriers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 805-825, November.
    3. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    4. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:7:y:1973:i:2:p:138-157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.