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

Technical Note---An Improved Lower Bound to the Minimum Fleet Size Problem

Author

Listed:
  • Helman I. Stern

    (Ben Gurion University of the Negeve, Beersheva, Israel)

  • Avishai Ceder

    (Technion-Israel Institute of Technology, Technion City, Haifa, Israel)

Abstract

We give a formal proof that a procedure similar to that used in the VAMPIRES program to find a starting fleet size is a lower bound on the minimum fleet size problem when deadheading trips are allowed. It is shown that this bound is stronger than the “simultaneous operation” bound used previously by the authors in the URDHC program. The URDHC program is an interactive bus scheduling program which inserts deadheading trips into a timetable in an effort to reduce the required fleet size. The “simultaneous operation” lower bound is equal to the maximum number of trips in a given timetable that are in simultaneous operation over the schedule horizon. The improved lower bound is based on the construction of a temporary timetable in which trips are extended to include potential linkages reflected by deadheading time considerations. One example is given to illustrate the construction of the improved bound. This improved lower bound can be usefully employed in the lower bound termination test of the URDHC program or other procedures for the fleet size reduction problem.

Suggested Citation

  • Helman I. Stern & Avishai Ceder, 1983. "Technical Note---An Improved Lower Bound to the Minimum Fleet Size Problem," Transportation Science, INFORMS, vol. 17(4), pages 471-477, November.
  • Handle: RePEc:inm:ortrsc:v:17:y:1983:i:4:p:471-477
    DOI: 10.1287/trsc.17.4.471
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.17.4.471
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.17.4.471?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. José Carbajal & Alan Erera & Martin Savelsbergh, 2013. "Balancing fleet size and repositioning costs in LTL trucking," Annals of Operations Research, Springer, vol. 203(1), pages 235-254, March.
    2. Liu, Tao & (Avi) Ceder, Avishai, 2017. "Deficit function related to public transport: 50 year retrospective, new developments, and prospects," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 1-19.

    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:17:y:1983:i:4:p:471-477. 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.