Includes bibliographical references (p. 44).

Includes bibliographical references (p. 33-34).

A heuristic algorithm is described for a time-constrained version of the advance-request, multi-vehicle, many-to-many Dial-A-Ride Problem (DARP). The time constraints consist of upper bounds on: (1) the amount of time by which the pick-up or delivery of a customer can deviate from the desired...

Includes bibliographical references (p. 35-37).

We develop a new model for studying the phenomenon of congestion in a transient environment, focusing on the problem of aircraft landings at a busy "hub" airport. Our model is based on a Markov/semi-Markov treatment of changes in the weather, the principal source of uncertainty governing service...

This paper examines the problem of locating additional passenger facilities on a transportation network to supplement ones that already exist. A distinction is made between "supporting" facilities which operate only in concert with already existing ones and "new" facilities which are...

The standard procedures for sizing the spaces for passenger activities in airport terminals are unsatisfactory in that they easily lead to expensive errors. The essential difficulty lies in the nature of the process, and in particular with the several formulas which specify the area per...

Existing probabilistic solutions to the ground-holding problem in air traffic control are of a static nature, with ground-holds assigned to aircraft at the beginning of daily operations. In this paper we present an optimal dynamic solution that simplifies the structure of the control mechanism...