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...

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...