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

Anders Martin-Löf
Additional contact information
Anders Martin-Löf: Royal Institute of Technology, Stockholm, Sweden

Transportation Science, 1970, vol. 4, issue 2, 159-163

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.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.4.2.159 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:4:y:1970:i:2:p:159-163

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().