Minimum Cost Schedules for a Public Transportation Route II. Examples

Abstract
A fleet of vehicles carries passengers in one direction on a public transportation route, then returns to the dispatch point after a travel time T. The arrival rate of passengers is a known deterministic function of time and the objective is to devise a schedule that minimizes the total cost for passenger waiting time and vehicle operations. The optimal schedules for a number of hypothetical examples are found by applying principles derived in Part I and a procedure is given for constructing suboptimal schedules in cases where it is difficult to construct the optimal schedule.

This publication has 0 references indexed in Scilit: