Search

The paper presents a mathematical investigation into bus scheduling. The passenger arrival rate is supposed to be given; the problem is to determine the bus departure rate as a function of time. The primary objective is to minimize the number of buses that is needed. A secondary criterion is the minimization of the passenger waiting time, for which a calculus of variation technique is used. Although the paper deals mainly with a single busroute, it is also shown how the theory can be extended to the case of a pair of linked busroutes. The practical implications are illustrated by an example. The fleetsize formula that is used here is thought to be applicable to many transportation systems. [ABSTRACT FROM AUTHOR]

The paper discusses the computer construction of the lists of weeks of work that form the basis of the rotating roster for crews operating buses for a transit system. There are two construction phases; the first consists of making a day-off pattern and the second consists of placing daily shifts in the lists under the constraint of the day-off pattern. Techniques used to attain objectives include integer linear programming and optimal assignment. [ABSTRACT FROM AUTHOR]