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

A Branch-and-Bound Algorithm for Determining the Minimal Fleet Size of a Transportation System

Author

Listed:
  • Anders Martin-Löf

    (Royal Institute of Technology, Stockholm, Sweden)

Abstract

The problem of determining a schedule for a traffic system of, e.g., bus or air lines that uses a minimum number of vehicles is treated. The various trips are required to start within given time intervals and have given origins, destinations, and travel times. It is shown that the problem can be formulated as an integer LP problem, but not of the simple network flow type. A rather simple branch-and-bound procedure is devised for its solution, which has been tested with favorable results.

Suggested Citation

  • Anders Martin-Löf, 1970. "A Branch-and-Bound Algorithm for Determining the Minimal Fleet Size of a Transportation System," Transportation Science, INFORMS, vol. 4(2), pages 159-163, May.
    • Handle: RePEc:inm:ortrsc:v:4:y:1970:i:2:p:159-163
    DOI: 10.1287/trsc.4.2.159
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.4.2.159
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.4.2.159?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
    ---><---

    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:4:y:1970:i:2:p:159-163. 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.